Improved heuristics for the early/tardy scheduling problem with no idle time

Authors:
Jorge M. S. Valente;Rui A. F. S. Alves
Affiliations:
Faculdade de Economia do Porto, Rua Dr. Roberto Frias, Porto 4200-464, Portugal;Faculdade de Economia do Porto, Rua Dr. Roberto Frias, Porto 4200-464, Portugal
Venue:
Computers and Operations Research
Year:
2005

Citing 5
Cited 11

The single machine early/tardy problem

Management Science
Sequencing with earliness and tardiness penalties: a review

Operations Research
A greedy heuristic for the mean tardiness sequencing problem

Computers and Operations Research
Improved heuristics for the n-job single-machine weighted tardiness problem

Computers and Operations Research
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem

Computers and Operations Research

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

Computers and Industrial Engineering
An exact approach to early/tardy scheduling with release dates

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

Computers and Operations Research
Dispatching heuristics for the single machine early/tardy scheduling problem with job-independent penalties

Computers and Industrial Engineering
Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

Computers and Operations Research
Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time

Computers and Industrial Engineering
Ant Colony Optimization for the Single Machine Total Earliness Tardiness Scheduling Problem

IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time

Computers and Industrial Engineering
Guidelines for developing effective Estimation of Distribution Algorithms in solving single machine scheduling problems

Expert Systems with Applications: An International Journal
Exact resolution of the one-machine sequencing problem with no machine idle time

Computers and Industrial Engineering
Single machine scheduling with controllable processing times to minimize total tardiness and earliness

Computers and Industrial Engineering

Quantified Score

Hi-index	0.02

Visualization

Abstract

A dispatch rule and a greedy procedure are presented for the single machine earliness/tardiness scheduling problem with no idle time and compared with the best of the existing dispatch rules. Both dispatch rules use a lookahead parameter that had previously been set at a fixed value. We develop functions that map some instance statistics into appropriate values for that parameter. We also consider the use of dominance rules to improve the solutions obtained by the heuristics. The computational results show that the function-based versions of the heuristics outperform their fixed value counterparts and that the use of the dominance rules can indeed improve solution quality with little additional computational effort.