A Non-Permutation Flow Shop Manufacturing Cell Scheduling Problem with Part's Sequence Dependent Family Setup Times

This article presents a new mathematical model for a dynamic flow shop manufacturing cell scheduling problem (DFMCSP) with agreeable job release date for each part family where family setup times are dependent on sequence of parts within families. It means this article considers non-permutation schedules for both sequence of families and sequence of parts within families. The objective is minimizing the Makespan (C-max). Since, this problem belongs to NP-Hard class. Therefore, reaching an optimal solution in a reasonable computational time by using exact methods is extremely difficult. Thus, this article proposes meta-heuristic methods such as Genetic Algorithms (GA) and Tabu Search (TS). Finally, the computational results compare efficiency of the proposed algorithms under the performance measures.