Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound.
Walter J. GutjahrA. HellmayrGeorg Ch. PflugPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- single machine
- scheduling problem
- branch and bound
- minimize total
- release dates
- scheduling jobs
- maximum lateness
- release times
- processing times
- single machine scheduling problem
- branch and bound algorithm
- optimal solution
- weighted tardiness
- competitive ratio
- sequence dependent setup times
- total weighted tardiness
- setup times
- dynamic programming
- search algorithm
- parallel machines
- number of tardy jobs
- np hard
- lower bound
- search space
- combinatorial optimization
- identical machines
- shortest processing time
- strongly np hard
- completion times
- tabu search
- flowshop
- upper bound
- deteriorating jobs
- total cost
- column generation
- job shop
- worst case
- monte carlo