摘要
对具有不确定加工时间和交货期窗口的一类作业车间调度问题进行了研究。不确定加工时间用区间数来表示,以工件提前或者拖期遭受惩罚的可能性的总加权和最小作为优化目标。设计了带精英交叉策略的遗传算法求解此类问题。仿真实验验证了该算法的有效性。计算结果表明,该遗传算法有更快的收敛速度、更高的优化精度和更好的初值鲁棒性。
Research was conducted on the Job Shop Scheduling Problems （JSSP） with uncertain processing time and due date windows. Uncertain processing time was represented by interval numbers. The objective was to minimize the weighted sum of penalty possibility for jobs due to earliness or tardiness. Genetic algorithm based on elitist- crossover strategy was proposed to solve the uncertain JSSP. Simulation experiments were carried on to prove the effectiveness of the algorithm. Computation results showed that the proposed genetic algorithm had better convergence speed, optimization accuracy and initial value robustness.
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2007年第12期2452-2455,2468,共5页
Computer Integrated Manufacturing Systems
基金
山东大学威海分校科研基金资助项目(XZ2005001)。~~
关键词
不确定性
作业车间调度
区间数
遗传算法
uncertainty
Job Shop scheduling
interval number
genetic algorithm
