Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop

Authors:
Ann Vandevelde;Han Hoogeveen;Cor Hurkens;Jan Karel Lenstra
Affiliations:
Netherlands Controlling Authority for Milk and Milk Products, P.O. Box 250, 3830 AG Leusden, The Netherlands;Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80089, 3508 TB Utrecht, The Netherlands;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands
Venue:
INFORMS Journal on Computing
Year:
2005

Citing 5
Cited 3

Interstage transportation planning in the deterministic flow-shop environment

Operations Research
Nearly on line scheduling of preemptive independent tasks

Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
Lower bounds for the job-shop scheduling problem on multi-purpose machines

Proceedings of the workshop on Discrete algorithms
Constraint-Based Scheduling

Constraint-Based Scheduling
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

Operations Research Letters

Search tree based approaches for parallel machine scheduling

Computers and Operations Research
Energetic reasoning revisited: application to parallel machine scheduling

Journal of Scheduling
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.