A branch and bound algorithm for single machine scheduling with deteriorating values of jobs.
Theodore G. VoutsinasCostas P. PappisPublished in: Math. Comput. Model. (2010)
Keyphrases
- branch and bound algorithm
- precedence constraints
- single machine scheduling problem
- lower bound
- release dates
- branch and bound
- upper bound
- lower bounding
- np hard
- optimal solution
- maximum lateness
- sequence dependent setup times
- setup times
- combinatorial optimization
- deteriorating jobs
- release times
- completion times
- variable ordering
- randomly generated problems
- lagrangian relaxation
- upper bounding
- scheduling problem
- integer variables
- strongly np hard
- processing times
- branch and bound method
- dominance rules
- objective function
- mixed integer linear programming
- parallel machines
- genetic algorithm
- max sat
- lower and upper bounds
- integer programming
- metaheuristic
- finding an optimal solution