Earliness/tardiness scheduling with a common due date and family setups

Authors:
Rasika H. Suriyaarachchi;Andrew Wirth
Affiliations:
School of Computing and Information Technology, University of Western Sydney, Locked Bag 1797, Penrith South DC 1797, Australia;Department of Mechanical and Manufacturing Engineering, The University of Melbourne, Victoria 3010, Australia
Venue:
Computers and Industrial Engineering
Year:
2004

Citing 6
Cited 1

Single facility multi-class job scheduling

Computers and Operations Research
Sequencing with earliness and tardiness penalties: a review

Operations Research
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
Genetic Algorithms Plus Data Structures Equals Evolution Programs

Genetic Algorithms Plus Data Structures Equals Evolution Programs
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
The complexity of scheduling job families about a common due date

Operations Research Letters

A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine the problem of scheduling jobs, on a single processor to minimise the total earliness and tardiness costs about a common due date. Jobs belong to mutually exclusive families and a sequence independent setup task is required when processing switches from a job of one family to a job of another.We extend earlier results to obtain necessary optimal conditions for this problem. These are then used to generate a fast heuristic. Its performance is compared with a lowerbound, a greedy heuristic, a genetic algorithm and for small problems, the optimal solution.