A new Lagrangian bound for the min-sum job-shop scheduling
Langue
en
Communication dans un congrès
Ce document a été publié dans
International Symposium on Scheduling ISS'2015, 2015-07, Kobe. 2015-07
Résumé en anglais
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 ...Lire la suite >
Mots clés en anglais
Min-sum job-shop scheduling
Lagrangian relaxation
Job-level decomposition
Machine-level decomposition