Abstract
A resource transition constraint models sequence dependent setup costs between activities on the same resource. In this work, we propose a heuristic for the multi-project scheduling problem with resource transition constraints, which relies on constraint programming and local search methods. The objective is to minimize the project delay, earliness and throughput time, while at the same time reducing setup costs. In computational results, we demonstrate the effectiveness of an implementation based on the presented concepts using instances from practice.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Krüger, D., Scholl, A.: A heuristic solution framework for the resource constrained multi-project scheduling problem with sequence-dependent transfer times. Eur. J. Oper. Res. 197(2), 492–394 (2009)
Laborie, P., Rogerie, J., Shaw, P., VilÃm, P.: IBM ILOG CP optimizer for scheduling. Constraints 23(2), 210–250 (2018)
Lehmer, D.H.: On the compounding of certain means. J. Math. Anal. Appl. 36, 183–200 (1971)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Berg, M., Fischer, T., Velten, S. (2020). A Heuristic Approach for the Multi-Project Scheduling Problem with Resource Transition Constraints. In: Neufeld, J.S., Buscher, U., Lasch, R., Möst, D., Schönberger, J. (eds) Operations Research Proceedings 2019. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-48439-2_70
Download citation
DOI: https://doi.org/10.1007/978-3-030-48439-2_70
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-48438-5
Online ISBN: 978-3-030-48439-2
eBook Packages: Business and ManagementBusiness and Management (R0)