不确定环境下的单机成套订单鲁棒计划

A Robust Scheduling Approach for Whole-set Orders on Single Machine under Uncertain Environment

讨论了不确定环境下订单数量可变的单机成套计划的优化问题,利用对偶变换给出了该问题的鲁棒整数规划模型,并设计了相应的遗传算法。算法对约束条件难点的处理采用了四种不同的方法即死亡惩罚、罚函数法、修补方法和解码方法,以检验算法的性能。最后进行了数值仿真实验,以比较不同算法的有效性。

An optimization of scheduling problem was studied to maximize the number of whole-set orders for single machine with flexibile quantity under uncertain environment. A robust integer programming model was presented, and four algorithms based on genetic algorithm, death penalty, penalty function, repair method and decode method were designed to solve the difficulty of constraints. Numerical simulation experiments were conducted to demonstrate the effectiveness of the proposed algorithms.