Sensitivity analysis in the single-machine scheduling problem with max-min criterion.
Stefan ChanasAdam KasperskiPublished in: Int. Trans. Oper. Res. (2005)
Keyphrases
- sensitivity analysis
- max min
- single machine scheduling problem
- min max
- branch and bound algorithm
- processing times
- managerial insights
- single machine
- hill climbing
- robust optimization
- influence diagrams
- precedence constraints
- resource consumption
- combinatorial optimization
- search procedure
- scheduling problem
- decision making
- lagrangian relaxation
- artificial neural networks
- branch and bound
- evolutionary algorithm
- search space