Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times

Authors:
Irfan M. Ovacik;Reha Uzhoy
Affiliations:
School of Industrial Engineering, 1287 Grissom Hall, Purdue University, West Lafayette, IN 47907-1287, USA;School of Industrial Engineering, 1287 Grissom Hall, Purdue University, West Lafayette, IN 47907-1287, USA
Venue:
Operations Research Letters
Year:
1993

Citing 1
Cited 3

P-Complete Approximation Problems

Journal of the ACM (JACM)

Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints

Computers and Operations Research
A two-phase dynamic dispatching approach to semiconductor wafer testing

Robotics and Computer-Integrated Manufacturing
List scheduling revisited

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider minimizing makespan (Cmax) and maximum lateness (Lmax) on parallel identical machines with sequence-dependent setup times. We show that the optimal schedule need not be a list schedule. Motivated by a practical scheduling problem, we study the class of problems where setup times are bounded by processing times and develop tight worst case error bounds for list scheduling algorithms to minimize Cmax and Lmax.