Abstract
We study the problem of sequencing trucks subject to handover relations. The objective is to minimize the total time pallets spend at the terminal. It has been shown that the problem is strongly NP-hard for two doors or with unrelated (un)loading durations. We show that it is strongly NP-hard even for a single door and (un)loading durations of trucks being proportional to the number of pallets (un)loaded.
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.
