You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
Graham McMahon and Michael Florian
Vol. 23, No. 3 (May - Jun., 1975), pp. 475-482
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/169697
Page Count: 8
Preview not available
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.
Operations Research © 1975 INFORMS