A branch-and-bound algorithm for the single-machine weighted earliness-tardiness scheduling problem with job independent weights.
Shunji TanakaTaku SasakiMituhiko ArakiPublished in: SMC (2003)
Keyphrases
- earliness tardiness
- single machine
- shortest processing time
- single machine scheduling problem
- scheduling problem
- branch and bound algorithm
- completion times
- processing times
- precedence constraints
- release dates
- np hard
- weighted sum
- maximum lateness
- total weighted tardiness
- flowshop
- sequence dependent setup times
- lower bound
- setup times
- branch and bound
- dominance rules
- upper bound
- combinatorial optimization
- optimal solution
- parallel machines
- scheduling jobs
- production scheduling
- objective function
- identical parallel machines
- identical machines
- search algorithm
- tabu search
- job processing times