Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 197, Issue 3, Pages 1150-1165Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2008.03.043
Keywords
Scheduling problem; Availability constraints; Parallel machines; Total completion times
Ask authors/readers for more resources
In this paper, we study the identical parallel machine scheduling problem with a planned maintenance period on each machine to minimize the sum of completion times. This paper is a first approach for this problem. We propose three exact methods to solve the problem at hand: mixed integer linear programming methods, a dynamic programming based method and a branch-and-bound method. Several constructive heuristics are proposed. A lower bound, dominance properties and two branching schemes for the branch-and-bound method are presented. Experimental results show that the methods can give satisfactory solutions. Crown Copyright (C) 2008 Published by Elsevier B.V. All rights reserved.
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