شماره ركورد كنفرانس :
4191
عنوان مقاله :
A hybrid algorithm for flexible job shop scheduling with an assembly stage
پديدآورندگان :
Fattahi Parviz Associate Professor, Department of Industrial Engineering, Bu-Ali Sina University, Hamedan, Iran , Bagheri Rad Naeeme n.bagheri89@gmail.com Msc Student of Industrial Engineering, Bu-Ali Sina University, Hamedan, Iran , Daneshamooz Fatemeh PhD Student of Industrial Engineering, Bu-Ali Sina University, Hamedan, Iran
كليدواژه :
Flexible job shop scheduling , Assembly , Particle swarm optimization , Parallel variable neighborhood search
عنوان كنفرانس :
دوازدهمين كنفرانس بين المللي مهندسي صنايع
چكيده فارسي :
In this paper, flexible job shop scheduling problem (FJSP) with an assembly stage is studied. This problem consist of two-stage. At first, the parts are produced in a flexible job shop and then they are assembled in an assembly stage to produce products. problem has been proved strongly NP-hard, so in order to solve it, proposes a hybrid particle swarm optimization with parallel variable neighborhood (HPSOPVNS) algorithm that solves the FJSP to minimize makespan time.
