Bounds for multiprocessor flow shops
Conference
·
OSTI ID:36208
We consider a generalization of the flow shop scheduling problem in which, at each production stage, a set of identical machines is available. As finding a schedule of minimum makespan is NP-hard, we set out to find good upper and lower bounds. Good schedules are found by local search techniques, whereas lower bounds are based on relaxation of the capacities of all machines sets except one. The resulting head-body-tail problem is again hard to solve to optimality, but several lower bounds on its optimum solution value have been derived and implemented in a branch-and bound algorithm. We present an experimental comparison of the various upper and lower bounds for the multiprocessor flow shop.
- OSTI ID:
- 36208
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Performance bounds on multiprocessor schedules
Single crane scheduling problems
Better approximation guarantees for job-shop scheduling
Conference
·
Sat Dec 31 23:00:00 EST 1983
·
OSTI ID:5082359
Single crane scheduling problems
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36405
Better approximation guarantees for job-shop scheduling
Conference
·
Sun Jun 01 00:00:00 EDT 1997
·
OSTI ID:476036