Satisfying due-dates in the presence of sequence dependent family setups with a special comedown structure

Authors:
Mehmet R. Taner;Thom J. Hodgson;Russell E. King;Scott R. Schultz
Affiliations:
Department of Industrial Engineering, Bilkent University, Ankara, TR 06800, Turkey;Edward P. Fitts Department of Industrial and Systems Engineering, North Carolina State University, Raleigh, NC 27695, USA;Edward P. Fitts Department of Industrial and Systems Engineering, North Carolina State University, Raleigh, NC 27695, USA;Department of Mechanical and Industrial Engineering, Mercer University, Macon, GA 31207, USA
Venue:
Computers and Industrial Engineering
Year:
2007

Citing 2
Cited 2

Single-machine scheduling with release dates, due dates and family setup times

Management Science
Batch scheduling to minimize maximum lateness

Operations Research Letters

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

Computers and Operations Research
Tabu search and lower bound for an industrial complex shop scheduling problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.06

Visualization

Abstract

This paper addresses a static, n-job, single-machine scheduling problem with sequence dependent family setups. The setup matrix follows a special structure where a constant setup is required only if a job from a smaller indexed family is an immediate successor of one from a larger indexed family. The objective is to minimize the maximum lateness (L"m"a"x). A two-step neighborhood search procedure and an implicit enumeration scheme are proposed. Both procedures exploit the problem structure. The enumeration scheme produces optimum solutions to small and medium sized problems in reasonable computational times, yet it fails to perform efficiently in larger instances. Computational results show that the heuristic procedure is highly effective, and is efficient even for extremely large problems.