Stochastic scheduling on parallel machines to minimize discounted holding costs

Authors:
Xiaoqiang Cai;Xianyi Wu;Xian Zhou
Affiliations:
Department of Systems Engineering & Management Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong;Department of Statistics and Actuarial Science, East China Normal University, Shanghai, China;Department of Actuarial Studies, Macquarie University, Sydney, Australia
Venue:
Journal of Scheduling
Year:
2009

Citing 9
Cited 1

Job scheduling to minimize expected weighted flowtime on uniform processors

Systems & Control Letters
Optimal scheduling of jobs with exponential service times on identical parallel processors

Operations Research
Approximation results in parallel machines stochastic scheduling

Annals of Operations Research
Introduction to Stochastic Dynamic Programming: Probability and Mathematical

Introduction to Stochastic Dynamic Programming: Probability and Mathematical
The Dependence of Optimal Returns from Multi-class Queueing Systems on Their Customer Base

Queueing Systems: Theory and Applications
Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs

Operations Research
Discounted Multiarmed Bandit Problems on a Collection of Machines with Varying Speeds

Mathematics of Operations Research
Single-Machine Scheduling with Exponential Processing Times and General Stochastic Cost Functions

Journal of Global Optimization
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study stochastic scheduling on m parallel identical machines with random processing times. The cost involved in the problem is discounted to the present value and the objective is to minimize the expected discounted holding cost, which covers in a unified framework many performance measures discussed in the literature as special cases, including discounted rewards, flowtime, and makespan. We prove that the SEPT rule is optimal, on a fairly general ground, in the class of preemptive dynamic policies, the class of nonpreemptive dynamic policies, and the class of nonpreemptive static list policies. The LEPT rule, on the other hand, is optimal to minimize the expected discounted makespan only under certain restrictive conditions. Without such conditions, the LEPT rule is found no longer optimal for discounted makespan by a counterexample, in contrast to the case without discounting.