A comparison of lower bounds for the single-machine early/tardy problem

Authors:
Jeffrey Schaller
Affiliations:
Department of Business Administration, Eastern Connecticut State University, 83 Windham St. Willimantic, CT 06226-2295, USA
Venue:
Computers and Operations Research
Year:
2007

Citing 5
Cited 3

One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
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

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

Computers and Operations Research
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint

Computers & Mathematics with Applications
A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers the single-machine early/tardy problem. The paper presents a procedure that integrates a timetabling algorithm into a lower bound for jobs not included in a partial sequence. The paper also shows how two lower bounds that were developed previously for the problem can be improved. The lower bounds are tested on problems of various sizes and parameters for the distribution of due dates. The results show that the lower bounds are able to increase the efficiency of a branch-and-bound algorithm.