Note--Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution

W. Townsend
Additional contact information
W. Townsend: Leeds Polytechnic

Management Science, 1977, vol. 23, issue 9, 1016-1019

Abstract: Each of n jobs is to be sequenced on m machines, with each job having a due date, and we wish to minimise the maximum tardiness of any job. The problem has been solved by Smith [Smith, W. E. 1956. Various optimizers for single-state production. Naval Research Logistics Quarterly 3 59-66] for the case of one machine. This note develops a branch-and-bound method for the general case.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.9.1016 (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:ormnsc:v:23:y:1977:i:9:p:1016-1019

Access Statistics for this article

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