A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert.
Reza Tavakkoli-MoghaddamGhasem MoslehiM. VaseiAmir AzaronPublished in: Appl. Math. Comput. (2006)
Keyphrases
- completion times
- branch and bound algorithm
- single machine scheduling problem
- single machine
- scheduling problem
- release times
- lower bound
- np hard
- release dates
- earliness tardiness
- precedence constraints
- branch and bound
- sequence dependent setup times
- processing times
- total weighted tardiness
- upper bound
- optimal solution
- maximum lateness
- minimize total
- lower bounding
- dominance rules
- combinatorial optimization
- lagrangian relaxation
- shortest processing time
- scheduling jobs
- setup times
- dynamic programming
- weighted number of tardy jobs
- number of late jobs
- np complete
- flowshop
- optimization problems
- weighted sum
- special case
- linear program
- deteriorating jobs