共 59 条
Joint optimization of preventive maintenance and production rescheduling with new machine insertion and processing speed selection
被引:37
作者:
An, Youjun
[1
]
Chen, Xiaohui
[1
]
Hu, Jiawen
[2
]
Zhang, Lin
[1
]
Li, Yinghe
[1
]
Jiang, Junwei
[1
]
机构:
[1] Chongqing Univ, State Key Lab Mech Transmiss, Chongqing 400030, Peoples R China
[2] Univ Elect Sci & Technol China, Sch Aeronaut & Astronaut, Chengdu 611731, Peoples R China
基金:
中国国家自然科学基金;
国家重点研发计划;
关键词:
Preventive maintenance;
Flexible job-shop rescheduling;
New machine insertion;
Processing speed selection;
Bi-population cooperative evolutionary algorithm;
BEE COLONY ALGORITHM;
MULTIOBJECTIVE GENETIC ALGORITHM;
SHOP SCHEDULING PROBLEM;
EVOLUTIONARY ALGORITHM;
SEARCH ALGORITHM;
NSGA-III;
JOB;
SYSTEM;
POLICY;
MODEL;
D O I:
10.1016/j.ress.2021.108269
中图分类号:
T [工业技术];
学科分类号:
08 ;
摘要:
With the continuous improvement of machine performance, the multifunction machine has gradually become the first choice of many enterprises. Due to the usage and wearing of the machine, the successive operating times will decrease, while the consecutive maintenance durations will increase. Under these contexts, this paper focus on the joint optimization of preventive maintenance and flexible job-shop rescheduling with processing speed selection, and the dynamic arrival of the new machine is considered to enhance productivity. Specifically, (1) a bivariate maintenance policy considering processing speed is proposed to develop a reasonable maintenance plan for each machine; and (2) for evaluating, responding and optimizing the dynamic scheduling problem, a multi-objective optimization model, two rescheduling strategies and a bi-population cooperative evolutionary algorithm are separately constructed. In numerical experiments, the Taguchi method is first employed to set the parameters of the proposed algorithm. Second, the superiority of the proposed migration rescheduling strategy is demonstrated by comparing complete rescheduling strategy. Third, the effectiveness of the improved operators and the proposed algorithm is verified by algorithm comparison. Next, the benefits of the selectable processing speed are proven by comparing with the nominal processing speed. Finally, a sensitivity analysis on the processing speed optional range is performed.
引用
收藏
页数:20
相关论文