Minimizing the weighted sum of squared tardiness on a single machine

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

Citing 6
Cited 1

A note on the weighted tardiness problem

Operations Research
The single machine problem with a quadratic cost function of completion times

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
Single machine scheduling with early and quadratic tardy penalties

Computers and Industrial Engineering
A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties

Computers and Operations Research
New Precedence Theorems for One-Machine Weighted Tardiness

Mathematics of Operations Research

Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers a problem in which there is a set of jobs to be sequenced on a single machine. Each job has a weight and the objective is to sequence the jobs to minimize total weighted squared tardiness. A branch-and-bound algorithm is developed for optimally solving the problem. Several dominance conditions are presented for possible inclusion in the branch-and-bound algorithm. The dominance conditions are included in the branch-and-bound algorithm, which is tested on randomly generated problems of various numbers of jobs, due date tightness and due date ranges. The results show that the dominance conditions dramatically improve the efficiency of the branch-and-bound algorithm.