A hybrid algorithm for job shop scheduling problem with an assembly stage

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.