 |
International Society of Science and Applied Technologies |
| Optimal Scheduling Problem for a Single Machine with Preventive Maintenance Constraints | ||||
| Author | Lu-Wen Liao
|
|||
| Co-Author(s) | Tsang-Chuan Chang; Yen-Chia Chen
|
|||
| Abstract | With the rapid advancement of information technology and the rise of Industry 4.0, automated machines and intelligent equipment are increasingly being utilized in manufacturing. These technologies have significantly enhanced production capacity and efficiency across production lines. However, the substantial investment required for such equipment makes preventive maintenance a critical strategy for manufacturers. Preventive maintenance ensures machinery operates at optimal performance, minimizing malfunctions and maintaining production stability. This approach helps prevent disruptions to production schedules and avoids unnecessary costs. This study focuses on incorporating preventive maintenance periods into scheduling plans to optimize machine utilization. The goal is to schedule independent jobs within a planning horizon while minimizing the makespan. A mixed-integer programming model is proposed to address this scheduling problem, alongside a branch-and-bound method designed to optimize solutions based on machine maintenance and job characteristics. Data analysis reveals that the branch-and-bound method can solve up to 40 jobs within a reasonable timeframe, while the genetic algorithm effectively handles larger instances, providing high-quality approximate solutions.
|
|||
| Keywords | Machine scheduling; Preventive maintenance; MIP model; Branch and Bound | |||
| Article #: RQD2025-212 | ||||
Proceedings of 30th ISSAT International Conference on Reliability & Quality in Design |