An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance. Issue 12 (17th June 2016)

• Record Type: Journal Article
• Authors: Liu, Ming; Wang, Shijin; Chu, Chengbin; Chu, Feng
• Is Part Of: International journal of production research. Volume 54:Issue 12(2016)
• Page Start: 3591
• Page End: 3602
• Publication Date: 2016-06-17
• Subjects: scheduling -- branch-and-bound -- periodic maintenance -- single machine -- number of tardy jobs; Factory management -- Periodicals; 658.57
• DOI: 10.1080/00207543.2015.1108535
• Languages: English
• ISSNs: 0020-7543

Abstract

Abstract : In this paper, we investigate a single-machine scheduling problem with periodic maintenance, which is motivated by various industrial applications (e.g. tool changes). The pursued objective is to minimise the number of tardy jobs, because it is one of the important criteria for the manufacturers to avoid the loss of customers. The strong NP-hardness of the problem is shown. To improve the state-of-the-art exact algorithm, we devise a new branch-and-bound algorithm based on an efficient lower bounding procedure and several new dominance properties. Numerical experiments are conducted to demonstrate the efficiency of our exact algorithm.