Abstract
Schedule generation schemes are the backbone of heuristics to solve project scheduling problems. In this chapter we introduce the two schedule generation schemes for the classical resource constrained project scheduling problem, the serial and the parallel schedule generation scheme. We characterize them according to the types of schedule they generate and discuss variants of the schedule generation schemes in order to deal with extensions such as general precedence constraints and stochastic activity durations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ashtiani B, Leus R, Aryanezhad M-B (2011) New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of preprocessing. J Scheduling 14:157–171
Błażewicz J, Lenstra JK, Rinnooy Kan AHG (1983) Scheduling subject to resource constraints: classification and complexity. Discrete Appl Math 5:11–24
Błażewicz J, Ecker K, Pesch E, Schmidt G, Wȩglarz J (2007) Handbook on scheduling. Springer, Berlin
De Reyck B, Herroelen W (1997) Assembly line balancing by resource-constrained project scheduling: a critical appraisal. Found Comput Control Eng 22:143–167
Debels D, De Reyck B, Leus R, Vanhoucke M (2006) A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. Eur J Oper Res 169:638–653
Demeulemeester E, Herroelen W. (1992) A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manage Sci 38:1803–1818
Demeulemeester E, Herroelen W (1997) New benchmark results for the resource-constrained project scheduling problem. Manage Sci 43:1485–1492
Demeulemeester E, Herroelen W (2002) Project scheduling: a research handbook. Kluwer, Boston
Fang E, Kolisch R, Wang L, Mu C (2012) An estimation of distribution algorithm and new computational results for the stochastic resource-constrained project scheduling problem. Technical Report, TUM School of Management, Technische Universität München, München, Germany
Graham R (1966) Bounds on multiprocessing timing anomalies. Bell Syst Tech J 45:1563–1581
Hartmann S (1998) A competitive genetic algorithm for resource-constrained project scheduling. Nav Res Log 45:733–750
Hartmann S (2002) A self-adapting genetic algorithm for project scheduling under resource constraints. Nav Res Log 49:433–448
Kochetov Y, Stolyar A (2003) Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem. In: Proceedings of the 3rd international workshop of computer science and information technologies, Russia
Kolisch R (1996) Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur J Oper Res 90:320–333
Kolisch R, Hartmann S (1999) Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis. In: Wȩglarz J (ed) Project scheduling: recent models, algorithms and applications. Kluwer, Boston, pp 147–178
Kolisch R, Hartmann S (2006) Experimental evaluation of heuristics for the resource-constrained project scheduling problem: an update. Eur J Oper Res 174:23–37
Kolisch R, Sprecher A, Drexl A (1995) Characterization and generation of a general class of resource-constrained project scheduling problems. Manage Sci 41:1693–1703
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
Scholl A, Becker C (2006) State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168:666–693
Sprecher A (2000) Solving the RCPSP efficiently at modest memory requirements. Manage Sci 46(5):710–723
Sprecher A, Kolisch R, Drexl A (1995) Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. Eur J Oper Res 80:94–102
Stork F (2001) Stochastic resource-constrained project scheduling. Ph.D. dissertation, Fachbereich Mathematik, TU Berlin, Berlin, Germany
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Kolisch, R. (2015). Shifts, Types, and Generation Schemes for Project Schedules. In: Schwindt, C., Zimmermann, J. (eds) Handbook on Project Management and Scheduling Vol.1. International Handbooks on Information Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-05443-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-05443-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05442-1
Online ISBN: 978-3-319-05443-8
eBook Packages: Business and EconomicsBusiness and Management (R0)