An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

J. Michael Moore
Additional contact information
J. Michael Moore: The University of Michigan

Management Science, 1968, vol. 15, issue 1, 102-109

Abstract: An algorithm, computationally feasible for large problems, has been formulated for sequencing n jobs through a single facility to minimize the number of late jobs. This algorithm is then extended to solve the problem in which each job is associated with a continuous, monotone non-decreasing deferral cost function. The object is to produce a schedule where the maximum deferral cost incurred is minimal.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (77)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.15.1.102 (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:15:y:1968:i:1:p:102-109

Access Statistics for this article

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