An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance |
| |
Authors: | Ming Liu Chengbin Chu Feng Chu |
| |
Affiliation: | 1. School of Economics &2. Management, Tongji University, Shanghai, P.R. China.;3. Laboratoire Génie Industriel, Ecole Centrale Paris, Chatenay-Malabry Cedex, France.;4. Laboratory IBISC, University of évry Val d’Essonne, Evry, France. |
| |
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. |
| |
Keywords: | scheduling branch-and-bound periodic maintenance single machine number of tardy jobs |
|
|