Minimizing maximum cost for a single machine under uncertainty of processing times.
Ilia FridmanErwin PeschYakov M. ShafranskyPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- single machine
- processing times
- weighted number of tardy jobs
- number of tardy jobs
- scheduling problem
- total weighted tardiness
- completion times
- job processing times
- scheduling jobs
- release dates
- resource consumption
- earliness tardiness
- release times
- makespan minimization
- competitive ratio
- single machine scheduling problem
- polynomially solvable
- setup times
- learning effect
- dynamic programming
- sequence dependent setup times
- production scheduling
- identical machines
- minimum cost
- linear programming
- total cost
- expected cost
- column generation
- supply chain