Abstract
The multiprocessor flow-shop is the generalization of the flow-shop in which each machine is replaced by a set of identical machines. As finding a minimum-length schedule is NP-hard, we set out to find good lower and upper bounds. The lower bounds are based on relaxation of the capacities of all machine sets except one. This results in a parallel-machine scheduling problem with release dates and delivery times, for which we derive a number of lower bounds. We pay special attention to the time complexity of algorithms for computing these bounds. To obtain the upper bounds a constructive algorithm in subsequent stages is used. We present an experimental comparison of the various lower and upper bounds for the multiprocessor flow-shop problem.
| Original language | English |
|---|---|
| Pages (from-to) | 305-320 |
| Number of pages | 16 |
| Journal | INFORMS Journal on Computing |
| Volume | 17 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Jun 2005 |
Keywords
- Computational study
- Head-body-tail problems
- Lower bound
- Multiprocessor flow-shop
- Parallel machine scheduling
- Preemptive schedule