Order-based neighborhoods for project scheduling with nonregular objective functions

European Journal of Operational Research

Volumn 149, Issue 2, 2003, Pages 325-343

  Neumann, K ^a   Schwindt, C ^a   Zimmermann, J ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

General temporal constraints; Nonregular objective functions; Order based neighborhoods; Project scheduling; Resource allocation

Indexed keywords

CONSTRAINT THEORY; FUNCTIONS; GRAPH THEORY; OPTIMIZATION; RESOURCE ALLOCATION; SCHEDULING; TREES (MATHEMATICS);

GENERAL TEMPORAL CONSTRAINTS;

PROJECT MANAGEMENT;

EID: 0037846132     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00765-8     Document Type: Conference Paper

References (38)

1. Aarts E., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;Wiley, Chichester.
2. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows. 1993;Prentice Hall, Englewood Cliffs.
3. Baar T., Brucker P., Knust S. Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem. Voss S., Martello S., Osman I., Roucairol C. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. 1998;1-18 Kluwer, Boston.
4. Bandelloni M., Tucci M., Rinaldi R. Optimal resource leveling using non-serial dynamic programming. European Journal of Operational Research. 78:1994;162-177.
5. Bartusch M., Möhring R.H., Radermacher F.J. Scheduling project networks with resource constraints and time windows. Annals of Operations Research. 16:1988;201-240.
6. Bouleimen, K., Lecocq, H., 1998. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem, Technical Report, Service de Robotique et Automatisation, University of Liège.
7. Brucker P., Drexl A., Möhring R.H., Neumann K., Pesch E. Resource-constrained project scheduling: notation, classification, models, and methods. European Journal of Operational Research. 112:1999;3-41.
8. Cho J.H., Kim Y.D. A simulated annealing algorithm for resource constrained project scheduling problems. Journal of the Operational Research Society. 48:1997;736-744.
9. Demeulemeester E. Minimizing resource availability costs in time-limited project networks. Management Science. 41:1995;1590-1598.
10. De Reyck B., Herroelen W. An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations. Computers and Operations Research. 25:1998;1-17.
11. Easa S.M. Resource leveling in construction by optimization. Journal of Construction Engineering and Management. 115:1989;302-316.
12. Franck B., Neumann K., Schwindt C. Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spektrum. 23:2001;297-324.
13. Herroelen W., van Dommelen P., Demeulemeester E.L. Project network models with discounted cash flows: a guided tour through recent developments. European Journal of Operational Research. 100:1997;97-121.
14. Herroelen W., Demeulemeester E., De Reyck B. A classification scheme for project scheduling. Wȩglarz J. Project Scheduling: Recent Models, Algorithms and Applications. 1999;1-26 Kluwer, Boston.
15. Icmeli O., Erengüç S.S. A tabu search procedure for the resource-constrained project scheduling problem with discounted cash flows. Computers and Operations Research. 21:1994;841-853.
16. Icmeli O., Erengüç S.S. A branch and bound procedure for the resource-constrained project scheduling problem with discounted cash flows. Management Science. 42:1996;1395-1408.
17. Kolisch R., Hartmann S. Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis. Wȩglarz J. Project Scheduling: Recent Models, Algorithms and Applications. 1999;147-178 Kluwer, Boston.
18. Lee J.K., Kim Y.D. Search heuristics for resource constrained project scheduling. Journal of the Operational Research Society. 47:1996;678-689.
19. Leon V.J., Balakrishnan R. Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling. OR Spektrum. 17:1995;173-182.
20. Mayer H. Projektplanung bei beschränkten Ressourcen: Effiziente Lösungsverfahren zur Kapitalwertmaximierung. 1998;Peter Lang, Frankfurt a.M.
21. Naphade K.S., Wu S.D., Storer R.H. Problem space search algorithms for resource-constrained project scheduling. Annals of Operations Research. 70:1997;307-326.
22. Neumann K., Schwindt C. Activity-on-node networks with minimal and maximal time-lags and their application to make-to-order production. OR Spektrum. 19:1997;205-217.
23. Neumann K., Zimmermann J. Heuristic methods for resource-constrained project scheduling with regular and nonregular objective functions and schedule-dependent time windows. Wȩglarz J. Project Scheduling: Recent Models, Algorithms and Applications. 1999;261-287 Kluwer, Boston.
24. Neumann K., Zimmermann J. Resource levelling for projects with schedule-dependent time windows. European Journal of Operational Research. 117:1999;591-605.
25. Neumann K., Zimmermann J. Procedures for resource levelling and net present value problems in project scheduling with general temporal and resource constraints. European Journal of Operational Research. 127:2000;425-443.
26. Neumann, K., Zimmermann, J., 2003. Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints. Central European Journal of Operations Research, to appear.
27. Neumann K., Nübel H., Schwindt C. Active and stable project scheduling. Mathematical Methods of Operations Research. 52:2000;441-465.
28. Neumann, K., Schwindt, C., Zimmermann, J., 2002. Project Scheduling with Time Windows and Scarce Resources. Lecture Notes in Economics and Mathematical Systems, vol. 508. Springer, Berlin.
29. Nübel, H., 1999. A branch-and-bound procedure for the resource investment problem subject to temporal constraints. Technical Report WIOR-574, University of Karl-sruhe.
30. Pinson, E., Prins, C., Rullier, F., 1994. Using tabu search for solving the resource-constrained project scheduling problem. In: Proceedings of the Fourth International Workshop on Project Management and Scheduling, Leuven, pp. 102-106.
31. Russell A.H. Cash flows in networks. Management Science. 16:1970;357-373.
32. Sampson S.E., Weiss E.N. Local search techniques for the generalized resource constrained project scheduling problem. Naval Research Logistics. 40:1993;665-675.
33. Schwindt C. Minimizing earliness-tardiness costs of resource-constrained projects. Inderfurth K., Schwödiauer G., Domschke W., Juhnke F., Kleinschmidt P., Wäscher G. Operations Research Proceedings 1999. 2000;402-407 Springer, Berlin.
34. Schwindt C., Zimmermann J. A steepest ascent approach to maximizing the net present value of projects. Mathematical Methods of Operations Research. 53:2001;435-450.
35. Yang K.K., Tay L.C., Sum C.C. A comparison of stochastic scheduling rules for maximizing project net present value. European Journal of Operational Research. 85:1995;327-339.
36. Zhu D., Padman R. A metaheuristic scheduling procedure for resource-constrained projects with cash flows. Naval Research Logistics. 46:1999;912-927.
37. Zimmermann J. Project scheduling with discounted cash flows and general temporal constraints. Inderfurth K., Schwödiauer G., Domschke W., Juhnke F., Klein-schmidt P., Wäscher G. Operations Research Proceedings 1999. 2000;419-424 Springer, Berlin.
38. Zimmermann J. Ablauforientiertes Projektmanagement: Modelle, Verfahren und Anwendungen. 2001;Gabler, Wiesbaden.