On Computational Complexity of Pickup-and-Delivery Problems with Precedence Constraints or Time Windows.

Xing Tan Jimmy Xiangji Huang

Published in: IJCAI (2019)

Keyphrases

precedence constraints
computational complexity
np complete
vertex cover
scheduling problem
optimization problems
branch and bound algorithm
benchmark problems
parallel machines
cost function
single machine scheduling problem
release dates
precedence relations