DocumentCode :
3275937
Title :
An efficient metaheuristic for the blocking job shop problem with the makespan minimization
Author :
Zhu, Jie ; Li, Xiao-ping
Author_Institution :
Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China
Volume :
3
fYear :
2011
fDate :
10-13 July 2011
Firstpage :
1352
Lastpage :
1357
Abstract :
In this paper, the blocking job shop problem with the makespan minimization is considered, in which each operation is blocked on the corresponding machine until the machine required by its successive operation is available. A feasible schedule generation method (FSGM) is introduced to obtain the valid schedule of a given sequence by resolving conflicts between every pair of jobs in the sequence. A blocking time transfer procedure is integrated into FSGM to reduce the blocking time on a job. By reducing the blocking time, the solution obtained can be further improved. A complete local search with memory is proposed to aim for the sequence which can lead to the optimal schedule. The computational results show that the proposed algorithm can perform effectively and efficiently.
Keywords :
job shop scheduling; minimisation; search problems; sequences; FSGM; blocking job shop problem; blocking time transfer procedure; feasible schedule generation method; local search; makespan minimization; optimal schedule; Cybernetics; Indexes; Machine learning; Minimization; Schedules; Search problems; System recovery; Blocking; Job shop; Makespan;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics (ICMLC), 2011 International Conference on
Conference_Location :
Guilin
ISSN :
2160-133X
Print_ISBN :
978-1-4577-0305-8
Type :
conf
DOI :
10.1109/ICMLC.2011.6016867
Filename :
6016867
Link To Document :
بازگشت