Branch and bound and dynamic programming to minimize the total completion times on a single machine with availability constraints.
Imed KacemCherif SadfiAbdelkader El KamelPublished in: SMC (2005)
Keyphrases
- single machine
- branch and bound
- completion times
- dynamic programming
- scheduling problem
- branch and bound algorithm
- search algorithm
- processing times
- lower bound
- single machine scheduling problem
- release times
- column generation
- release dates
- optimal solution
- upper bound
- search space
- number of late jobs
- combinatorial optimization
- scheduling jobs
- shortest processing time
- learning effect
- setup times
- precedence constraints
- constraint satisfaction
- multistage
- np hard
- lagrangian relaxation
- weighted sum
- computational complexity
- lower and upper bounds
- integer program
- evolutionary algorithm
- optimal policy
- multi objective
- state space