Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches

Authors:
Martin Feldmann;Dirk Biskup
Affiliations:
Faculty of Economics, University of Bielefeld, Postfach 10 01 31, 33501 Bielefeld, Germany;Faculty of Economics, University of Bielefeld, Postfach 10 01 31, 33501 Bielefeld, Germany
Venue:
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Year:
2003

Citing 17
Cited 15

Simulated annealing: theory and applications

Simulated annealing: theory and applications
Sequencing with earliness and tardiness penalties: a review

Operations Research
Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing

Journal of Computational Physics
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date

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

Operations Research
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

Operations Research
Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights

Computers and Industrial Engineering
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms

Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Using tabu search to solve the common due date early/tardy machine scheduling problem

Computers and Operations Research
Multiple-machine scheduling with earliness, tardiness and completion time penalties

Computers and Operations Research
Single-machine scheduling with a common due window

Computers and Operations Research
Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates

Computers and Operations Research
Evolution and Optimum Seeking: The Sixth Generation

Evolution and Optimum Seeking: The Sixth Generation
Evolutionary Algorithms in Management Applications

Evolutionary Algorithms in Management Applications
Ten Theses Regarding the Design of Controlled Evolutionary Strategies

WOPPLOT '89 Workshop on Evolutionary Models and Strategies, Workshop on Parallel Processing: Logic, Organization, and Technology: Parallelism, Learning, Evolution

Minimizing total earliness and tardiness on a single machine using a hybrid heuristic

Computers and Operations Research
Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date

Computers and Operations Research
A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date

Computers and Industrial Engineering
A differential evolution approach for the common due date early/tardy job scheduling problem

Computers and Operations Research
Exponential neighborhood search for a parallel machine scheduling problem

Computers and Operations Research
Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

Computers and Operations Research
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

Computers and Operations Research
A comparative study of heuristic algorithms on Economic Lot Scheduling Problem

Computers and Industrial Engineering
Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm

Computers and Industrial Engineering
An Intelligent Algorithm for Scheduling Jobs on a Single Machine with a Common Due Date

KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
An efficient Scatter search algorithm for minimizing earliness and tardiness penalties in a single-machine scheduling problem with a common due date

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system

Computers and Industrial Engineering
Minimizing total earliness and tardiness penalties with a common due date on a single-machine using a discrete particle swarm optimization algorithm

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
A new inter-island genetic operator for optimization problems with block properties

ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of scheduling a number of jobs on a single machine against a restrictive common due date. The paper consists of two parts: firstly a new and appropriate problem representation is developed. As the restrictive common due date problem is known to be intractable we decided, secondly, to apply meta-heuristics, namely evolutionary strategies, simulated annealing and threshold accepting. We demonstrate that our application of these meta-heuristics is efficient in obtaining near-optimal solutions by solving 140 benchmark problems with up to 1000 jobs. Furthermore, we compare their solution quality and find that a new variant of threshold accepting is superior to the other approaches.