DocumentCode :
3404542
Title :
Study on Job Shop Scheduling with Many Function-Same Machines
Author :
Xie, Zhiqiang ; Ye, Guangjie ; Liu, Yong ; Tan, Guangyu
Author_Institution :
Harbin Univ. of Sci. & Technol., Harbin
fYear :
2007
fDate :
5-8 Aug. 2007
Firstpage :
1278
Lastpage :
1282
Abstract :
Aiming at some operations of job can be assembled by any machine selected from the function-same machine set, a secondary optimization algorithm for operations on function-same machines is put forward: the machine which can make the completion time of operation early will be selected according to a dispatching rule (earliest due date, EDD), and operations are arranged in the right position of machine selected, then each operation can be assembled as soon as possible, and the total processing time of job can be shortened as soon as possible. To independent operations optimum scheduling algorithm is adopted: the inserting position of operations will be confirmed according to the margin that processing time of operations is subtracted from idle time of machine, and the operation will be inserted in the position with minimal margin. The experiment shows that the new algorithm without increasing complexity has better scheduling result for job shop scheduling problem with many function-same machines.
Keywords :
job shop scheduling; optimisation; dispatching rule; earliest due date; job shop scheduling; many function-same machines; optimization; Algorithm design and analysis; Assembly; Automation; Computer science; Dispatching; Educational institutions; Job shop scheduling; Mathematical model; Mechatronics; Scheduling algorithm; Function-same machine; Job Shop Scheduling; optimization; optimum scheduling algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mechatronics and Automation, 2007. ICMA 2007. International Conference on
Conference_Location :
Harbin
Print_ISBN :
978-1-4244-0828-3
Electronic_ISBN :
978-1-4244-0828-3
Type :
conf
DOI :
10.1109/ICMA.2007.4303733
Filename :
4303733
Link To Document :
بازگشت