A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints
| Year of publication: |
1-15 November 2017
|
|---|---|
| Authors: | Kramer, Raphael ; Dell'Amico, Mauro ; Iori, Manuel |
| Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 55.2017, 21 (1/15.11.), p. 6288-6304
|
| Subject: | bin packing | assembly line balancing | generalised precedence constraints | iterated local search | batching moves | Theorie | Theory | Heuristik | Heuristics | Packproblem | Packing problem | Algorithmus | Algorithm | Fließfertigung | Assembly-line production | Scheduling-Verfahren | Scheduling problem |
-
Henke, Thomas, (2022)
-
Product sequencing in multiple-piece-flow assembly lines
Otto, Alena, (2020)
-
Competitive algorithms for the online minimum peak job scheduling
Escribe, Célia, (2025)
- More ...
-
Mathematical models and decomposition methods for the multiple knapsack problem
Dell'Amico, Mauro, (2019)
-
Heuristic and exact algorithms for the identical parallel machine scheduling problem
Dell'Amico, Mauro, (2008)
-
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
Cordeau, Jean-Franc̦ois, (2010)
- More ...