Scheduling Jobs with Stochastically Ordered Processing times on Parallel Machines to Minimize Expected Flowtime

Abstract

A number of jobs are to be processed using a number of identical machines which operate in parallel. The processing times of the jobs are stochastic, but have known distributions which are stochastically ordered. A reward r(t) is acquired when a job is completed at time t. The function r(t) is assumed to be convex and decreasing in t. It is shown that… (More)

Topics

Cite this paper

@inproceedings{Weber1986SchedulingJW, title={Scheduling Jobs with Stochastically Ordered Processing times on Parallel Machines to Minimize Expected Flowtime}, author={Richard R. Weber and P. Varaiya and Jean C. Walrand}, year={1986} }