Single machine scheduling to minimize total late work
Operations Research
Jackson's rule for single-machine scheduling: making a good heuristic better
Mathematics of Operations Research
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
A fully polynomial approximation scheme for the total tardiness problem
Operations Research Letters
Late work minimization in a small flexible manufacturing system
Computers and Industrial Engineering
Computers and Operations Research
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
Computers and Industrial Engineering
Late work minimization in flow shops by a genetic algorithm
Computers and Industrial Engineering
| Hi-index | 0.00 |
In the problem of scheduling a single machine to minimize total late work, there are n jobs to be processed, each of which has an integer processing time and an integer due date. The objective is to find a sequence of jobs which minimizes the total late work, where the late work for a job is the amount of processing of this job that is performed after its due date. Three families of approximation algorithms {E"k}, {A"@e} and {B"@e} are presented. Contained in the first family is a (1 + 1/k)-approximation algorithm E"k, for any positive integer k @? n, which uses truncated enumeration; E"k requires O(n^k^ ^+^ ^1) time and O(n) space. The two other families {A"@e} and B"@e} are fully polynomial approximation schemes which are based on the rounding of state variables in dynamic programming formulations. In the superior scheme, for 0 =