Approximation algorithms for the min-max regret identical parallel machine scheduling problem with outsourcing and uncertain processing time.
Shijin WangWenli CuiPublished in: Int. J. Prod. Res. (2021)
Keyphrases
- approximation algorithms
- min max
- parallel machine scheduling problem
- worst case
- scheduling problem
- np hard
- precedence constraints
- release dates
- lower bound
- sequence dependent setup times
- maximum lateness
- total weighted tardiness
- minimum cost
- special case
- single machine
- parallel machines
- upper bound
- flowshop
- primal dual
- single machine scheduling problem
- greedy algorithm
- exact algorithms
- setup times
- linear programming
- genetic algorithm
- job shop scheduling problem
- combinatorial auctions
- reinforcement learning