Abstract
A generalization of the Fixed Job Scheduling Problem is considered where the different jobs and machines are subdivided into classes. A Boolean matrix describes which job class may be performed by which machine class. Two related NP-complete non-preemptive scheduling problems with fixed start and finishing time for each job are investigated. The problems are transformed into flow problems with additional constraints and integrality demand. Different solution approaches producing upper and lower bounds are discussed. Numerical results are presented.
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Heidelberg
About this paper
Cite this paper
Ruhe, G. (1992). Interval Scheduling Using Network Flows. In: Gaul, W., Bachem, A., Habenicht, W., Runge, W., Stahl, W.W. (eds) Operations Research Proceedings 1991. Operations Research Proceedings 1991, vol 1991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46773-8_110
Download citation
DOI: https://doi.org/10.1007/978-3-642-46773-8_110
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55410-3
Online ISBN: 978-3-642-46773-8
eBook Packages: Springer Book Archive