Note--A Note on Single Machine Sequencing with Random Processing Times

Thom J. Hodgson
Additional contact information
Thom J. Hodgson: University of Florida

Management Science, 1977, vol. 23, issue 10, 1144-1146

Abstract: It is shown that Lawler's efficient (order n 2 ) algorithm for the n-job, one-machine scheduling problem (where the objective is to minimize the maximum deferral cost subject to arbitrary precedence relationships) also applies when the processing times are random variables and the objective is to minimize the maximum expected deferral cost. Several special cases are explored.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.10.1144 (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:10:p:1144-1146

Access Statistics for this article

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