Maximum lateness minimization in one-dimensional bin packing
Year of publication: |
April 2017
|
---|---|
Authors: | Arbib, Claudio ; Marinelli, Fabrizio |
Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 0305-0483, ZDB-ID 124502-8. - Vol. 68.2017, p. 76-84
|
Subject: | One-dimensional bin packing | Scheduling | Mixed Integer programming | Integer reformulation | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem |
-
On cutting stock with due dates
Arbib, Claudio, (2014)
-
A branch-and-price algorithm for the bilevel network maintenance scheduling problem
Rey, David, (2019)
-
Sassi, Ons, (2017)
- More ...
-
An LP-based tabu search for batch scheduling in a cutting process with finite buffers
Arbib, Claudio, (2012)
-
An optimization model for trim loss minimization in an automotive glass plant
Arbib, Claudio, (2007)
-
Arbib, Claudio, (2005)
- More ...