Abstract
This paper deals with a stowage plan for containers in a container ship. Since the approach to the containers on board the ship is only from above, it is often the case that containers have to be shifted. Shifting is defined as the temporary removal from and placement back of containers onto a stack of containers. Our aim is to find a stowage plan that minimizes the shifting cost. We show that the shift problem is NP-complete. We also show a relation between the stowage problem and the coloring of circle graphs problem. Using this relation we slightly improve Unger's upper bound on the coloring number of circle graphs.
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.
