Decorous combinatorial lower bounds for row layout problems
Year of publication: |
2020
|
---|---|
Authors: | Dahlbeck, Mirko ; Fischer, Anja ; Fischer, Frank |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 286.2020, 3 (1.11.), p. 929-944
|
Subject: | Facilities planning and design | Integer programming | Lower bounds | Row layout problem | Ganzzahlige Optimierung | Fabrikplanung | Facility layout | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
A mixed-integer linear programming approach for the T-row and the multi-bay facility layout problem
Dahlbeck, Mirko, (2021)
-
A parallel ordering problem in facilities layout
Amaral, André R. S., (2013)
-
A corrected formulation for the double row layout problem
Zhang, Zeqiang, (2012)
- More ...
-
Exact approaches for the combined cell layout problem
Dahlbeck, Mirko, (2023)
-
Complete description for the spanning tree problem with one linearised quadratic term
Fischer, Anja, (2013)
-
A mixed-integer linear programming approach for the T-row and the multi-bay facility layout problem
Dahlbeck, Mirko, (2021)
- More ...