Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/112535
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPolyakovskiy, S.en
dc.contributor.authorM'Hallah, R.en
dc.date.issued2018en
dc.identifier.citationEuropean Journal of Operational Research, 2018; 266(3):819-839en
dc.identifier.issn0377-2217en
dc.identifier.urihttp://hdl.handle.net/2440/112535-
dc.description.abstractAbstract not availableen
dc.description.statementofresponsibilitySergey Polyakovskiy, Rym M’Hallahen
dc.language.isoenen
dc.publisherElsevieren
dc.rights© 2017 Elsevier B.V. All rights reserved.en
dc.subjectCutting; two-dimensional bin packing; batch scheduling; packing heuristic; lookahead searchen
dc.titleA hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due datesen
dc.typeJournal articleen
dc.identifier.rmid0030078578en
dc.identifier.doi10.1016/j.ejor.2017.10.046en
dc.identifier.pubid389251-
pubs.library.collectionComputer Science publicationsen
pubs.library.teamDS10en
pubs.verification-statusVerifieden
pubs.publication-statusPublisheden
dc.identifier.orcidPolyakovskiy, S. [0000-0001-9489-1972]en
Appears in Collections: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.