A branch-and-bound algorithm for scheduling of new product development projects.
Mohammad RanjbarPublished in: Int. Trans. Oper. Res. (2013)
Keyphrases
- branch and bound algorithm
- development projects
- precedence constraints
- embedded software
- lower bound
- branch and bound
- upper bound
- np hard
- scheduling problem
- optimal solution
- release dates
- single machine scheduling problem
- project management
- software development
- development process
- combinatorial optimization
- active rules
- database development
- search algorithm
- upper bounding
- finding an optimal solution
- software projects
- project managers
- maximum lateness
- early stage
- databases
- database