A single machine scheduling problem with two-dimensional vector packing constraints
Year of publication: |
2015
|
---|---|
Authors: | Billaut, Jean-Charles ; Della Croce, Federico ; Grosso, Andrea |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 243.2015, 1 (16.5.), p. 75-81
|
Subject: | Scheduling | Two-dimensional vector packing | Recovering beam search | Matheuristics | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Heuristik | Heuristics | Packproblem | Packing problem | Operations Research | Operations research | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound |
-
Pitombeira-Neto, Anselmo Ramalho, (2020)
-
Ozturk, Onur, (2017)
-
A genetic algorithm for two-dimensional bin packing with due dates
Bennell, Julia A., (2013)
- More ...
-
A heuristic approach for the max-min diversity problem based on max-clique
Della Croce, Federico, (2009)
-
A single machine scheduling problem with two-dimensional vector packing constraints
Billaut, Jean-Charles, (2015)
-
MP or not MP : that is the question
Della Croce, Federico, (2016)
- More ...