[1]潘全科,罗翔,朱剑英.基于准时制的时间-成本双目标作业调度优化[J].东南大学学报(自然科学版),2003,33(1):97-101.[doi:10.3969/j.issn.1001-0505.2003.01.025]
 Pan Quanke,Luo Xiang,Zhu Jianying.Intelligent scheduling optimization of bi-objective job-shop based JIT production[J].Journal of Southeast University (Natural Science Edition),2003,33(1):97-101.[doi:10.3969/j.issn.1001-0505.2003.01.025]
点击复制

基于准时制的时间-成本双目标作业调度优化()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
33
期数:
2003年第1期
页码:
97-101
栏目:
自动化
出版日期:
2003-01-20

文章信息/Info

Title:
Intelligent scheduling optimization of bi-objective job-shop based JIT production
作者:
潘全科1 罗翔2 朱剑英1
1 南京航天航空大学机械电子工程研究所,南京 210016; 2 东南大学机械工程系,南京 210096
Author(s):
Pan Quanke1 Luo Xiang2 Zhu Jianying1
1 Mechatronic Engineering Institute, Nanjing University of Aeronautics and Astronautics Nanjing 210016, china
2 Department of Mechanical Engineering, Southeast University, Nanjing 210096, China
关键词:
作业车间调度 混合遗传算法 双目标优化 准时制
Keywords:
job shop schedule hybrid genetic algorithms bi-objective scheduling just in time
分类号:
TP18
DOI:
10.3969/j.issn.1001-0505.2003.01.025
摘要:
提出了一种基于混合遗传算法的以生产周期和生产成本为优化目标的作业调度方法.该方法采用Giffler-Thompson 启发式调度算法产生活动的调度,基于工序编码的染色体决定了工序调度的优先级,在启发式调度算法产生的冲突集合中,根据工序的优先级选择下一步安排加工的工序.混合遗传运算在全局范围内搜索具有最优调度工序优先级的染色体.同时,在Giffler-Thompson 的启发式算法中,采用了反向调度的策略,即从工件的交货期开始,先安排最后一道生产工序,然后依次安排前一道生产工序,直到工件的第一道工序调度完毕,形成一个完整的调度方案.在算法中,不仅考虑了工件的生产周期和多个工艺计划,而且考虑了库存费用和加工费用,设计了基于生产周期和生产成本的双目标适应度函数.算例结果表明该方法是可行的.
Abstract:
A robust procedure is presented to solve bi-objective scheduling problems based on just-in-time(JIT)production with large number of more realistic constrains such as alternative processing plans for parts, which simultaneously addresses the reduction of makespan and the costs of operating and storage during parts processing. Genetic algorithm combined with heuristic scheduling is applied for job shop problems. The conflict among the contending jobs in the Giffler and Thompson procedure is resolved and the optimal operations precedence is derived. Backward scheduling is used to construct a reversed problem for a forward scheduling problem with precedence constraints by considering the predecessors of each operation in the forward problem as successors in the reverse problem. The release time of each job is assured to equate to its due date. An example of scheduling is given, and the results show that the method is available and efficient.

参考文献/References:

[1] 张毅.制造资源计划MRP-2及其应用[M].北京:清华大学出版社,1997.9-11.
[2] Bushee D C,Svestka J A.A bi-directional scheduling approach for job shops[J].Int J Prod Res,1999,37(16):3823-3837.
[3] Nasr Nabil,Elsayed E A.Job shop scheduling with alternative machines[J].Int J Prod Res,1990,28(9):1595-1609.
[4] Cheng R,Gen M,Tsujimura Y.A tutorial survey of job-shop scheduling problems using genetic algorithms,part Ⅱ:hybrid genetic search strategies[J].Computers & Industrial Engineering,1999(36):343-364.
[5] Cheng R,Gen M,Tsujimura Y.A tutorial survey of job-shop scheduling problems using genetic algorithms,part Ⅰ:representation[J].International Journal of Computers and Industrial Engineering,1996(30):343-364.
[6] 玄光男,程润伟.遗传算法与工程设计[M].北京:科学出版社,2000.137-139,19-22,15-16.
[7] Giffler B,Thompson G.Algorithms for solving production scheduling problems[J].Operations Research,1960,8(4):487-530.
[8] 李怀祖.决策理论导引[M].北京:机械工业出版社,1993.53-54,47-48.
[9] Shi Guoyong.A genetic algorithm to a classic job-shop scheduling problem[J].International Journal of Systems Sciences, 1997,28(1):25-32.

相似文献/References:

[1]毛海军,芮维娜,李旭宏.基于不确定条件的再制造物流网络优化设计[J].东南大学学报(自然科学版),2010,40(2):425.[doi:10.3969/j.issn.1001-0505.2010.02.040]
 Mao Haijun,Rui Weina,Li Xuhong.Optimal design of logistics network for remanufacturing under uncertainty[J].Journal of Southeast University (Natural Science Edition),2010,40(1):425.[doi:10.3969/j.issn.1001-0505.2010.02.040]

备注/Memo

备注/Memo:
基金项目: 国家自然科学基金重大资助项目(59990470).
作者简介: 潘全科(1971—),男,博士生; 朱剑英(联系人),男,教授,博士生导师.
更新日期/Last Update: 2003-01-20