An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance - Archive ouverte HAL Access content directly
Journal Articles International Journal of Production Research Year : 2016

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

Ming Liu
Shijin Wang
Chengbin Chu
Feng Chu

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.
No file

Dates and versions

hal-01273032 , version 1 (11-02-2016)

Identifiers

Cite

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, 2016, 54 (12), pp.3591-3602. ⟨10.1080/00207543.2015.1108535⟩. ⟨hal-01273032⟩
122 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More