Project scheduling with time-varying resource constraints

International Journal of Production Research

Volumn 38, Issue 16, 2000, Pages 3937-3952

  Klein, Robert ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT ENGINEERING; CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING;

PROJECT SCHEDULING;

SCHEDULING;

EID: 0034634797     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540050176094     Document Type: Article

References (31)

1. Baar, T., Brucker P. and Knust, S., 1998, Tabu-search algorithms for the resource-constrained project scheduling problem. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, edited by S. VOSS, S. Martello, I. Osman and C. Roucairol (Boston: Kluwer), pp. 1-18.
2. Battiti, R. and Tecchiolli, G., 1994, The reactive tabu search. ORSA Journal on Computing, 6, 126-140.
3. Boctor, F.F., 1996, Resource-constrained project scheduling by simulated annealing. International Journal of Production Research, 34, 2335-2351.
4. Bouleimen, K. and Lecocq, H., 1998, A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem. Working Paper, University of Liège.
5. Brooks, G.H. and White, C.R., 1965, An algorithm for finding optimal or near optimal solutions to the production scheduling problem. Journal of Industrial Engineering, January February, 34-40.
6. Brucker, P., Drexl, A., Möhring, R., Neumann, K. and Pbsch, E., 1999, Resource-constrained project scheduling - Notation, classification, models, and methods. European Journal of Operational Research, 112, 3-41.
7. Carlton, W.B. and Barnes, J.W., 1996, A note on hashing functions and tabu search algorithms. European Journal of Operational Research, 95, 237-239.
8. Demeulemeester, E.L. and Herroelen, W.S., 1996, Modeling setup times, process batches and transfer batches using activity network logic. European Journal of Operational Research, 89, 355-365; 1997, A branch-and-bound procedure for the generalized resource-constrained project scheduling problem. Operations Research, 45, 201-212.
9. Demeulemeester, E.L. and Herroelen, W.S., 1996, Modeling setup times, process batches and transfer batches using activity network logic. European Journal of Operational Research, 89, 355-365; 1997, A branch-and-bound procedure for the generalized resource-constrained project scheduling problem. Operations Research, 45, 201-212.
10. De Reyck, B., Demeulemeester, E.L. and Herroelen, W.S., 1999, Algorithms for scheduling projects with generalized precedence relations. Handbook on Recent Advances in Project Scheduling, edited by J. Weglarz (Boston: Kluwer), pp. 77-106.
11. Glover, F. and Laguna, M., 1997, Tabu Search (Boston: Kluwer).
12. Hartmann, S., 1997, Scheduling medical research experiments-An application of project scheduling methods. Manuskripte aus den Instituten für Betriebswirtsehaftslehre, 452, University of Kiel.
13. Hartmann, S., 1998, A competitive genetic alogrithm for resource-constrained project scheduling. Naval Research Logistics, 45, 733-750.
14. Herroelen, W.S., Demeulemeester, E.L. and De Reyck, B., 1998, Resource-constrained project scheduling a survey of recent developments. Computers & Operations Research, 25, 279-302.
15. Kelley, J.E., 1963, The critical-path method: resources planning and scheduling. Industrial Scheduling, edited by J.F. Muth and G.L. Thompson (Englewood Cliffs: Prentice Hall), pp. 347-365.
16. Klein, R., 2000a, Bidirectional planning-improving priority rule based heuristics for scheduling resource-constrained projects. To appear in: European Journal of Operational Research, 127; 2000b, Scheduling of Resource-Constrained Projects (Boston: Kluwer).
17. Klein, R., 2000a, Bidirectional planning-improving priority rule based heuristics for scheduling resource-constrained projects. To appear in: European Journal of Operational Research, 127; 2000b, Scheduling of Resource-Constrained Projects (Boston: Kluwer).
18. Klein, R. and Scholl, A., 1998, Progress: Optimally solving the generalized resource-constrained project scheduling problem. Mathematical Methods of Operations Research, to be published; 1999, Scattered branch and bound An adaptive search strategy applied to resource-constrained project scheduling. Central European Journal of Operations Research, 7, 177-201.
19. Klein, R. and Scholl, A., 1998, Progress: Optimally solving the generalized resource-constrained project scheduling problem. Mathematical Methods of Operations Research, to be published; 1999, Scattered branch and bound An adaptive search strategy applied to resource-constrained project scheduling. Central European Journal of Operations Research, 7, 177-201.
20. Kolisch, R., 1996a, Efficient priority rules for the resource-constrained project scheduling problem. Journal of Operations Management, 14, 179-192; 1996b, Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. European Journal of Operational Research, 90, 320-333.
21. Kolisch, R., 1996a, Efficient priority rules for the resource-constrained project scheduling problem. Journal of Operations Management, 14, 179-192; 1996b, Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. European Journal of Operational Research, 90, 320-333.
22. Kolisch, R. and Hartmann, S., 1999, Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis. Handbook on Recent Advances in Project Scheduling, edited by J. Weglarz (Boston: Kluwer), pp. 147-178.
23. Kolisch, R., Sprecher, A. and Drexl, A., 1995, Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science, 41, 1693-1703.
24. Kolisch, R., Schwindt, Ch. and Sprecher, A. 1999, Benchmark instances for project scheduling problems. Handbook on Recent Advances in Project Scheduling, edited by J. Weglarz (Boston: Kluwer), pp. 197-212.
25. Leon, V.J. and Balakrishnan, R., 1995, Strength and adaptability of problem-space based neighbourhoods for resource-constrained scheduling. OR Spektrum, 17, 173-182.
26. Moder, J.J., Phillips, C.R. and Davis, E.W., 1983, Project Management with CPM, PERT, and Precedence Diagramming, 3rd edn (New York: Van Nostrand Reinhold).
27. Neumann, K. and Schwindt, Ch., 1997, Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production. OR Spektrum, 19, 205-217.
28. Patterson, J.H., 1984, A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem. Management Science, 30, 854-867.
29. Simpson, W.P. and Patterson, J.H., 1996, A multiple-tree search procedure for the resource-constrained project scheduling problem. European Journal of Operational Research, 89, 525-542.
30. Sprecher, A., Kolisch, R. and Drexl, A., 1995, Semi-active, active and nondelay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research, 80, 94-102.
31. Woodruff, D.L. and Zemel, E., 1993, Hashing vectors for tabu search. Annals of Operations Research, 41, 123-128.