Minimizing conditional-value-at-risk for stochastic scheduling problems.
Subhash C. SarinHanif D. SheraliLingrui LiaoPublished in: J. Sched. (2014)
Keyphrases
- scheduling problem
- single machine
- np hard
- completion times
- flowshop
- job shop
- tabu search
- processing times
- setup times
- list scheduling
- precedence constraints
- job shop scheduling
- earliness tardiness
- np complete
- sequencing problems
- parallel machines
- limited capacity
- stochastic nature
- job shop scheduling problem
- information systems
- monte carlo
- optimization problems
- artificial neural networks