Abstract
Job shop scheduling problems (JSSP) are among the most intensive combinatorial problems studied in literature. The flexible job shop problem (FJSP) is a generalization of the classical JSSP where each operation can be processed by more than one resource. The FJSP problems cover two difficulties, namely, machine assignment problem and operation sequencing problem. This paper investigates the flexible job-shop scheduling problem with sequence-dependent setup times to minimize two kinds of objectives function: makespan and bi-criteria objective function. For that, we propose a genetic algorithm (GA) to solve this problem. To evaluate the performance of our algorithm, we compare our results with other methods existing in literature. All the results show the superiority of our GA against the available ones in terms of solution quality.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
