Skip to main content
SpringerLink
Log in

Scheduling under Labour Resource Constraints

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

In this paper we introducean optimisation problem extracted from an industrial application:the scheduling problem under labour constraints. After givinga short summary of the origins of this problem and its mathematicalformulation, the different methods used for solving it (at leastpartially) are briefly described. In the last part, we presenta set of 25 instances of different sizes for benchmark purposes.So far, only 5 of these test instances have been solved to optimality,the others remaining open.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Alvarez-Valdés OlagÚýbel and J.M. Tamarit Goerlich. (1989). Heuristic algorithms for resourceconstrained project scheduling: a review and an empirical analysis. In Advances in Project Scheduling, Amsterdam: Elsevier, pages 113-134.

    Google Scholar 

  2. P. Baptiste and C. Le Pape. (1997). Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. In Principles and Practice of Constraint Programming-CP97, Berlin, Heidelberg: Springer.

    Google Scholar 

  3. M. Bartusch, R.H. Möhring, and F.J. Radermacher. (1988). Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16: 201-240.

    Google Scholar 

  4. C.C.B. Cavalcante, C.C. de Souza, M.W.P. Savelsbergh, Y. Wang, and L.A. Wolsey. (1998). Scheduling projects with labor constraints. Core discussion paper 9859, Université Catholique de Louvain, Belgium. Accepted for publication in Discrete and Applied Mathematics (special issue of CO98).

    Google Scholar 

  5. C.C.B. Cavalcante and C.C. de Souza. (1997). A tabu search approach for scheduling problem under labour constraints. Technical Report IC-97-13, State University of Campinas. http://www.dcc.unicamp.br/reltecftp/ Titles.html.

  6. COME Manual. (1993). Ars Nova, Freiburg.

  7. M.R. Garey and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP completeness. San Francisco: W.H. Freeman & Company.

    Google Scholar 

  8. F. Glover. (1989). Tabu search-part i. ORSA Journal on Computing, 1(3): 190-206.

    Google Scholar 

  9. F. Glover. (1990). Tabu search-part ii. ORSA Journal on Computing, 2(3): 3-32.

    Google Scholar 

  10. S. Heipcke. (1995). Resource Constrained Job-Shop Scheduling with Constraint Nets. Two Case Studies. Diplomarbeit, Kath. Universität Eichstätt, Eichstätt.

    Google Scholar 

  11. S. Heipcke. (1996). Resource Constrained Scheduling with COME. In Proceedings of the Second International Conference on the Practical Application of Constraint Technology, PACT 96, London, UK.

  12. S. Heipcke and Y. Colombani. (1997). A New Constraint Programming Approach to Large Scale Resource Constrained Scheduling. Presentation at Third Workshop on Scheduling and Planning, Cambridge, UK.

  13. S. Heipcke and Y. Colombani. (1997). The Constraint Solver SchedEns. Tutorial and Documentation. Technical Report 241, LIM Laboratoire d'Informatique de Marseille.

  14. A. Ikonomou. (1999). Tabu Search for Labour-Resource Constrained Scheduling Problems with Minimum and Maximum Buffer Times. PhD thesis, University of Buckingham, School of Business.

  15. E.L. Johnson, G.L. Nemhauser, and M.W.P. Savelsbergh. (1997). Progress in Integer Programming: An Exposition. Submitted to INFORMS J. on Computing.

  16. R. Kolisch, A. Sprecher, and A. Drexl. (1995). Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems. Management Science, 41(10): 1693-1703.

    Google Scholar 

  17. R. Möhring, F. Stork, and M. Uetz. (1998). Resource Constrained Project Scheduling with TimeWindows: a Branching Scheme Based on Dynamic Release Dates. Technical Report 596/1998, Fachbereich Mathematik, Technische Universität Berlin.

  18. J.H. Patterson. (1984). A Comparison of Exact Approaches for Solving the Multiple Constrained Resource Project Scheduling Problem. Management Science, 30(7): 854-867.

    Google Scholar 

  19. L.A. Wolsey and C.C. de Souza. (1997). Scheduling projects with labour constraints. Technical Report IC-97-22, State University of Campinas. http://www.dcc.unicamp.br/reltec-ftp/Titles.html.

Download references

Author information

Authors and Affiliations

  1. Dash Associates Ltd., Quinton Lodge, Binswood Avenue, Leamington Spa, CV32 5TH, U.K.

    Susanne Heipcke & Yves Colombani

  2. ILOG SA, 9, rue de Verdun, BP 85, F-94253, Gentilly Cedex, France

    Cristina C. B. Cavalcante

  3. Instituto de Computacão, Universidade Estadual de Campinas—UNICAMP, Caixa Postal 6176, 13081-970, Campinas—SP, Brasil

    Cid C. de Souza

Authors
  1. Susanne Heipcke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yves Colombani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cristina C. B. Cavalcante
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Cid C. de Souza
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Heipcke, S., Colombani, Y., Cavalcante, C.C.B. et al. Scheduling under Labour Resource Constraints. Constraints 5, 415–422 (2000). https://doi.org/10.1023/A:1009860311452

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009860311452

Search

Navigation