The One-Machine Sequencing Problem with Early Starts and Due Dates

Abstract

An optimal procedure is developed for the sequencing of n-jobs on one machine to minimize the maximum job lateness when the n-jobs have unequal early start times and due dates. The decision rule derived for the procedure primarily sequences the jobs in order of their nondecreasing early starts plus due dates. A branch-and-bound approach is employed by the procedure which moves to opti-mality in a finite number of steps.