N-Job, One Machine Sequencing Problems Under Uncertainty

Roger A. Blau
Additional contact information
Roger A. Blau: University of North Carolina

Management Science, 1973, vol. 20, issue 1, 101-109

Abstract: N jobs simultaneously arrive at a machine where they are to be processed. It is assumed that the processing times and due dates for the jobs are independent random variables whose distributions are known. The problem is to determine the optimal sequences of jobs, before processing begins, for various criteria of tardiness. It is shown that solutions are obtainable by ascertaining the optimal paths through a particular deterministic network. Furthermore, one may utilize a branch and bound technique to find these paths. For special classes of distributions, the solution procedure degenerates, whereby the optimal sequences may be determined by inspection.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.1.101 (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:20:y:1973:i:1:p:101-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 ().