论文信息 - On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness

On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness

An algorithm is developed for sequencing jobs on a single processor in order to minimize maximum lateness, subject to ready times and due dates. The method that we develop could be classified as branch-and-bound. However, it has the unusual feature that a complete solution is associated with each node of the enumeration tree.

Graham McMahon | Michael Florian | M. Florian | G. McMahon

[1] M. Florian,et al. On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem , 1973 .

[2] Michael Florian,et al. An Implicit Enumeration Algorithm for the Machine Sequencing Problem , 1971 .

[3] Kenneth R. Baker,et al. Sequencing with due-dates and early start times to minimize maximum tardiness , 1974 .