Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates.
Rabia NessahImed KacemPublished in: Comput. Oper. Res. (2012)
Keyphrases
- single machine
- release dates
- scheduling problem
- minimize total
- completion times
- processing times
- maximum lateness
- flowshop
- sequence dependent setup times
- total weighted tardiness
- earliness tardiness
- scheduling jobs
- single machine scheduling problem
- precedence constraints
- setup times
- makespan minimization
- np hard
- mixed integer programming
- parallel machines
- job shop scheduling problem
- branch and bound algorithm
- job processing times
- tabu search
- branch and bound
- state space
- search algorithm