上海交通大学 工业工程与管理系,上海 200240
收稿日期:
2019-06-21出版日期:
2021-01-01发布日期:
2021-01-19通讯作者:
陈璐E-mail:chenlu@sjtu.edu.cn作者简介:
王金凤(1993-),女,黑龙江省大兴安岭市人,硕士生,主要研究方向为生产调度.基金资助:
国家自然科学基金(51775347)A Single Machine Scheduling Problem Considering Machine Availability Constraints
WANG Jinfeng, CHEN Lu(), YANG WenhuiDepartment of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai 200240, China
Received:
2019-06-21Online:
2021-01-01Published:
2021-01-19Contact:
CHEN Lu E-mail:chenlu@sjtu.edu.cn摘要/Abstract
摘要: 针对某转子生产车间设备可靠性低导致的工件加工质量差这一问题,研究带有设备可用性约束的单机调度问题.通过设备的可靠性定义其可用性,而设备可靠性可以通过预防性维护得以恢复.在建模时考虑了多种不同改进效果的预防性维护,以最小化总拖期时间为优化目标,并设计了遗传算法对模型进行求解.算例结果表明,所提出的决策模型能够有效应对设备可用性对生产调度带来的影响.通过敏感性分析为实际车间调度提供决策支持.
关键词: 单机调度, 可用性, 预防性维护, 总拖期, 遗传算法
Abstract: The study described in this paper is derived from a real rotor production workshop where low reliability leads to poor quality of workpieces. A single machine scheduling problem considering machine availability constraints is addressed. The availability is defined by the machine reliability, which can be restored by preventive maintenance. Preventive maintenance with different improvement factors is defined in the mathematical model to minimize the total tardiness. A genetic algorithm is designed to solve the problem. Numerical results show that the proposed approach can effectively deal with the impact of machine availability constraints on production scheduling. Sensitivity analyses provide valuable managerial insights for real workshop scheduling.
Key words: single machine scheduling, availability, preventive maintenance, total tardiness, genetic algorithm
PDF全文下载地址:
点我下载PDF