Abstract
We consider the Price-Collecting Job Sequencing with One Common and Multiple Secondary Resources problem. The task is to feasibly schedule a subset of jobs from a given larger set. Each job needs two resources: a common resource for a part of the job’s execution time and a secondary resource for the whole execution time. Furthermore each job has one or more time windows and an associated prize. In addition to previous work, we also consider precedence constraints on the jobs. We aim to maximize the total prize over the actually scheduled jobs. To solve large instances heuristically we propose a hybrid of limited discrepancy search and beam search approach that utilize a relaxed decision diagram. We could show that the use of a relaxed decision diagram substantially speed-up the computation times of the search approach.
This project is partially funded by the Doctoral Program Vienna Graduate School on Computational Optimization, Austrian Science Foundation Project No. W1260-N35.
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
Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.N.: Decision diagrams for optimization. Artificial Intelligence: Foundations, Theory, and Algorithms. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42849-9
Cire, A.A., van Hoeve, W.: Multivalued decision diagrams for sequencing problems. Oper. Res. 61(6), 1411–1428 (2013)
Furcy, D., Koenig, S.: Limited discrepancy beam search. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, IJCAI 2005, pp. 125–131. Morgan-Kaufmann (2005)
Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Mellish, C.S. (ed.) Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp. 607–615. Morgan-Kaufmann, Montreal (1995)
Horn, M., Maschler, J., Raidl, G., Rönnberg, E.: A*-based construction of decision diagrams for a prize-collecting scheduling problem. Technical report AC-TR-18-011, Algorithms and Complexity Group, TU Wien (2018). submitted
Horn, M., Raidl, G.R., Rönnberg, E.: An A* algorithm for solving a prize-collecting sequencing problem with one common and multiple secondary resources and time windows. In: Proceedings of PATAT 2018 - The 12th International Conference of the Practice and Theory of Automated Timetabling, Vienna, Austria, pp. 235–256. (2018)
Maschler, J., Raidl, G.R.: Multivalued decision diagrams for a prize-collecting sequencing problem. In: Proceedings of PATAT 2018 - Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, Vienna, Austria, pp. 375–397 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Horn, M., Raidl, G.R. (2020). Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2019. EUROCAST 2019. Lecture Notes in Computer Science(), vol 12013. Springer, Cham. https://doi.org/10.1007/978-3-030-45093-9_42
Download citation
DOI: https://doi.org/10.1007/978-3-030-45093-9_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-45092-2
Online ISBN: 978-3-030-45093-9
eBook Packages: Computer ScienceComputer Science (R0)