On the complexity of the FIFO stack-up problem
Year of publication: |
February 2016
|
---|---|
Authors: | Gurski, Frank ; Rethmann, Jochen ; Wanke, Egon |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 83.2016, 1, p. 33-52
|
Subject: | Computational complexity | Combinatorial optimization | Directed pathwidth | Discrete algorithms | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
-
Minimizing the number of workers in a paced mixed-model assembly line
Delorme, Xavier, (2019)
-
Machine speed scaling by adapting methods for convex optimization with submodular constraints
Shioura, Akiyoshi, (2017)
-
Scheduling under linear constraints
Nip, Kameng, (2016)
- More ...
-
Gurski, Frank, (2019)
-
An approximation algorithm for the stack-up problem
Rethmann, Jochen, (2000)
-
An approximation algorithm for the stack-up problem
Rethmann, Jochen, (2000)
- More ...