1. Adelaide Research & Scholarship
  2. Schools and Disciplines
  3. School of Computer Science
  4. Computer Science publications
Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/112535
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPolyakovskiy, S.-
dc.contributor.authorM'Hallah, R.-
dc.date.issued2018-
dc.identifier.citationEuropean Journal of Operational Research, 2018; 266(3):819-839-
dc.identifier.issn0377-2217-
dc.identifier.urihttp://hdl.handle.net/2440/112535-
dc.description.abstractAbstract not available-
dc.description.statementofresponsibilitySergey Polyakovskiy, Rym M’Hallah-
dc.language.isoen-
dc.publisherElsevier-
dc.rights© 2017 Elsevier B.V. All rights reserved.-
dc.source.urihttp://dx.doi.org/10.1016/j.ejor.2017.10.046-
dc.subjectCutting; two-dimensional bin packing; batch scheduling; packing heuristic; lookahead search-
dc.titleA hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates-
dc.typeJournal article-
dc.identifier.doi10.1016/j.ejor.2017.10.046-
pubs.publication-statusPublished-
dc.identifier.orcidPolyakovskiy, S. [0000-0001-9489-1972]-
Appears in Collections:Aurora harvest 3
Computer Science publications

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.