Please wait a minute...
J4  2011, Vol. 45 Issue (2): 240-246    DOI: 10.3785/j.issn.1008-973X.2011.02.008
    
Dynamic schedule optimization based on correlation
scheduling model
CHEN Jing, ZHANG Shu-you
Department of Mechanical Engineering, Zhejiang University, Hangzhou 310027, China
Download:   PDF(0KB) HTML
Export: BibTeX | EndNote (RIS)      

Abstract  

To reflect scheduling constraints and priority rules, a scheduling model is described with the scheduling nodes. A correlation model is established for the job shop scheduling. Constraint relationship is described with the scheduling nodes and the solution chains. Uncertain factors are taken account into the actual scheduling process that the schedule model is imported to the fuzzy job-shop problems. The correlation method was utilized to obtain the feasible schedule solutions. The primary solutions are optimized with the ACO algorithm to obtain the finally scheduling solution. Simulation results show that the method can obtain a optimal scheduling scheme when the processing time and delivery are uncertain.



Published: 17 March 2011
CLC:  TP 301  
Cite this article:

CHEN Jing, ZHANG Shu-you. Dynamic schedule optimization based on correlation
scheduling model. J4, 2011, 45(2): 240-246.

URL:

http://www.zjujournals.com/eng/10.3785/j.issn.1008-973X.2011.02.008     OR     http://www.zjujournals.com/eng/Y2011/V45/I2/240


基于关联调度模型的模糊环境下车间动态调度

为了实现在模糊加工环境下实时的动态调度,采用调度节点和调度链的建模思想构建车间作业的调度关联模型.通过调度节点和调度路径描述调度任务中的约束关系.考虑实际生产调度过程中存在的大量不确定因素,将调度关联模型引入模糊加工环境中,结合模糊加工状态下作业计划关联方法构建调度可行解,并通过蚁群算法求解调度任务的优化方案.仿真结果表明,该方法能够在加工时间和交货期不确定的情况下,通过动态调度模型的关联过程获得较为优化的调度方案.

[1] DROTOS M, ERDOS G, KIS T. Computing lower and upper bounds for a largescale industrial job shop scheduling problem [J]. European Journal of Operational Research, 2009,197(1): 296-306.
[2] ARTIBA A, RIANE F. An application of planning and scheduling multimodel approach in the chemical industry [J]. Computers in Industry, 1998,36(3): 209-229.
[3] LI Ningxing, CHEN Yingwu, YANG Kewei. Multiobjective flexible job shop schedule: Design and evaluation by simulation modeling [J]. Applied Soft Computing, 2008,9(1): 362-376
[4] CHENG Shuchen, SHIAU D F, HUANG Y M, et al. Dynamic hardrealtime scheduling using genetic algorithm for multiprocessor task with resource and timing constraints [J]. Expert Systems with Applications, 2009,36(1): 852-860.
[5] AYDIN M E, FOGARTY T C. A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems [J]. Journal of Heuristics, 2004,10(3): 269-292.
[6] BAYKASOGLU A, OZBAKIR L, SONMEZ A. Using multiple objective tabu search and grammars to model and solve multiobjective flexible job shop scheduling problems[J]. Journal of Intelligent Manufacturing, 2004,15(6): 777-785.
[7] 叶建芳,王正肖,潘晓弘.免疫粒子群优化算法在车间作业调度中的应用[J].浙江大学学报:工学版,2008,42(5): 863-879.
YE Jianfang, WANG Zhengxiao,PAN Xiaohong. Application of immune particle swarm optimization to jobshop scheduling problem [J]. Journal of Zhejiang University: Engineering Science, 2008, 42(5): 863-879.
[8] 徐震浩,顾幸生.不确定条件下具有零等待的流水车间免疫调度算法[J].计算机集成制造系统,2004,10(10): 1247-1251.
XU Zhenhao, GU Xingsheng. Immune scheduling algorithm for flow shop under uncertainty with zero wait[J]. Computer Integrated Manufacturing Systems, 2004, 10(10): 1247-1251.
[9] 苏子林.车间调度问题及其进化算法分析[J].机械工程学报,2008,44(5): 242-247.
SU Zilin. Jobshop scheduling problem and its evolution algorithm analysis[J]. Chinese Journal of Mechanical Engineering, 2008, 44(5): 242-247.
[10] 刘琳,谷寒雨,席裕庚.工件到达时间未知的动态车间滚动重调度[J].机械工程学报,2008,44(5): 68-75.
LIU Lin, GU Hanyu, XI Yugeng. Rescheduling algorithm based on rolling horizon decomposition for a dynamic job shop with uncertain arriving time [J]. Chinese Journal of Mechanical Engineering, 2008, 44(5): 68-75.
[11] GONZALEZRODRIGUEZ I, PUENTE J, VELA C R, et al. Semantics of schedules for the fuzzy jobshop problem [J]. Systems and Humans, 2008, 38(3): 655-666.
[12] 邢文训,谢金星.现代优化计算方法[M].北京:清华大学出版社,2005: 149.
[13] 姜桦,李莉,乔非,等.蚁群算法在生产调度中的应用[J].计算机工程,2005,31(5): 76-101.
JIANG Hua, LI Li, QIAO Fei, et al. Application of ant algorithm in manufacturing scheduling [J]. Computer Engineering, 2005,31(5): 76-101.
[14] 张超勇.基于自然启发式算法的作业车间调度问题理论与应用研究[D].武汉:华中科技大学,2006: 12.
ZHANG Chaoyong. Research on the shop scheduling problem with naturallyinspired heuristic algorithms [D]. Wuhan: Huazhong University of Science and Technology, 2006: 12.
[15] 王凌.车间调度及其遗传算法[M].北京:清华大学出版社,2003: 95.

[1] XU Ke-lin, ZHU Wei, LI Yan-bing. Integrated decision model for goods loading-transportation
and its genetic algorithm
[J]. J4, 2011, 45(9): 1630-1635.
[2] DONG Li-Da, CHENG Xi-Gao, ZHENG Han. Properties research of Petri nets safety place substitution[J]. J4, 2010, 44(9): 1711-1718.
[3] DONG Li-Da, ZHENG Han, CHENG Xi-Gao. Explicitcontroller design for a class of controlled Petri nets with marked graph loops[J]. J4, 2010, 44(6): 1057-1066.
[4] DING Chun, FENG Zhi-Yong. Approach for fluctuation complexity oriented context prediction[J]. J4, 2010, 44(2): 220-224.
[5] MENG Jie,LIU Hua-feng,YUE Mao-xiong,HU Hong-jie. Biomechanical model guided dual estimation of myocardial
motion and material parameters
[J]. J4, 2012, 46(5): 912-917.