Single machine scheduling with early and quadratic tardy penalties

Authors:
Jeffrey Schaller
Affiliations:
Department of Business Administration, Eastern Connecticut State University, 83 Windham St., Willimantic, CT
Venue:
Computers and Industrial Engineering
Year:
2004

Citing 5
Cited 5

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

Management Science
The single machine early/tardy problem

Management Science
Sequencing with earliness and tardiness penalties: a review

Operations Research
Early/tardy scheduling with sequence dependent setups on uniform parallel machines

Computers and Operations Research
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review

Operations Research

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

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

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

Computers and Operations Research
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem

Computers and Operations Research
Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of scheduling a single machine when the objective uses a penalty for each job that is equal to the earliness of the job plus the squared tardiness of the job. A timetabling algorithm is presented that inserts idle time into a sequence in order to minimize the objective considered. Optimal branch and bound algorithms are presented as well as efficient heuristic algorithms. The procedures are tested on randomly generated problems of varying numbers of jobs and due date tightness parameters. The results show that a branch and bound procedure can solve small and medium sized problems in a reasonable amount of time and that a simple descent procedure can quickly generate solutions that are close to optimal.