Just-in-time two-dimensional bin packing
Year of publication: |
2021
|
---|---|
Authors: | Polyakovskiy, Sergey ; M'Hallah, Rym |
Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 0305-0483, ZDB-ID 124502-8. - Vol. 102.2021, p. 1-18
|
Subject: | Approximate algorithm | Bin packing | Branch-and-check | Constraint programming | Hybrid approach | Scheduling | Weighted earliness tardiness | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Packproblem | Packing problem | Heuristik | Heuristics | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research | Just in Time | Just in time |
-
A linear programming based heuristic algorithm for bandwidth packing problem with scheduling
Joung, Seulgi, (2020)
-
A GRASP algorithm for multi container loading problems with practical constraints
Alonso, M. T., (2020)
-
An advanced tabu search approach to the dynamic airlift loading problem
Roesener, August G., (2016)
- More ...
-
Polyakovskiy, Sergey, (2018)
-
A multi-agent system for the weighted earliness tardiness parallel machine problem
Polyakovskiy, Sergey, (2014)
-
A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
Polyakovskiy, Sergey, (2022)
- More ...