On lower and upper bounds for single machine parallel batch scheduling.
Evgeny R. GafarovAlexandre DolguiPublished in: Optim. Lett. (2022)
Keyphrases
- single machine
- lower and upper bounds
- total weighted tardiness
- lagrangian relaxation
- scheduling problem
- identical machines
- lower bound
- upper bound
- processing times
- earliness tardiness
- release times
- scheduling jobs
- total tardiness
- minimize total
- maximum lateness
- competitive ratio
- setup times
- release dates
- sequence dependent setup times
- dynamic programming
- weighted tardiness
- rolling horizon
- weighted number of tardy jobs
- np hard
- parallel machines
- branch and bound
- number of late jobs
- single machine scheduling problem
- learning effect
- production scheduling
- valid inequalities
- itemsets
- parallel computing
- tabu search