Tight complexity analysis of the relocation problem with arbitrary release dates
Under an Elsevier user license
open archive
Keywords
Relocation problem
Resource constraints
Release dates
Makespan
NP-hardness
Multi-parametric dynamic programming
Cited by (0)
Copyright © 2011 Elsevier B.V.