Abstract
The formulation of an open shop scheduling problem is the same as for the flow shop problem except that the order of processing tasks comprising one job may be arbitrary.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Sterna, M., Weglarz, J. (2019). Open Shop Scheduling. In: Handbook on Scheduling. International Handbooks on Information Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-99849-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-99849-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99848-0
Online ISBN: 978-3-319-99849-7
eBook Packages: Business and ManagementBusiness and Management (R0)