You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Scheduling Tasks with Exponential Service Times on Non-Identical Processors to Minimize Various Cost Functions
Gideon Weiss and Michael Pinedo
Journal of Applied Probability
Vol. 17, No. 1 (Mar., 1980), pp. 187-202
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/3212936
Page Count: 16
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
We consider preemptive scheduling of N tasks on m processors; processors have different speeds, tasks require amounts of work which are exponentially distributed, with different parameters. The policies of assigning at every moment the task with shortest (longest) expected processing time among those not yet completed to the fastest processor available, second shortest (longest) to the second fastest etc., are examined, and shown to minimize expected values of various cost functions. As special cases we obtain policies which minimize expected flowtime, expected makespan and expected lifetime of a series system with m component locations and N spares.
Journal of Applied Probability © 1980 Applied Probability Trust