Scheduling resource-constrained projects competitively at modest memory requirements

Management Science

Volumn 46, Issue 5, 2000, Pages 710-723

  Sprecher, Arno ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INFORMATION RETRIEVAL SYSTEMS; NONLINEAR PROGRAMMING; RESOURCE ALLOCATION; SCHEDULING; STORAGE ALLOCATION (COMPUTER);

BRANCH AND BOUND; RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM; SINGLE MODE;

OPTIMIZATION;

EID: 0033691202     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.46.5.710.12044     Document Type: Article

References (14)

1. Brucker, P., S. Knust, A. Schoo, and O. Thiele. 1998. A branch and bound algorithm for the resource-constrained project scheduling problem. European J. of Oper. Res. 107 272-288.
2. Demeulemeester, E., W. Herroelen. 1992. A branch- and-bound procedure for the multiple resource-constrained project scheduling problem. Management Sci. 38 1803-1818.
3. _, _. 1997. New benchmark results for the resource-constrained project scheduling problem. Management Sci. 43 1485-1492.
4. Elmaghraby, S. E. 1977. Activity Networks: Project Planning And Control By Network Models. Wiley, New York.
5. Garey, M. R., D. S. Johnson. 1979. Computers And Intractability: A Guide To The Theory Of NP-Completeness. Freeman, San Francisco, CA.
6. Kolisch, R., A. Sprecher. 1996. PSPLIB - a project scheduling problem library. European J. Oper. Res. 96. 205-216.
7. _, _, A. Drexl. 1995. Characterization and generation of a general class of resource-constrained project scheduling problems. Management Sci. 41 1693-1703.
8. Mingozzi, A., V. Maniezzo, S. Ricciardelli, L. Bianco. 1998. An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Management Sci. 44 714-729.
9. Patterson, J. H., R. Slowinski, F. B. Talbot, J. Weglarz. 1989. An algorithm for a general class of precedence and resource-constrained scheduling problems. R. Slowinski, J. Weglarz, eds. Advances In Project Scheduling. Elsevier, Amsterdam, The Netherlands, 3-28.
10. Sprecher, A. 1999. A competitive exact algorithm for assembly line balancing. Internat. J. Production Res. 37 1787-1816.
11. _, A. Drexl. 1998. Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. European J. Oper. Res. 107 431-450.
12. _, R. Kolisch, A. Drexl. 1995. Semi-active, active and non-delay schedules for the resource-constrained project scheduling problem. European J. Oper. Res. 80 94-102.
13. Stinson, J. P., E. W. Davis, B. M. Khumawala. 1978. Multiple resource-constrained scheduling using branch and bound. AIIE Trans. 10 252-259.
14. Talbot, F. B., J. H. Patterson. 1978. An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems. Management Sci. 24 1163-1174.