A comparison of lower bounds for the single-machine early/tardy problem.
Jeffrey E. SchallerPublished in: Comput. Oper. Res. (2007)
Keyphrases
- single machine
- lower bound
- scheduling problem
- competitive ratio
- maximum lateness
- processing times
- minimize total
- total weighted tardiness
- earliness tardiness
- total tardiness
- release times
- upper bound
- scheduling jobs
- weighted number of tardy jobs
- dynamic programming
- sequence dependent setup times
- np hard
- single machine scheduling problem
- production scheduling
- weighted tardiness
- release dates
- setup times
- rolling horizon
- branch and bound
- learning effect
- flowshop
- branch and bound algorithm
- number of late jobs
- objective function
- identical machines
- optimal solution