Bounds and bound sets for the bi-objective simple assembly line balancing problem - Mines Saint-Étienne Access content directly
Conference Papers Year : 2017

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.
No file

Dates and versions

emse-01650019 , version 1 (28-11-2017)

Identifiers

  • HAL Id : emse-01650019 , version 1

Cite

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⟩
240 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More