Minimizing expected makespans of multi-priority classes of jobs on uniform processors

Authors:
Susan H. Xu
Affiliations:
Department of Management Science, College of Business Administration, The Pennsylvania State University, University Park, PA 16802, USA
Venue:
Operations Research Letters
Year:
1991

Citing 5
Cited 0

Job scheduling to minimize expected weighted flowtime on uniform processors

Systems & Control Letters
Socially and individually optimal routing of stochastic jobs in parallel processor systems

Operations Research
Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan

Journal of the ACM (JACM)
Introduction to Stochastic Dynamic Programming: Probability and Mathematical

Introduction to Stochastic Dynamic Programming: Probability and Mathematical
A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider a scheduling problem where several classes of non-preemptive jobs with different priorities are to be processed on two processors with different processing speeds. Of the jobs waiting to be processed, jobs with the highest priority have the first option of being dispatched to the available processors. Let processing times have increasing hazard rate (IHR) distributions which depend on the processor and job class. It is shown that for each job class there exists a simple threshold policy which minimizes the expected makespan (the completion time of the last job) of the class, among all non-preemptive policies. This research extends the result of Coffman, Flatto, Garey and Weber to include several priority job classes and more general processing time distributions. The proof is presented in a more intuitive and simpler manner.