New LP-based lower bound for the cumulative scheduling problem

European Journal of Operational Research

Volumn 127, Issue 2, 2000, Pages 363-382

  Carlier, Jacques ^a   Néron, Emmanuel ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; GRAPH THEORY; ITERATIVE METHODS; PRODUCTION; RESOURCE ALLOCATION; SCHEDULING;

CUMULATIVE SCHEDULING PROBLEM; LINEAR PROGRAMMING BASED LOWER BOUND; RESOURCE CONSTRAINTS;

LINEAR PROGRAMMING;

EID: 0342572499     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00494-4     Document Type: Article

References (16)

1. Baptiste P., Le Pape C., Nuijten W. Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research. 92:1999;305-333.
2. Ph. Baptiste, C. Le Pape, Constraints propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems, in: Lecture Notes in Computer Science 1330, Springer, Berlin, 1997.
3. Brucker P., Knust S., Schoo A., Thiele O. A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research. 107:1998;272-288.
4. J. Carlier, Problèmes d'Ordonnancement à Contraintes de Ressources: Algorithmes et Complexité, Thèse de Doctorat d'Etat, University of Paris VI, 1984.
5. Carlier J., Pinson E. A practical use of Jackson's preemptive schedule for solving the job shop. Annals of Operations Research. 26:1990;269-287.
6. J. Carlier, E. Néron, A new branch and bound method for solving the resource constrained project scheduling problem, in: Proceedings of the Fifth International Workshop on Project Management and Scheduling, Poznan, 1996, pp. 61-65.
7. max problem Annals of Operations Research. 83:1998;41-58.
8. Demeulemeester E., Herroelen W. A branch-and-bound procedure for the multiple resource constrained project scheduling problem. Management Science. 38:1992;1803-1818.
9. Kolish R., Sprecher A., Drexl A. Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science. 41:1995;1693-1703.
10. P. Lopez, Approche énergétique pour l'Ordonnancement de Tâches sous Contraintes de Temps et de Ressources, PhD Thesis, Université Paul Sabatier, Toulouse, 1995.
11. Mingozzi A., Maniezzo V., Riccardielli S., Bianco L. An exact algorithm for project scheduling with resource constraints based on new mathematical formulations. Management Science. 44:1998;714-729.
12. Patterson J.H. A comparison of exact approaches for solving the multiple constrained resource project scheduling problem. Management Science. 30:1984;854-867.
13. M. Perregaard, Branch and bound methods for the multi-processor job-shop and flow-shop scheduling problems, M.Sc. Thesis, University of Copenhagen, 1995.
14. J. Riordan, in: R.E Krieger, Combinatorial Identities, 1979.
15. A. Sprecher, Resource-Constrained Project Scheduling - Exact Methods for the Multi-Mode Case, Springer, Berlin, 1994.
16. A. Vandevelde, Minimizing the makespan in a multiprocessor flow shop, M.Sc. Thesis, Eindhoven University of Technology, 1994.