Generating subproblems in branch and bound algorithms for parallel machines scheduling problem.
Sang-Oh ShimPublished in: Comput. Ind. Eng. (2009)
Keyphrases
- scheduling problem
- branch and bound algorithm
- parallel machines
- np hard
- precedence constraints
- lower bound
- lagrangian relaxation
- total tardiness
- flowshop
- optimal solution
- sequence dependent setup times
- earliness tardiness
- single machine
- unrelated parallel machines
- np complete
- setup times
- approximation algorithms
- minimize total
- single machine scheduling problem
- set covering problem
- weighted tardiness
- maximum lateness
- special case
- processing times
- job shop
- tabu search
- search tree
- single server
- knapsack problem
- computational complexity
- scheduling jobs
- integer programming
- constraint satisfaction problems
- upper bound
- boolean satisfiability
- job shop scheduling
- branch and bound
- release dates
- job shop scheduling problem
- open shop
- finding an optimal solution
- computer systems
- supply chain
- search space