A new Lagrangian bound for the min-sum job-shop scheduling
Idioma
en
Communication dans un congrès
Este ítem está publicado en
International Symposium on Scheduling ISS'2015, 2015-07, Kobe. 2015-07
Resumen en inglés
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 ...Leer más >
Palabras clave en inglés
Min-sum job-shop scheduling
Lagrangian relaxation
Job-level decomposition
Machine-level decomposition