节点文献
加工时间不确定的Job Shop鲁棒调度模型及其求解
Robust Model for Job Shop Scheduling with Uncertain Processing Times
【Author】 Bing Wang,Xiaofei Yang School of Mechanical & Electrical Engineering,Shandong university at Weihai,Weihai 264209
【机构】 山东大学威海分校机电工程学院;
【摘要】 本文讨论性能指标为makespan的不确定性Job Shop调度问题,基于场景方法对不确定的加工时间进行描述.提出了一种度量调度鲁棒性的优化指标以体现决策者的抗风险偏向,并基于该鲁棒度量建立了一种综合考虑期望性能和抗风险鲁棒性的调度模型.该模型可以抵御调度在坏场景下性能恶化的风险,同时可以保持优化的期望性能不会有很大下降.本文用遗传退火算法对建立的不确定模型进行求解,并与已有的模型进行对比分析.仿真结果表明本文提出的鲁棒调度模型兼顾调度的期望性能和鲁棒性,相对已有模型表现出优势.
【Abstract】 This paper discusses the Job Shop scheduling problem(JSSP) with uncertain processing times to minimize the makespan.The scenario planning approach is used to represent the uncertain processing times.A robustness measure is formulated to reflect the decision-maker’s preference of risk aversion,and based on this robustness measure a robust scheduling model combining the expected makespan and the robustness measure is established in this paper.The robust model can prevent the risk of deteriorating performances in bad scenarios while keeping the expected performance with little sacrifice.A genetic simulated annealing algorithm is applied to solve the robust JSSP.The performances for the robust model were compared with those for two existing models.The computational results show that the robust model presented in this paper can compromise the expected performance and the robustness,and it is advantageous to the existing models.
【Key words】 Job Shop scheduling; uncertain processing times; robustness measure; scenario planning approach; Genetic Simulated Annealing Algorithm;
- 【会议录名称】 2009中国控制与决策会议论文集(2)
- 【会议名称】2009中国控制与决策会议
- 【会议时间】2009-06-17
- 【会议地点】中国广西桂林
- 【分类号】TP13
- 【主办单位】Northeastern University,China、IEEE Industrial Electronics (IE) Chapter,Singapore、Guilin University of Electronic Technology,China