Minimizing Makespan with Bimodal Processing Time Distributions

Michael Pinedo
Additional contact information
Michael Pinedo: Georgia Institute of Technology

Management Science, 1981, vol. 27, issue 5, 582-586

Abstract: We consider the problem of scheduling n tasks on two identical parallel processors. Task i has a processing time of one time unit, but might have to undergo processing for a second time unit with probability p i , i.e., the processing time distributions of the tasks have mass only on one and on two. We are interested in the sequence in which to process these tasks in order to minimize the expected completion time of all tasks. The optimal sequence turns out to be a sequence not well-known in the theory of scheduling.

Keywords: stochastic scheduling; reliability theory (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.27.5.582 (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:27:y:1981:i:5:p:582-586

Access Statistics for this article

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