Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4628874 | Applied Mathematics and Computation | 2013 | 23 Pages |
Abstract
We consider an identical parallel-machine scheduling problem to minimize the sum of weighted completion times of jobs. However, instead of allowing machines to be continuously available as it is generally assumed, we consider that each machine is subject to a deterministic and finite maintenance period. This condition increases the problem complexity. We provide for the problem an adapted heuristic, lower bounds based on Lagrangian relaxation and column generation methods. Computational study shows satisfactory results.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Racem Mellouli, Imed Kacem, Chérif Sadfi, Chengbin Chu,