Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brucker P, Kampmeyer T (2005) Tabu search algorithms for cyclic machine scheduling problems. Journal of Scheduling 8:303–322
Hanen C (1994) Study of a NP-hard cyclic scheduling problem: The recurrent job-shop. European Journal of Operational Research 72:82–101
Hanen C, Munier-Kordon A (2004) Periodic schedules for linear precedence constraints. Technical report, Laboratoire LIP6, Paris
Cavory G, Dupas R, Goncalves G (2005) A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints. European Journal of Operational Research 161:73–85
Brucker P, Kampmeyer T (2005) Cyclic scheduling problems with linear precedences and resource constraints. OSM Reihe P, 261, Universität Osnabrück, Fachbereich Mathematik/Informatik
Scheid H (1994) Zahlentheorie, 2nd edition. BI Wissenschaftsverlag
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brucker, P., Kampmeyer, T. (2006). Cyclic Scheduling Problems with Linear Precedences and Resource Constraints. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_104
Download citation
DOI: https://doi.org/10.1007/3-540-32539-5_104
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32537-6
Online ISBN: 978-3-540-32539-0
eBook Packages: Business and EconomicsBusiness and Management (R0)