On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- 1 June 1975
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 23 (3) , 475-482
- https://doi.org/10.1287/opre.23.3.475
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: