Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date

Authors:
Shih-Wei Lin;Shuo-Yan Chou;Shih-Chieh Chen
Affiliations:
Information Management Department, Huafan University 1, Taipei, Taiwan 223;Industrial Management Department, National Taiwan University of Science & Technology 43, Taipei, Taiwan 106;Industrial Management Department, National Taiwan University of Science & Technology 43, Taipei, Taiwan 106
Venue:
Journal of Heuristics
Year:
2007

Citing 0
Cited 5

Solving the truck and trailer routing problem based on a simulated annealing heuristic

Computers and Operations Research
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
Robust scheduling on a single machine to minimize total flow time

Computers and Operations Research
A simulated annealing heuristic for the truck and trailer routing problem with time windows

Expert Systems with Applications: An International Journal
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

This study addresses a class of single-machine scheduling problems involving a common due date where the objective is to minimize the total job earliness and tardiness penalties. A genetic algorithm (GA) approach and a simulated annealing (SA) approach utilizing a greedy local search and three well-known properties in the area of common due date scheduling are developed. The developed algorithms enable the starting time of the first job not at zero and were tested using a set of benchmark problems. From the viewpoints of solution quality and computational expenses, the proposed approaches are efficient and effective for problems involving different numbers of jobs, as well as different processing time, and earliness and tardiness penalties.