A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs.
M. Duran ToksariPublished in: Comput. Oper. Res. (2011)
Keyphrases
- minimizing makespan
- release times
- deteriorating jobs
- single machine
- learning effect
- branch and bound algorithm
- scheduling problem
- np hard
- precedence constraints
- single machine scheduling problem
- maximum tardiness
- lower bound
- flowshop
- maximum lateness
- branch and bound
- processing times
- release dates
- optimal solution
- tabu search
- setup times
- upper bound
- parallel machines
- scheduling jobs
- special case
- combinatorial optimization
- sequence dependent setup times
- approximation algorithms
- lagrangian relaxation
- computational complexity
- integer programming
- completion times
- linear programming
- learning curve
- column generation
- objective function
- optimization problems