Bounds and bound sets for the bi-objective simple assembly line balancing problem

Abstract : This paper focuses on the use of bounds and bound sets in the solving of a bi-objective version of the simple assembly line balancing problem. The two objective functions considered are the takt time and the number of stations. We propose a bi-objective solution method, returning all solutions that present an interesting tradeoff between the two objectives. We present bounds and bound sets and introduce them in a branch-and-bound method. The algorithm is demonstrated on a didactic instance.
Type de document :
Communication dans un congrès
IESM 2017 : 7th International Conference on Industrial Engineering and Systems Management, Oct 2017, Saarbrücken, Germany. 〈http://www.iesm17.org/〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-01650019
Contributeur : Florent Breuil <>
Soumis le : mardi 28 novembre 2017 - 10:45:55
Dernière modification le : jeudi 11 janvier 2018 - 06:16:31

Identifiants

  • HAL Id : emse-01650019, version 1

Citation

Audrey Cerqueus, Xavier Delorme. Bounds and bound sets for the bi-objective simple assembly line balancing problem. IESM 2017 : 7th International Conference on Industrial Engineering and Systems Management, Oct 2017, Saarbrücken, Germany. 〈http://www.iesm17.org/〉. 〈emse-01650019〉

Partager

Métriques

Consultations de la notice

192