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

Audrey Cerqueus; Xavier Delorme

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

Audrey Cerqueus ^{1, 2} Xavier Delorme ^{2, 1}

1 FAYOL-ENSMSE - Département Génie mathématique et industriel

2 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes

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.

Document type :

Conference papers

Domain :

Computer Science [cs] / Modeling and Simulation

Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-01650019
Contributor : Florent Breuil <>
Submitted on : Tuesday, November 28, 2017 - 10:45:55 AM
Last modification on : Friday, March 8, 2019 - 3:40:09 PM

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

Identifiers

Collections

Citation

Export

Metrics

491

Contact

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

Identifiers

Collections

Citation

Export

Share

Metrics

491

Contact