The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints.
Haigeng WangAlexandru NicolauKai-Yeung SiuPublished in: IEEE Trans. Computers (1996)
Keyphrases
- resource constraints
- lower bound
- resource constrained
- upper bound
- resource constrained project scheduling problem
- temporal constraints
- objective function
- branch and bound algorithm
- resource availability
- project scheduling
- routing problem
- optimal solution
- np hard
- branch and bound
- bit parallel
- evolutionary algorithm
- vehicle routing problem
- benchmark problems
- spatial information
- image sequences
- genetic algorithm