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

Audrey Cerqueus 1, 2, 3, 4 Xavier Delorme 1, 2, 3, 4
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
3 Mines Saint-Étienne MSE - École des Mines de Saint-Étienne
4 FAYOL-ENSMSE - Institut Henri Fayol
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
Complete list of metadatas
https://hal-emse.ccsd.cnrs.fr/emse-01650019
Contributor : Florent Breuil <>
Submitted on : Tuesday, November 28, 2017 - 10:45:55 AM
Last modification on : Thursday, October 17, 2019 - 12:36:11 PM

Identifiers

  • HAL Id : emse-01650019, version 1

Collections

EMSE | DEMO-ENSMSE | FAYOL-ENSMSE | CNRS | TDS-MACS | LIMOS | PRES_CLERMONT | INSTITUT-TELECOM

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. ⟨emse-01650019⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

573

Contact

Informations

CCSD