Lagrangian relaxation and column generation-based lower bounds for the Pm, hj1 parallel to Sigma wiCi scheduling problem - Université de Lorraine Accéder directement au contenu
Article Dans Une Revue Applied Mathematics and Computation Année : 2013

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-01267632 , version 1 (04-02-2016)

Identifiants

Citer

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, 2013, 219 (22), pp.10783-10805. ⟨10.1016/j.amc.2013.05.004⟩. ⟨hal-01267632⟩
112 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More