Beijing, 100084
China
Tsinghua University - Department of Mathematical Sciences
approximation algorithm, combination of optimization problems, flow shop scheduling, shortest path
Resource loading; Dynamic programming; NP-complete; Preemption; Approximation algorithms