Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty.
Byung-Cheon ChoiKwanghun ChungPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- min max
- scheduling problem
- multiobjective optimization
- np hard
- single machine
- max min
- minimax regret
- tabu search
- flowshop
- decision making
- information technology
- lower bound
- decision makers
- setup times
- online learning
- worst case
- parallel machines
- minimizing makespan
- service providers
- information systems
- permutation flowshop
- precedence constraints
- uncertain data
- decision process
- processing times
- search algorithm
- knowledge about the world