Advertisement

Parallel Cooperative Approaches for the Labor Constrained Scheduling Problem

  • Cristina C. B. Cavalcante
  • Victor F. Cavalcante
  • Celso C. Ribeiro
  • Cid C. de Souza
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 15)

Abstract

In this paper we consider the labor constrained scheduling problem (LCSP), in which a set of jobs to be processed is subject to precedence and labor requirement constraints. Each job has a specified processing time and a labor requirements profile, which typically varies as the job is processed. Given the amount of labor available at each period, the problem consists in determining starting times so as to minimize the overall makespan, subject to the precedence and labor constraints. We propose two parallel cooperative algorithms for LCSP: an asynchronous team and a parallel tabu search strategy. Both algorithms make use of cooperative processes that asynchronously exchange information gathered along their execution. Computational experiments on benchmark instances show that these parallel algorithms produce significantly better solutions than all sequential algorithms previously proposed in the literature.

Keywords

Tabu Search Precedence Constraint Priority Rule Tabu Search Algorithm Benchmark Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R.M. Aiex, S.L. Martins, C.C. Ribeiro, and N.R. Rodriguez. Cooperative Multi-Thread Paralell Tabu Search with an Application to Circuit Partitioning. Lecture Notes in Computer Science, 1457:310–331, 1998.CrossRefGoogle Scholar
  2. [2]
    L. Baerentzen, P. Avila, and S. Talukdar. Learning Network Design for Asynchronous Teams. Lecture Notes in Artificial Intelligence, 1237:177–196, 1997.Google Scholar
  3. [3]
    K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974.Google Scholar
  4. [4]
    C.B. Cavalcante, Y. Colombani, S. Heipcke, and C.C. Souza. Scheduling under Labour Resource Constraints. Constraints, 5:415–422, 2000.MATHCrossRefGoogle Scholar
  5. [5]
    C.B. Cavalcante and C.C. Souza. A Tabu Search Approach for Scheduling Problem under Labour Constraints. Technical Report, State University of Campinas, Institute of Computing, IC–97–13, 1997.Google Scholar
  6. [6]
    C.B. Cavalcante, C.C. Souza, M.W. Savelsbergh, Y.Wang, and L.A. Wolsey. Scheduling Projects with Labor Constraints. To appear in: Discrete Applied Mathematics. Google Scholar
  7. [7]
    V.F. Cavalcante. Asynchronous Teams for the Job Shop Scheduling Problem: Construction Heuristic (in Portuguese). M.Sc. Dissertation, State University of Campinas, Institute of Computing, 1995.Google Scholar
  8. [8]
    C.C.B. Cavalcante. Scheduling Under Labour Constraints: Heuristics and Lower Bounds (in Portuguese). M.Sc. Dissertation, State University of Campinas, Institute of Computing, 1998.Google Scholar
  9. [9]
    J. Chakaprani and J. Skorin-Kapov. Massively Parallel Tabu Search for the Quadratic Assignment Problem. Annals of Operations Research, 41:327–341, 1993.CrossRefGoogle Scholar
  10. [10]
    J. Chakaprani and J. Skorin-Kapov. Connection Machine Implementation of a Tabu Search for the Traveling Salesman Problem. Journal of Computing and Information Technology, 1:29–36, 1993.Google Scholar
  11. [11]
    P. Chang, J. Dolan, J. Hemmerle, S. Talukdar, and M. Terk. Asynchronous Teams: An Agent-Based Problem-Solving Architecture. Artificial Neural Networks in Engineering, 7:73–78, 1997.Google Scholar
  12. [12]
    T.G. Crainic, M. Toulouse, and M. Gendreau. Parallel Asynchronous Tabu Search for Multicommodity Location-Allocation with Balancing Requirements. Annals of Operations Research, 63:277–299, 1993.CrossRefGoogle Scholar
  13. [13]
    T.G. Crainic, M. Toulouse, and M. Gendreau. Synchronous Tabu Search Parallelization Strategies for Multicommodity Location-Allocation with Balancing Requirements. OR Spektrum, 17:113–123, 1995.MATHCrossRefGoogle Scholar
  14. [14]
    V.-D. Cung, S.L. Martins, C.C. Ribeiro, and C. Roucairol. Strategies for the Parallel Implementation of Metaheuristics. In: Essays and Surveys in Metaheuristics, C.C. Ribeiro and P. Hansen, editors, Kluwer, 2001 (this volume).Google Scholar
  15. [15]
    E.W. Davis and J.H. Patterson. A Comparison of Heuristics and Optimum Solutions in Resource Constrained Project Scheduling. Management Science, 21:944–955, 1975.CrossRefGoogle Scholar
  16. [16]
    F. Glover. Tabu Search — Part I. ORSA Journal on Computing, 1:190–206, 1989.MathSciNetMATHCrossRefGoogle Scholar
  17. [17]
    F. Glover. Tabu Search — Part II. ORSA Journal on Computing, 2:4–32, 1990.MATHCrossRefGoogle Scholar
  18. [18]
    F. Glover and M. Laguna. Tabu Search. Kluwer, 1997.MATHCrossRefGoogle Scholar
  19. [19]
    E.G. Haddad. Asynchronous Teams for the Job Shop Scheduling Problem: Improvement Heuristics (in Portuguese). M.Sc. Dissertation, State University of Campinas, Institute of Computing, 1996.Google Scholar
  20. [20]
    S. Heipcke. A New Constraint Programming Approach to Large Scale Resource Constrained Scheduling. Diploma-Thesis, Mathematisch Geographische Fakultat, Katholische Universitat Eichstatt, 1995.Google Scholar
  21. [21]
    S. Heipcke and Y. Colombani. A New Constraint Programming Approach to Large Scale Resource Constrained Scheduling. Presented at the Workshop on Models and Algorithms for Planning and Scheduling Problems, Cambridge, 1997.Google Scholar
  22. [22]
    J.H. Patterson. Project Scheduling: The Effects of Problem Structure on Heuristic Performance. Naval Research Logistics Quaterly, 20:95–123, 1976.MathSciNetCrossRefGoogle Scholar
  23. [23]
    H.P. Peixoto. A Methodology for the Specification of Asynchronous Teams for Combinatorial Optimization Problems (in Portuguese). M.Sc. Dissertation, State University of Campinas, Institute of Computing, 1995.Google Scholar
  24. [24]
    S.C. Porto and C.C. Ribeiro. Parallel Tabu Search Message-Passing Synchronous Strategies for Task Scheduling under Precedence Constraints. Journal of Heuristics, 1:107–223, 1996.CrossRefGoogle Scholar
  25. [25]
    J. Rachlin, R. Goodwin, S. Murthy, R. Akkiraju, F. Wu, S. Kumaran, and R. Das. A-Teams: An Agent Architecture for Optimization and Decision-Support. Lecture Notes in Artificial Intelligence, 1555:261–276, 1999.Google Scholar
  26. [26]
    C. Rego and C. Roucairol. A Parallel Tabu Search Algorithm using Ejection Chains for the VRP. In: Metaheuristics: Theory and Applications, I.H. Osman and J.P. Kelly, editors, pages 253–295, Kluwer, 1996.Google Scholar
  27. [27]
    Y. Rochat and É.D. Taillard. Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics, 1:147–167, 1995.MATHCrossRefGoogle Scholar
  28. [28]
    M.W. Savelsbergh, R.N. Uma, and J. Wein. An Experimental Study of LP-based Approximation Algorithms for Scheduling Problems. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 453–462, 1998.Google Scholar
  29. [29]
    M.W. Savelsbergh, Y. Wang, and L.A. Wolsey. Computational Experiments with a Large-Scale Resource Constrained Project Scheduling Problem. Note, Georgia Institute of Technology, 1996.Google Scholar
  30. [30]
    C.C. Souza and L.A. Wolsey. Scheduling Projects with Labour Constraints. Technical Report, State University of Campinas, Institute of Computing, IC–97–13, 1997.Google Scholar
  31. [31]
    P.S. Souza. Asynchronous Organizations for Multi-Algorithm Problems. Ph.D. Dissertation, Electrical and Computer Engineering Department, Carnegie Mellon University, 1993.Google Scholar
  32. [32]
    P.S. Souza and S.N. Talukdar. Genetic Algorithms in Asynchronous Teams. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pages 392–397, Morgan Kaufmann, 1991Google Scholar
  33. [33]
    R.H. Storer and S.D. Wu, and R. Vaccari. New Search Spaces for Sequence Problems with Applications to Job Shop Scheduling. Management Science, 38:1495–1509, 1992.MATHCrossRefGoogle Scholar
  34. [34]
    E.D. Taillard. Robust Taboo Search Techniques for the Quadratic Assignment Problem. Parallel Computing, 17:443–455, 1991.MathSciNetCrossRefGoogle Scholar
  35. [35]
    E.D. Taillard. Parallel Taboo Search Techniques for the Job Shop Scheduling Problem. ORSA Journal on Computing, 6:108–117, 1994.MATHCrossRefGoogle Scholar
  36. [36]
    S.N. Talukdar, L. Baerentzen, and A. Gove. Asynchronous Teams: Cooperation Schemes for Autonomous Agents. Journal of Heuristics, 4:295–321, 1998.CrossRefGoogle Scholar
  37. [37]
    S.N. Talukdar, S.S. Pyo, and T. Giras. Asynchronous Procedures for Parallel Processing. IEEE Transactions on Power Apparatus and Systems, PAS-102:3652–3659, 1983.Google Scholar
  38. [38]
    M.G.A. Verhoeven and E.H.L. Aarts. Parallel Local Search. Journal of Heuristics, 1:43–65, 1995.MATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Cristina C. B. Cavalcante
    • 1
  • Victor F. Cavalcante
    • 1
  • Celso C. Ribeiro
    • 2
  • Cid C. de Souza
    • 1
  1. 1.Institute of ComputingUniversidade Estadual de CampinasCampinasBrazil
  2. 2.Department of Computer ScienceCatholic University of Rio de JaneiroRio de JaneiroBrazil

Personalised recommendations