A branch-and-bound method for the bi-objective simple line assembly balancing problem
Year of publication: |
2019
|
---|---|
Authors: | Cerqueus, Audrey ; Delorme, Xavier |
Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 57.2019, 18, p. 5640-5659
|
Subject: | bound set | branch-and-bound | line balancing problem | multi-objective optimisation | Fließfertigung | Assembly-line production | Mathematische Optimierung | Mathematical programming | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound | Operations Research | Operations research |
-
A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof, (2022)
-
Neto, Teresa, (2013)
-
Morrison, David Robert, (2014)
- More ...
-
Evaluating the scalability of reconfigurable manufacturing systems at the design phase
Cerqueus, Audrey, (2023)
-
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Cerqueus, Audrey, (2015)
-
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Cerqueus, Audrey, (2015)
- More ...