Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482638 | European Journal of Operational Research | 2009 | 16 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Racem Mellouli, Chérif Sadfi, Chengbin Chu, Imed Kacem,