An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance

Ming Liu 1 Shijin Wang 1 Chengbin Chu 1, 2 Feng Chu 3
1 School of Economics & Management
2 LGI - Laboratoire Génie Industriel - EA 2606
3 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
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 : branch-and-bound number of tardy jobs periodic maintenance scheduling single machine
Document type :
Journal articles
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-01416028
Contributor : Frédéric Davesne <>
Submitted on : Tuesday, December 13, 2016 - 10:09:42 PM
Last modification on : Wednesday, January 22, 2020 - 11:38:08 AM

Identifiers

Collections

UNIV-EVRY | IBISC | IBISC-AROBAS | LGI | CENTRALESUPELEC | UNIV-PARIS-SACLAY | LGI-MO

Citation

Ming Liu, Shijin Wang, Chengbin Chu, Feng Chu. An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance. International Journal of Production Research, Taylor & Francis, 2016, 54 (12), pp.3591--3602. ⟨10.1080/00207543.2015.1108535⟩. ⟨hal-01416028⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

178

Contact

Informations

CCSD