Stochastic flow shop scheduling
In this dissertation we present new results for minimizing the makespan in a flow shop with zero storage between machines. Makespan is the total length of time required to process a set of jobs. We consider m machines and n jobs with random processing times. Since there is no intermediate storage be...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
Virginia Polytechnic Institute and State University
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/74776 |