Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain

Stephen J. Balut
Additional contact information
Stephen J. Balut: U.S. Naval Postgraduate School, Monterey, California

Management Science, 1973, vol. 19, issue 11, 1283-1288

Abstract: The n job, one-machine scheduling problem is considered where set-up and processing times are random and the objective is to minimize the number of late jobs. In the deterministic case, Moore's algorithm is known to produce an optimal schedule. A chance-constrained formulation of the nondeterministic problem is derived in which a job is processed if the probability that it will be completed prior to its due date is greater than a specified level. A deterministic equivalent problem is achieved to which application of a modification of Moore's algorithm is proven to produce an optimal schedule.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.11.1283 (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:19:y:1973:i:11:p:1283-1288

Access Statistics for this article

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