Improved lower bounds for online scheduling to minimize total stretch.
Koji M. KobayashiPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- minimize total
- lower bound
- single machine
- weighted tardiness
- release dates
- parallel machines
- total cost
- online algorithms
- scheduling problem
- upper bound
- branch and bound algorithm
- precedence constraints
- processing times
- flowshop
- worst case
- objective function
- training data
- metaheuristic
- single machine scheduling problem
- np hard
- optimal solution