Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 47, Issue 7, Pages 1753-1771Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207540701636348
Keywords
scheduling; preventive maintenance; branch-and-bound algorithm
Ask authors/readers for more resources
We consider the single machine total flow time problem in which the jobs are non-resumable and the machine is subject to preventive maintenance activities of known starting times and durations. We propose a branch-and-bound algorithm that employs powerful optimality properties and bounding procedures. Our extensive computational studies show that our algorithm can solve large-sized problem instances with up to 80 jobs in reasonable times. We also study a two-alternative maintenance planning problem with minor and major maintenances. We give a polynomial-time algorithm to find the optimal maintenance times when the job sequence is fixed.
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