Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-27T10:19:26.707Z Has data issue: false hasContentIssue false
  • English
  • Français

Inequalities and bounds for the scheduling of stochastic jobs on parallel machines

Published online by Cambridge University Press:  14 July 2016

Michael Pinedo  and
Zvi Schechner
Michael Pinedo*
Affiliation:
Columbia University
Zvi Schechner*
Affiliation:
Columbia University
*
Postal address: Department of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027, USA.
Postal address: Department of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Consider n jobs and m machines. The m machines are identical and set up in parallel. All n jobs are available at t = 0 and each job has to be processed on one of the machines; any one can do. The processing time of job j is Xj, a random variable with distribution Fj. The sequence in which the jobs start with their processing is predetermined and preemptions are not allowed. We investigate the effect of the variability of the processing times on the expected makespan and the expected time to first idleness. Bounds are presented for these quantities in case the distributions of the processing times of the jobs are new better (worse) than used.

Keywords

MAKESPANTIME TO FIRST IDLENESSVARIABILITY
Type
Short Communications
Information
Journal of Applied Probability , Volume 22 , Issue 3 , September 1985 , pp. 739 - 744
Copyright
Copyright © Applied Probability Trust 1985 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bessler, S. A. and Veinott, A. F. Jr (1966) Optimal policy for a dynamic multi-echelon inventory model. Naval Res. Logist. Quart. 13, 355–358.CrossRefGoogle Scholar
Coffman, E. G. Jr, Frederickson, G. N. and Lucker, G. S. (1984) A note on expected makespans for largest-fit sequences of independent tasks on two processors. Math. Operat. Res. CrossRefGoogle Scholar
Feller, W. (1966) An Introduction to Probability Theory and its Applications, Vol. 2. Wiley, New York.Google Scholar
Marshall, A. W. and Proschan, F. (1972) Classes of distributions applicable in replacement with renewal theory applications. Proc. 6th Berkeley Symp. Math. Statist. Prob. 1, 395–415.Google Scholar
Whitt, W. (1980) The effect of variability in the GI/G/s queue. J. Appl. Prob. 17, 1062–1071. Correction: J. Appl. Prob. 21 (1984), 445–446.CrossRefGoogle Scholar