 |
Journal articles
An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance
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.
https://hal.archives-ouvertes.fr/hal-01273032
Contributor : Chengbin Chu <>
Submitted on : Thursday, February 11, 2016 - 4:58:35 PM
Last modification on : Friday, October 9, 2020 - 9:44:41 AM
Contributor : Chengbin Chu <>
Submitted on : Thursday, February 11, 2016 - 4:58:35 PM
Last modification on : Friday, October 9, 2020 - 9:44:41 AM