Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times

Authors:
Reha Uzsoy;Juan Diego Velásquez
Affiliations:
Laboratory for Extended Enterprises at Purdue, School of Industrial Engineering, Grissom Hall, 315 N. Grant Street, West Lafayette, IN 47907-2023, USA;Laboratory for Extended Enterprises at Purdue, School of Industrial Engineering, Grissom Hall, 315 N. Grant Street, West Lafayette, IN 47907-2023, USA
Venue:
Computers and Operations Research
Year:
2008

Citing 3
Cited 6

Scheduling two job classes on a single machine

Computers and Operations Research
Jackson's rule for single-machine scheduling: making a good heuristic better

Mathematics of Operations Research
Computer-Aided complexity classification of combinational problems

Communications of the ACM

A simulated annealing algorithm for single machine scheduling problems with family setups

Computers and Operations Research
Parallel machine scheduling with precedence constraints and setup times

Computers and Operations Research
A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups

Computers and Operations Research
Single-machine scheduling with advanced process control constraints

Journal of Scheduling
A simulated annealing approach to minimize the maximum lateness on uniform parallel machines

Mathematical and Computer Modelling: An International Journal
Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We address the problem of scheduling a single machine subject to family-dependent set-up times in order to minimize maximum lateness. We present a number of local improvement heuristics based on the work of previous researchers, a rolling horizon heuristic, and an incomplete dynamic programming heuristic. Extensive computational experiments on randomly generated test problems compare the performance of these heuristics. The rolling horizon procedures perform particularly well but require their parameters to be set based on problem characteristics to obtain their best performance.