Measuring the slack between lower bounds for scheduling on parallel machines.
Jacques CarlierClaire HanenPublished in: Ann. Oper. Res. (2024)
Keyphrases
- parallel machines
- lower bound
- scheduling problem
- unrelated parallel machines
- upper bound
- precedence constraints
- sequence dependent setup times
- minimize total
- total tardiness
- release dates
- np hard
- weighted tardiness
- maximum lateness
- massively parallel
- branch and bound algorithm
- single machine
- parallel computing
- branch and bound
- objective function
- scheduling jobs
- worst case
- setup times
- lower and upper bounds
- flowshop
- competitive ratio
- optimal solution
- strongly np hard
- lot sizing
- tabu search
- open shop
- linear programming