Adelaide Research & Scholarship
Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/112535
| Citations | ||
| Scopus | Web of Science® | Altmetric |
|---|---|---|
|
?
|
?
|
|
| Type: | Journal article |
| Title: | A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates |
| Author: | Polyakovskiy, S. M'Hallah, R. |
| Citation: | European Journal of Operational Research, 2018; 266(3):819-839 |
| Publisher: | Elsevier |
| Issue Date: | 2018 |
| ISSN: | 0377-2217 |
| Statement of Responsibility: | Sergey Polyakovskiy, Rym M’Hallah |
| Abstract: | Abstract not available |
| Keywords: | Cutting; two-dimensional bin packing; batch scheduling; packing heuristic; lookahead search |
| Rights: | © 2017 Elsevier B.V. All rights reserved. |
| DOI: | 10.1016/j.ejor.2017.10.046 |
| Published version: | http://dx.doi.org/10.1016/j.ejor.2017.10.046 |
| Appears in Collections: | Aurora harvest 3 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.