On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs

William L. Maxwell
Additional contact information
William L. Maxwell: University of Chicago

Management Science, 1970, vol. 16, issue 5, 295-297

Abstract: An integer programming formulation for the problem of sequencing jobs on a single machine to minimize the number of late jobs is developed. The structure of the formulation is exploited to obtain the easily stated algorithm (previously developed by Moore [5]) for the solution of the problem and then to compare it to other similar allocation problems, among which is the Knapsack problem.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.5.295 (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:16:y:1970:i:5:p:295-297

Access Statistics for this article

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