On the optimality of LEPT and cµ rules for machines in parallel
From MaRDI portal
Publication:4021723
DOI10.2307/3214903zbMath0766.90038OpenAlexW2103902006MaRDI QIDQ4021723
Cheng-Shang Chang, Xiuli Chao, Michael L. Pinedo, Richard R. Weber
Publication date: 16 January 1993
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3214903
makespanexponential distributionsstochastic schedulingweighted flowtimerandom release datesexponentially distributed processing timespreemptive policiespriority policies
Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)
Related Items (6)
An improved greedy algorithm for stochastic online scheduling on unrelated machines ⋮ A scheduling problem for several parallel servers ⋮ Stochastic scheduling on parallel machines to minimize discounted holding costs ⋮ Optimal Allocation of Machines to Distinguishable Repairmen in Order to Maximize Some Reward Functions ⋮ On stochastic machine scheduling with general distributional assumptions ⋮ Jointly optimal allocation of a repairman and optimal control of service rate for machine repairman problem
This page was built for publication: On the optimality of LEPT and cµ rules for machines in parallel
