Journal of Shanghai Jiao Tong University ›› 2021, Vol. 55 ›› Issue (1): 103-110.doi: 10.16183/j.cnki.jsjtu.2019.173

Special Issue: 《上海交通大学学报》2021年12期专题汇总专辑 《上海交通大学学报》2021年“工业工程与管理”专题

Previous Articles    

A Single Machine Scheduling Problem Considering Machine Availability Constraints

WANG Jinfeng, CHEN Lu(), YANG Wenhui   

  1. Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai 200240, China
  • Received:2019-06-21 Online:2021-01-01 Published:2021-01-19
  • Contact: CHEN Lu


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

CLC Number: