Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem

Authors:
Jorge M. S. Valente;Jeffrey E. Schaller
Affiliations:
LIAAD-INESC Porto LA, Faculdade de Economia da Universidade do Porto, Rua Dr. Roberto Frias, s/n, 4200-464 Porto, Portugal;Department of Business Administration, Eastern Connecticut State University, 83 Windham St., Willimantic, CT 06226-2295, USA
Venue:
Computers and Operations Research
Year:
2012

Citing 8
Cited 1

Priority rules for job shops with weighted tardiness costs

Management Science
A survey of algorithms for the single machine total weighted tardiness scheduling problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
A computational experiment of COVERT-AU class of rules for single machine tardiness scheduling problem

Computers and Industrial Engineering - Special issue on computer aided maintenance
Improved heuristics for the n-job single-machine weighted tardiness problem

Computers and Operations Research
A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness

Journal of Scheduling
Single machine scheduling with early and quadratic tardy penalties

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

Computers and Operations Research
Minimizing the weighted sum of squared tardiness on a single machine

Computers and Operations Research

A note on reverse scheduling with maximum lateness objective

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we consider the single machine scheduling problem with weighted quadratic tardiness costs. Several efficient dispatching rules are proposed. These include existing heuristics for the linear problem, as well as procedures suitably adapted to the quadratic objective function. Also, both forward and backward scheduling procedures are considered. The computational results show that the heuristics that specifically take into account the quadratic objective significantly outperform their linear counterparts. Also, the backward scheduling approach proves to be superior, and the difference in performance is even more noticeable for the harder instances. The best of the backward scheduling heuristics is both quite efficient and effective. Indeed, this procedure can quickly generate a schedule even for large instances. Also, its relative deviation from the optimum is usually rather low, and it performs adequately even for the more difficult instances.