Minimizing number of tardy jobs on a single machine subject to periodic maintenance

• Published in: Omega (Oxford) Vol. 37; no. 3; pp. 591 - 599
• Main Author: Chen, Wen-Jinn
• Format: Journal Article
• Language: English
• Published: Kidlington Elsevier Ltd 01.06.2009; Elsevier; Pergamon Press Inc
• Series: Omega
• Subjects: Algorithms; Applied sciences; Branch & bound algorithms; Exact sciences and technology; Heuristic; Inventory control, production control. Distribution; Job shops; Nonresumable job; Operational research and scientific management; Operational research. Management science; Periodic maintenance; Production scheduling; Scheduling; Scheduling Periodic maintenance Tardy job Nonresumable job; Scheduling, sequencing; Studies; Tardy job; Nonresumable job; Scheduling; Tardy job; Periodic maintenance; Production management; Branch and bound method; Heuristic method; Time interval; Maintenance; Single machine
• ISSN: 0305-0483; 1873-5274
• DOI: 10.1016/j.omega.2008.01.001

This paper considers a single-machine scheduling problem with periodic maintenance. In this study, a schedule consists of several maintenance periods and each maintenance period is scheduled after a periodic time interval. The objective is to find a schedule that minimizes the number of tardy jobs subject to periodic maintenance and nonresumable jobs. Based on the Moore's algorithm, an effective heuristic is developed to provide a near-optimal schedule for the problem. A branch-and-bound algorithm is also proposed to find the optimal schedule. Some important theorems associated with the problem are implemented in the algorithm. Computational results are presented to demonstrate the effectiveness of the proposed heuristic.