可重构性
调度(生产过程)
作业车间调度
灵活性(工程)
数学优化
整数规划
柔性制造系统
计算机科学
约束规划
机器人
线性规划
生产计划
生产(经济)
人工智能
地铁列车时刻表
数学
算法
随机规划
宏观经济学
电信
经济
操作系统
统计
作者
Behdin Vahedi-Nouri,Reza Tavakkoli‐Moghaddam,Zdeněk Hanzálek,Alexandre Dolgui
标识
DOI:10.1080/00207543.2023.2173503
摘要
Nowadays, the manufacturing sector needs higher levels of flexibility to confront the extremely volatile market. Accordingly, exploiting both machine and workforce reconfigurability as two critical sources of flexibility is advantageous. In this regard, for the first time, this paper explores an integrated production scheduling and workforce planning problem in a Reconfigurable Manufacturing System (RMS) benefiting from reconfigurable machines and human-robot collaboration. A new Mixed-Integer Linear Programming (MILP) model and an efficient Constraint Programming (CP) model are developed to formulate the problem, minimising the makespan as the performance metric. Due to the high complexity of the problem, the MILP model cannot handle large-sized instances. Hence, to evaluate the performance of the CP model in large-sized instances, a lower bound is derived based on the relaxation of the problem. Finally, extensive computational experiments are carried out to assess the performance of the devised MILP and CP models and provide general recommendations for managers dealing with such a complex problem. The results reveal the superiority of the CP model over the MILP model in small- and medium-sized instances. Moreover, the CP model can find high-quality solutions for large-sized instances within a reasonable computational time.
科研通智能强力驱动
Strongly Powered by AbleSci AI