加工时间具有似然关系的单机调度

Single Machine Scheduling with the Processing Time Likelihood Ratio Ordered

对加工时间不确定的单机调度问题,构建了工件基本加工时间具有似然关系的工件调度模型。该模型中工件基本加工时间可按照似然比排序,并考虑了工件加工时间同时存在学习效应和恶化效应,以最小化所有工件期望完成时间为目标函数。研究表明,每个工件按照其期望基本加工时间的非减序列排序时,完成所有工件的时间最短。最后通过数值算例模拟工件调度过程,验证了该模型能有效地缩短工件完工时间。

From the perspective of single machine problems with stochastic processing time, ascheduling model where the processing times were likelihood ratio ordered was built up. Thelearning effect and deteriorating effect in processing time were considered. The model aimed toachieve the minimum expected completion time of all the jobs. The results show that the optimalsolution can be obtained as long as the jobs are processed according to the non-decreasing order ofthe expected normal processing time. Finally, a set of numerical experiments were presented tosimulate the process of single machine scheduling, proving that the proposed scheduling modelcould shorten the completion time effectively.