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.
Type de document :
Article dans une revue
Applied Mathematics and Computation, Elsevier, 2013, 219 (22), pp.10783-10805. 〈10.1016/j.amc.2013.05.004〉
Liste complète des métadonnées

https://hal.univ-lorraine.fr/hal-01267632
Contributeur : Catherine Angevelle <>
Soumis le : jeudi 4 février 2016 - 16:10:16
Dernière modification le : jeudi 29 mars 2018 - 13:36:02

Identifiants

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〉

Partager

Métriques

Consultations de la notice

92