A Three-Layer Chromosome Genetic Algorithm for Multi-Cell Scheduling With Flexible Routes and Machine Sharing

Abstract

Alternative machines assignment, machine sharing, and inter-cell movements are very common yet difficult to be solved integratedly in modern dynamic Cellular Manufacturing Systems (CMS). In this paper, we incorporate these issues and consider a dynamic cellular scheduling problem with flexible routes and machine sharing. We employ a mixed integer programming scheduling model to minimize both the makespan and the total workload. To solve this new model, we propose a three-layer chromosome genetic algorithm (TCGA). We first compare the performances of the proposed TCGA with the optimal solution obtained by CPLEX. Computational results show that the TCGA performs well within a reasonable amount of time. We further compare our proposed TCGA with
the classic genetic algorithm (GA) and the shortest processing time (SPT) rule through numerical experiments. The results reveal that the TCGA significantly improves the performance and effectively balances the workload of machines.

Keywords: Dynamic cellular manufacturing, Inter-cell movement, Bi-objective programming, Three-layer chromosome genetic algorithm, Machine sharing

JEL Classification: C61, M11, M20