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

Graham McMahon and Michael Florian
Additional contact information
Graham McMahon: University of New South Wales, Australia
Michael Florian: University of Montreal, Montreal, Quebec

Operations Research, 1975, vol. 23, issue 3, 475-482

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.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (25)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.3.475 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:23:y:1975:i:3:p:475-482

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().