Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints
We consider the problem of minimizing the expected makespan of n jobs with independent exponentially distributed processing times on two parallel machines, under resource constraints. Job j has expected processing time 1/\mu j and requires throughout its processing an amount r j of a resource; the total amount of resource available is r. In the case where 1/\mu 1 n and r 1 n , we characterize all the optimal policies in the class of preemptive schedules, and show that the following nonpreemptive policy is optimal: Find the largest k for which r k + r k-1
Volume (Year): 30 (1984)
Issue (Month): 7 (July)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:30:y:1984:i:7:p:883-899. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.