Scheduling with Random Service Times

Michael H. Rothkopf
Additional contact information
Michael H. Rothkopf: Massachusetts Institute of Technology

Management Science, 1966, vol. 12, issue 9, 707-713

Abstract: This paper considers the problem scheduling of m immediately available tasks with random variable service times. It is shown that certain such problems can be reduced to equivalent deterministic problems. The existence of optimal schedules not involving the removal from service of incompletely processed tasks for some problems is proved and for other problems is disproved.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.12.9.707 (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:12:y:1966:i:9:p:707-713

Access Statistics for this article

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