A branch-and-bound algorithm to minimize the line length of a two-sided assembly line
Year of publication: |
2010
|
---|---|
Authors: | Hu, Xiaofeng ; Erfei, Wu ; Jinsong, Bao ; Jin, Ye |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 206.2010, 3 (1.11.), p. 703-707
|
Subject: | Theorie | Theory | Fließfertigung | Assembly-line production | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Scheduling-Verfahren | Scheduling problem |
-
Branch, bound and remember algorithm for two-sided assembly line balancing problem
Li, Zixiang, (2020)
-
An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines
Hazır, Öncü, (2021)
-
Nekoiemehr, N., (2011)
- More ...
-
A heuristic project scheduling approach for quick response to maritime disaster rescue
Yan, Liang, (2009)
-
A branch-and-bound algorithm to minimize the line length of a two-sided assembly line
Xiaofeng, Hu, (2010)
-
A branch-and-bound algorithm to minimize the line length of a two-sided assembly line
Xiaofeng, Hu, (2010)
- More ...