Approximation schemes for two-agent scheduling on parallel machines
Under an Elsevier user license
open archive
Keywords
Agent scheduling
Parallel machines
Algorithm
Dynamic programming
Fully polynomial time approximation scheme
Cited by (0)
Copyright © 2012 Elsevier B.V. All rights reserved.