An efficient Scatter search algorithm for minimizing earliness and tardiness penalties in a single-machine scheduling problem with a common due date

Authors:
J. Talebi;H. Badri;F. Ghaderi;E. Khosravian
Affiliations:
Department of industrial engineering, University of Tehran, Iran;Department of industrial engineering, University of Shahed, Iran;Department of industrial engineering, University of Tehran, Iran;Department of mechanical engineering, University of Shahrekord, Iran
Venue:
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Year:
2009

Citing 8
Cited 1

Sequencing with earliness and tardiness penalties: a review

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

Operations Research
Using tabu search to solve the common due date early/tardy machine scheduling problem

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

Computers and Operations Research
Tabu search for a class of single-machine scheduling problems

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

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Scatter Search: Methodology and Implementations in C

Scatter Search: Methodology and Implementations in C
A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date

Computers and Industrial Engineering

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

Since the just-in-time (JIT) problems have special importance in the real world, various methods have been developed by researchers to solve this kind of problem more precisely and in a minimal possible time. Most of JIT problems are NP-hard, thus many of these methods have been created based on metaheuristics. In this paper the single-machine scheduling problem with a common due date is considered in which performance is measured by the minimization of the sum of earliness and tardiness penalties of the jobs. Here we use a solving method based on Scatter Search metaheuristic in which the features of optimal solution of single machine minimization are utilized appropriately. The proposed approach is examined through a computational comparative study with 280 benchmark problems with up to 1000 jobs. In addition to having a good solution time, we got new upper bounds in our numerical examples using proposed method.