Tight LP bounds for resource constrained project scheduling

OR Spectrum

Volumn 26, Issue 2, 2004, Pages 251-262

  Baptiste, Philippe ^a   Demassey, Sophie ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF AVIGNON   (France)

Author keywords

Branch bound; Constraint programming; Linear programming; Resource constrained project scheduling

Indexed keywords

EID: 15344348592     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-003-0155-1     Document Type: Article

References (23)

1. Baptiste P, Le Pape C (1995) A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence
2. Baptiste P, Le Pape C (2000) Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints 5:119-139
3. Baptiste P, Le Pape C, Nuijten W (2001) Constraint-based scheduling, vol 39 of ISOR. Kluwer, Amsterdam
4. Brucker P, Knust S (2000) A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research 127: 355-362
5. Carlier J, Néron E (2000) A new lp based lower bound for the cumulative scheduling problem. EJOR 127(2): 363-382
6. Carlier J, Pinson E (1990) A practical use of Jackson's preemptive schedule for solving the job-shop problem. Annals of Operations Research 26: 269-287
7. Carlier J, Pinson E (2002) Jackson's pseudo preemptive schedule and cumulative scheduling problems. Technical report, University of Compiègne
8. Caseau Y, Laburthe F (1996) Cumulative scheduling with task intervals. In: Maher M (ed) Proceedings of the Joint International Conference and Symposium on Logic Programming, JCPSLP'96, pp 363-377. The MIT Press, Cambridge, MA
9. Cesta A, Oddi A (1996) Gaining efficiency and flexibility in the simple temporal problem. In: Proc. 3rd International Workshop on Temporal Representation and Reasoning
10. Christofides N, Alvarez-Valdés R, Tamarit JM (1987) Project scheduling with resource constraints: a branch and bound approach. European Journal of Operational Research 29(3): 262-273
11. Demassey S, Artigues C, Michelon P (2003) Constraint-propagation-based cutting planes: An application to the resource-constrained project-scheduling problem. INFORMS Journal on Computing (to appear)
12. Demeulemeester EL, Herroelen WS (2002) Project scheduling: a research handbook, vol 39 of ISOR. Kluwer, Amsterdam
13. Dorndorf U, Phan-Huy T, Pesch E (1999) A survey of interval capacity consistency tests for time- and resource-constrained scheduling, chap 10, pp 213-238. Kluwer, Amsterdam
14. Erschler J, Lopez P, Thuriot C (1991) Raisonnement temporel sous contraintes de ressources et problèmes d'ordonnancement. Revue d'Intelligence Artificielle 5: 7-32
15. Garey MR, Johnson DS (1979) Computers and intractibility. A guide to the theory of NP-completeness. Freeman, New York
16. Gondran M, Minoux M (1984) Graphs and algorithms. Wiley, New York
17. Klein R, Scholl A (1999) Computing lower bound by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research 112: 322-346
18. Kolisch R, Hartmann S (1999) Algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis. In: Weglarz J (ed) Handbook on recent advances in project scheduling, chap 7. Kluwer, Amsterdam
19. Le Pape C (1994) Implementation of resource constraints in ILOG SCHEDULE: A library for the development of constraint-based scheduling systems. Intelligent Systems Engineering 3(2): 55-66
20. Lhomme O (1993) Consistency techniques for numeric csps. In: Proc. 13th International Joint Conference on Artificial Intelligence
21. Lopez P, Erschler J, Esquirol P (1992) Ordonnancement de tâches sous contraintes: une approche énergétique. R.A.I.R.O. APII 26(5-6): 453-481
22. Mingozzi A, Maniezzo V, Ricciardelli S, Bianco L (1998) An exact algorithm for the multiple resource-constrained project scheduling problem based on a new mathematical formulation. Management Science 44:714-729
23. Nuijten W (1994) Time and resource constrained scheduling: A constraint satisfaction approach. PhD thesis, Eindhoven University of Technology