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

Authors:
Kuo-Ching Ying
Affiliations:
Department of Industrial Engineering and Management Information, Huafan University, No. 1, Huafan Road, Shihtin Hsiang, Taipei 22301, Taiwan, ROC
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 10
Cited 4

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

Operations Research
Common due date scheduling problem with separate earliness and tardiness penalties

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

Computers and Industrial Engineering
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
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
The One-Machine Problem with Earliness and Tardiness Penalties

Journal of Scheduling
Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

Journal of Heuristics
An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling

Journal of Scheduling
Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time

Computers and Industrial Engineering

An adaptive genetic algorithm for solving the single machine scheduling problem with earliness and tardiness penalties

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system

Computers and Industrial Engineering
Multi-objective Variable Neighborhood Search Algorithms for a Single Machine Scheduling Problem with Distinct due Windows

Electronic Notes in Theoretical Computer Science (ENTCS)
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 considers the NP-hard problem of scheduling jobs on a single-machine against common due dates with respect to earliness and tardiness penalties. An effective and efficient recovering beam search (RBS) algorithm is proposed to solve this problem. To validate and verify the developed algorithm, computational experiments are conducted on a well-known benchmark problem set, and the results are compared with nine meta-heuristics from the relevant literature. The experimental comparison results reveal that the proposed RBS algorithm is a state-of-the-art approach to the single-machine scheduling problem with earliness and tardiness penalties. In terms of both solution quality and computational effort, this study successfully develops a near-optimal approach that will hopefully encourage practitioners to apply it to real-world problems.