What are the worst cases in constrained Last-In-First-Out pick-up and delivery problems?

•We consider Last-In-First-Out constrained pick-up and delivery transportation tasks.•We determine the minimum number of stacks needed in the worst case scenarios.•Some simple operations are allowed to be executed over the delivery route.•We formalize the problem in graph theoretical terms.•For each...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 270; no. 2; pp. 430 - 434
Main Authors:	Urrutia, Sebastián, de Werra, Dominique
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16-10-2018
Subjects:	Bounded chromatic number Combinatorial optimization Permutation graphs Pick-up and delivery Permutation graphs Bounded chromatic number Combinatorial optimization Pick-up and delivery
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!