شماره ركورد كنفرانس :
4191
عنوان مقاله :
A hybrid algorithm for job shop scheduling problem with an assembly stage
پديدآورندگان :
Fattahi Parviz Department of Industrial Engineering, Bu-Ali Sina University, Hamedan, Iran , Keneshloo Sanaz sanazkeneshloo@gmail.com Industrial Engineering, Bu-Ali Sina University, Hamedan, Iran , Daneshamooz Fatemeh Industrial Engineering, Bu-Ali Sina University, Hamedan, Iran
كليدواژه :
Job shop scheduling , Assembly , Cuckoo search algorithm , Genetic algorithm
عنوان كنفرانس :
دوازدهمين كنفرانس بين المللي مهندسي صنايع
چكيده فارسي :
Job shop scheduling problem with an assembly stage is an extension of classical job shop problem (JSP). Job shop scheduling problem with an assembly stage first starts with a JSP, then appends an assembly stage to produce products. In this paper the model of the problem is described. Also, since this problem has been proved strongly NP-hard, this paper proposes a hybrid algorithm in order to minimize makespan. In this hybrid algorithm, a cuckoo search algorithm is used along with a GA in order to avoid the local minima problem and to benefit from the advantages of both types of algorithms.
