Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors

Thomas Kämpke
Additional contact information
Thomas Kämpke: FAW, Universitãt Ulm, Ulm, West Germany

Operations Research, 1989, vol. 37, issue 1, 126-133

Abstract: The scheduling of jobs with stochastically independent, exponentially distributed service times on identical parallel processors is considered. General sufficient conditions for optimality in expectation of priority policies for certain cost functions are given, including cases of the weighted flow time. The priority policies under consideration may be more general than the longest expected processing time (LEPT) or the shortest expected processing time (SEPT) policy. We deal with a fixed number of processors as well as certain more general resource constraints. Finally, precedence relations between jobs given by strict interval orders are admitted and an optimality result for LEPT is stated for this situation.

Keywords: production/scheduling: stochastic; project management: resource constraints (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.1.126 (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:oropre:v:37:y:1989:i:1:p:126-133

Access Statistics for this article

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