Four-dimensional Algorithm for Job-shop Scheduling

被引：0
作者：
Chen, Jin [1 ]
Xu, Lin [1 ]
Pu, Xujin [2 ]
机构：
[1] Jiangnan Univ, Sch Mech Engn, Wuxi 214122, Peoples R China
[2] Jiangnan Univ, Sch Business, Wuxi 214122, Peoples R China
来源：
INTERNATIONAL WORKSHOP ON AUTOMOBILE, POWER AND ENERGY ENGINEERING | 2011年 / 16卷
关键词：
scheduling; Job-shop; four-dimension; proof improvement;
D O I：
10.1016/j.proeng.2011.08.1137
中图分类号：
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号：
0807 ; 0820 ;
摘要：
The four-dimensional scheduling algorithm is to select a sequence for job shop scheduling with the minimum evaluation indexes. Every operation has an evaluation index, which consists of four independent parameters. If process time and route obey normal distribution, the proof shows that there are about 88.75% averagely probability to attain the optimal makespan in the scheduling stage. This method is verified by cases with 100 jobs and 50 machines of large-scale operations, the optimization effect is 31%similar to 34% more than the general genetic algorithm and simulated annealing algorithm. (c) 2010 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of Society for Automobile, Power and Energy Engineering
引用
收藏
页数：8
相关论文
共 6 条
[1]  
Bean A.C., 1994, ORSA J COMPUTING, V6, P154
[2]  
FALKENAUER E, 1991, 1991 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-3, P824, DOI 10.1109/ROBOT.1991.131689
[3]  
MESGHOUNI, 2004, INT J APPL MATH COMP, V14, P91
[4]   An algorithm for the job shop scheduling problem based on global equilibrium search techniques [J].
Pardalos P.M. ;
Shylo O.V. .
Computational Management Science, 2006, 3 (4) :331-348
[5]  
Sevkli U, 2007, IMA J MANAG MATH, V18, P117
[6]  
Xong hegen, 2006, CHINESE J MECH ENG, V42, P50
1