Scheduling with Random Service Times

This paper considers the problem scheduling of m immediately available tasks with random variable service times. It is shown that certain such problems can be reduced to equivalent deterministic problems. The existence of optimal schedules not involving the removal from service of incompletely processed tasks for some problems is proved and for other problems is disproved.

• 저널Management Science · 12(9) · 707–713
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.12.9.707
• 저자Michael H. Rothkopf