Skip to Main content Skip to Navigation
Journal articles

Lagrangian relaxation and column generation-based lower bounds for the Pm, hj1 parallel to Sigma wiCi scheduling problem

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.
Document type :
Journal articles
Complete list of metadata

https://hal.univ-lorraine.fr/hal-01267632
Contributor : Catherine Angevelle <>
Submitted on : Thursday, February 4, 2016 - 4:10:16 PM
Last modification on : Saturday, May 8, 2021 - 3:27:06 AM

Identifiers

Citation

Racem Mellouli, Imed Kacem, Cherif Sadfi, Chengbin Chu. Lagrangian relaxation and column generation-based lower bounds for the Pm, hj1 parallel to Sigma wiCi scheduling problem. Applied Mathematics and Computation, Elsevier, 2013, 219 (22), pp.10783-10805. ⟨10.1016/j.amc.2013.05.004⟩. ⟨hal-01267632⟩

Share

Metrics

Record views

203