Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs

Authors:
Awi Federgruen;Gur Mosheiov
Affiliations:
Graduate School of Business, Columbia University, New York, NY, USA;School of Business Administration, and the Department of Statistics, The Hebrew University, Jerusalem, Israel
Venue:
Operations Research Letters
Year:
1994

Citing 5
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Integer and combinatorial optimization

Integer and combinatorial optimization
Sequencing with earliness and tardiness penalties: a review

Operations Research
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

Operations Research
Completion time variance minimization on a single machine is difficult

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses a class of single-machine scheduling problems with a common due-date for all jobs, and general earliness and tardiness costs. We show that a class of simple, polynomial, ''greedy-type'' heuristics can be used to generate close-to-optimal schedules. An extensive numerical study exhibits small optimality gaps. For convex cost structures, we establish that the worst-case optimality gap is bounded by e-i ~ 0.36, if the due-date is non-restrictive.