An almost exact solution to the min completion time variance in a single machine.
Stefano NasiniRabia NessahPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- single machine
- exact solution
- scheduling problem
- processing times
- column generation
- minimize total
- total weighted tardiness
- maximum lateness
- exact algorithms
- total tardiness
- lower bound
- learning effect
- release dates
- earliness tardiness
- scheduling jobs
- rolling horizon
- release times
- single machine scheduling problem
- optimal solution
- production scheduling
- weighted number of tardy jobs
- dynamic programming
- approximate solutions
- setup times
- competitive ratio
- weighted tardiness
- number of late jobs
- branch and bound
- upper bound
- identical machines
- sequence dependent setup times
- completion times
- integer linear programming
- parallel machines
- flowshop
- deteriorating jobs
- np hard
- objective function