具有同一交工期和指数加工时间的单机随机调度

STOCHASTIC SCHEDULING ON A SINGLE MACHINE WITH A COMMON DUE DATE AND EXPONEN- TIAL PROCESSING TIMES

本文研究具有同一交工期和指数加工时间、目标函数是期望的未完工费用的单机随机调度问题,即I|X_j～exp(λ_j),d|E(∑IC_j)。工件的最优排序是按IC_iλ_i非升的排序,得到了排序可交换性及未完工费用的等价性等附加结果.

This paper considers stochastic scheduling on a single machine with jobs having a common due date and exponential processing times. The performance measure to be optimized is the expected incompletion cost. Preemptions are not allowed and the machine could not be idle. The results of the paper show that the optimal policy is the sequence the jobs in the nonincrearsing order of IcIiλ_j. Besides the properties of the incompletion cost (IC_j)are evaluated and used to obtain some useful results.