Batch scheduling to minimize maximum lateness

Authors:
Jay B. Ghosh;Jatinder N. D. Gupta
Affiliations:
Faculty of Business Administration, Bilkent University, Turkey;Department of Management, Ball State University, USA
Venue:
Operations Research Letters
Year:
1997

Citing 4
Cited 5

Scheduling two job classes on a single machine

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

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Batch scheduling to minimize total completion time

Operations Research Letters

The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard

Journal of Scheduling
Single machine batch scheduling problem with family setup times and release dates to minimize makespan

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

Computers and Industrial Engineering
A simulated annealing algorithm for single machine scheduling problems with family setups

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem.