期刊
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
卷 196, 期 -, 页码 269-283出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ijpe.2017.12.003
关键词
Dynamic cellular manufacturing; Inter-cell movement; Bi-objective programming; Three-layer chromosome genetic algorithm; Machine sharing
资金
- National Natural Science Foundation of China [71372019, 91746110, 71772010, 71521002, 71672011]
- National Science Fund of China [71625003]
- Joint Development Program of Beijing Municipal Commission of Education
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据