A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
Year of publication: |
1 May 2018
|
---|---|
Authors: | Polyakovskiy, Sergey ; M'Hallah, Rym |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 266.2018, 3 (1.5.), p. 819-839
|
Subject: | Cutting | Two-dimensional bin packing | Batch scheduling | Packing heuristic | Lookahead search | Packproblem | Packing problem | Heuristik | Heuristics | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Operations Research | Operations research |
-
A genetic algorithm for two-dimensional bin packing with due dates
Bennell, Julia A., (2013)
-
A single machine scheduling problem with two-dimensional vector packing constraints
Billaut, Jean-Charles, (2015)
-
An adaptive selection approach for the 2D rectangle packing area minimization problem
Wei, Lijun, (2018)
- More ...
-
A multi-agent system for the weighted earliness tardiness parallel machine problem
Polyakovskiy, Sergey, (2014)
-
Just-in-time two-dimensional bin packing
Polyakovskiy, Sergey, (2021)
-
A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
Polyakovskiy, Sergey, (2022)
- More ...