Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 57, Issue 4, Pages 410-415Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1057/palgrave.jors.2601998
Keywords
scheduling; periodic maintenance; flow time; nonresumable job
Ask authors/readers for more resources
This paper deals with a single-machine scheduling problem with limited machine availability. The limited availability of machine results from periodic maintenance activities. In our research, a periodic maintenance schedule consists of several maintenance periods. Each maintenance period is scheduled after a periodic time interval. The objective is to find a schedule that minimizes the total flow time subject to periodic maintenance and nonresumable jobs. Some important theorems are proved for the problem. A branch-and-bound algorithm that utilizes several theorems is proposed to find the optimal schedule. We also develop a heuristic to solve large sized problems. In this paper, computational results show that the proposed heuristic is highly accurate and efficient.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available