Abstract
A flowshop, as described in Chapter 1, is characterized by unidirectional flow of work with a variety of jobs being processed sequentially in a one-pass manner. A job shop, on the other hand, involves processing on several machines without any “series” structure. In the past four decades extensive research has been done on both flowshop and job shop problems. This chapter evolves a synthesis of the best-known heuristic and meta-heuristic scheduling methods for single objective flowshop problems. We show that a strategy combining the strengths of the different methods produces solutions of good quality—faster than any single solution strategy.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bagchi, T.P. (1999). Flowshop Scheduling. In: Multiobjective Scheduling by Genetic Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5237-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5237-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7387-2
Online ISBN: 978-1-4615-5237-6
eBook Packages: Springer Book Archive