Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition

We solve the type-2 assembly line balancing problem in the presence of sequence-dependent setup times, denoted SUALBP-2. The problem consists of a set of tasks of a product, requiring to be processed in different assembly stations. Each task has a definite processing and setup times. The magnitude o...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	INFORMS journal on computing 2022-01, Vol.34 (1), p.315-332
1. Verfasser:	Zohali, Hassan
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Assembly lines Balancing Benchmarks Benders decomposition combinatorial optimization Computing time Cycle time Integer programming Linear programming logic-based Benders decomposition lower and upper bound Mixed integer mixed-integer programming Optimization preprocessing relaxation sequence-dependent setup times Setup times type-2 assembly line balancing Upper bounds valid inequalities
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!