Abstract
Pick-up and delivery operations in transportation tasks are usually performed using stacks. The Last-In-First-Out nature of stacks imposes restrictions to the order in which pick-ups and deliveries are performed. In this paper, we study the problem of determining the minimum number of stacks needed to perform given sequences of pick-up and delivery operations. We consider both, limited and unlimited capacity stacks and allow some transformations on the delivery route. These problems amount to computing the smallest bounded chromatic number in a family of permutation graphs. We study the worst cases of these problems.
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.
