Optimal scheduling of jobs with exponential service times on identical parallel processors

Optimal scheduling of jobs with exponential service times on identical parallel processors

0.00 Avg rating0 Votes
Article ID: iaor1988533
Country: United States
Volume: 37
Issue: 1
Start Page Number: 126
End Page Number: 133
Publication Date: Jan 1989
Journal: Operations Research
Authors:
Keywords: production, project management
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. The paper deals 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.

Reviews

Required fields are marked *. Your email address will not be published.