A new Lagrangian bound for the min-sum job-shop scheduling
DETIENNE, Boris
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
DETIENNE, Boris
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
< Reduce
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Language
en
Communication dans un congrès
This item was published in
International Symposium on Scheduling ISS'2015, 2015-07, Kobe. 2015-07
English Abstract
This study will propose a new Lagrangian bound for the min-sum job-shop scheduling problem. The proposed method is an integration of two types of Lagrangian relaxation methods known as job-level and machine-level decomposition ...Read more >
This study will propose a new Lagrangian bound for the min-sum job-shop scheduling problem. The proposed method is an integration of two types of Lagrangian relaxation methods known as job-level and machine-level decomposition methods. It will be shown by numerical experiments that the proposed method can improve the existing lower bounds significantly.Read less <
English Keywords
Min-sum job-shop scheduling
Lagrangian relaxation
Job-level decomposition
Machine-level decomposition
Origin
Hal imported