<p><p>Although several monographs and edited volumes have discussed scheduling in general, most of these works survey the field by contributing a single chapter to production systems like flow shops. <i>Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications</i> is solely dedicated t
Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications
β Scribed by Hamilton Emmons, George Vairaktarakis
- Publisher
- Springer
- Year
- 2012
- Tongue
- English
- Leaves
- 345
- Series
- International Series in Operations Research & Management Science
- Edition
- 2013
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
Although several monographs and edited volumes have discussed scheduling in general, most of these works survey the field by contributing a single chapter to production systems like flow shops. Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications is solely dedicated to bringing together a huge body of knowledge on the subject, along distinct design features, in order to help scholars and practitioners easily identify problems of interest. This monograph has been organized into ten distinct flow shop systems and explores their connections. The chapters cover flow shop systems including two-machine, flexible, stochastic, and more. Outside of the traditional flow shops that require a job never revisits any stage, this book also examines the reentrant flow shop, in which a job may cycle back and be reprocessed at the same station or sequence of stations, multiple times.
The authors have made the material accessible to a broad readership, using simplified notation and revealing unifying concepts. The results unique to flow shop research should provide the seed for research in other areas of scheduling and in optimization in general.
π SIMILAR VOLUMES
<p>This book provides an in-depth presentation of algorithms for and complexity of open shop scheduling. Open shops allow operations of a job to be executed in any order, contrary to flow and job shops where the order is pre-specified. The author brings the field up to date with more emphasis on new
<p>This book provides an in-depth presentation of algorithms for and complexity of open shop scheduling. Open shops allow operations of a job to be executed in any order, contrary to flow and job shops where the order is pre-specified. The author brings the field up to date with more emphasis on new
<p><P>For over fifty years now, the famous problem of flow shop and job shop scheduling has been receiving the attention of researchers in operations research, engineering, and computer science. Over the past several years, there has been a spurt of interest in computational intelligence heuristics
<p>Project scheduling problems are, generally speaking, the problems of allocating scarce resources over time to perform a given set of activities. The resources are nothing other than the arbitrary means which activities complete for. Also the activities can have a variety of interpretations. Thus,