Abstract
Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of n jobs, each of which is characterized by the same machine sequence.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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). Flow Shop Scheduling. In: Handbook on Scheduling. International Handbooks on Information Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-99849-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-99849-7_8
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)