Abstract
In this work we address the orthogonal non-oriented two-dimensional bin packing problem where items are equipped with due-dates and the bi-objective function takes into account both the number of used bins and the maximum lateness of items. We propose a sequential value correction heuristic that outperforms the benchmark algorithm specifically designed for the same problem, and we finally give some insight on the structure of the Pareto-optimal sets of the considered classes of instances.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
