A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
Year of publication: |
2024
|
---|---|
Authors: | Álvarez-Miranda, Eduardo ; Pereira, Jordi ; Vilà, Mariona |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 166.2024, Art.-No. 106597, p. 1-16
|
Subject: | Assembly line balancing | Branch and bound | Lower bounds | Precedence constraints | Production | Theorie | Theory | Fließfertigung | Assembly-line production | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research |
-
Morrison, David Robert, (2014)
-
An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines
Hazır, Öncü, (2021)
-
Branch, bound and remember algorithm for two-sided assembly line balancing problem
Li, Zixiang, (2020)
- More ...
-
Analysis of the simple assembly line balancing problem complexity
Álvarez-Miranda, Eduardo, (2023)
-
Variable-depth local search heuristic for assembly line balancing problems
Álvarez-Miranda, Eduardo, (2023)
-
Vilà, Mariona, (2013)
- More ...