Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES(2007)
摘要
Simple optimal policies are known for the problem of scheduling jobs to minimize expected makespan on two parallel machines when the job running-time distribution has a monotone hazard rate. But no such policy appears to be known in general. We investigate the general problem by adopting two-point running-time distributions, the simplest discrete distributions not having monotone hazard rates. We derive a policy that gives an explicit, compact solution to this problem and prove its optimality. We also comment briefly on first-order extensions of the model, but each of these seems to be markedly more difficult to analyze.
更多查看译文
关键词
first order,discrete distribution,hazard rate
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要