[1]孙志峻,朱剑英.双资源作业车间智能优化调度[J].东南大学学报(自然科学版),2005,35(3):376-381.[doi:10.3969/j.issn.1001-0505.2005.03.012]
 Sun Zhijun,Zhu Jianying.Intelligent optimization for job shop scheduling of dual-resources[J].Journal of Southeast University (Natural Science Edition),2005,35(3):376-381.[doi:10.3969/j.issn.1001-0505.2005.03.012]
点击复制

双资源作业车间智能优化调度()
分享到:

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

卷:
35
期数:
2005年第3期
页码:
376-381
栏目:
经济与管理
出版日期:
2005-05-20

文章信息/Info

Title:
Intelligent optimization for job shop scheduling of dual-resources
作者:
孙志峻 朱剑英
南京航空航天大学机电学院, 南京 210016
Author(s):
Sun Zhijun Zhu Jianying
College of Mechanical and Electrical Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
关键词:
双资源 车间调度 遗传算法
Keywords:
dual resource job shop scheduling genetic algorithms
分类号:
F406
DOI:
10.3969/j.issn.1001-0505.2005.03.012
摘要:
用遗传算法研究了双资源作业车间的调度优化问题,提出了一种将归约法与遗传算法和分派规则相结合的调度算法,该算法将机床和工人合理地分配给加工任务(工序),使评价指标获得最优.通过与国外学者的算法进行比较,本算法在相同生产周期的情况下,能够获得平均流动时间较少的调度结果.本算法采用的遗传编码不含工人和机床设备的信息,使得染色体的交叉和变异容易操作,节省了计算时间.最后还就工人/机床设备的比率对作业车间加工性能的影响进行了分析并给出分析结果.
Abstract:
Based on genetic algorithms, dual-resources constrained job-shop-scheduling problem is studied. A new scheduling algorithm is proposed, which combines genetic algorithms and reduction with dispatching rules. It reasonably assigns the resources of machines and works to jobs and achieves optimum on some performance. Compared with the solution suggested by foreign researcher, the proposed algorithm can search better solution on mean flow time. The proposed encoding does not include the information of workers and machines, so it is easily to intercross and mutate between chromosomes and spare computational time. The performance of job shop on worker staffing levels is analyzed and the result is given.

参考文献/References:

[1] EIMaraghy H,Patel V,Abdallah I B.Scheduling of manufacturing systems under dual-resource constraints using genetic algorithms [J].Journal of Manufacturing Systems, 2000,19(3):186-201.
[2] Hemant V K.Examination of worker assignment and dispatching rules for managing vital customer priorities in dual resource constrained job shop environments [J]. Computers & Operations Research, 2000,27(6):525-537.
[3] Trelven M D.A review of the dual resource constrained system research [J].IIE,Transanctions, 1989,30(21):279-287.
[4] Gargeya V B.Resource constraint measures in a dual constrained job shop [J]. Omega, 1994,22(6):659-668.
[5] Byung J P,Hyung R C,Hyun S K.A hybrid genetic algorithm for the job shop scheduling problems [J]. Computers & Industrial Engineering, 2003,45(4):597-613.
[6] Tsai C F,Tsai C W,Tseng C C.A new hybrid heuristic approach for solving large traveling salesman problem [J]. Information Sciences, 2004,166(1-4):67-81.
[7] Cheng Runwei,Gen Mitsuo,Tsujimura Yasuhiro.A tutorial survey of job-shop scheduling problems using genetic algorithms-1 [J].Computers Industry Engineering,1996,30(4):983-997.
[8] Shi Guoyong.A genetic algorithm applied to a class job-shop scheduling problem [J]. International Journal of Systems Science, 1997,28(1):25-32.

备注/Memo

备注/Memo:
基金项目: 国家自然科学基金重大资助项目(59990470).
作者简介: 孙志峻(1970—),男,博士,副教授,meezjsun@nuaa.edu.cn.
更新日期/Last Update: 2005-05-20