Single machine scheduling under uncertainty processing time with CVAR constraints
A novel framework based on conditional value-atrisk theory has been applied to the celebrated single-machine scheduling problems under processing time uncertainty. A case study was conducted to demonstrate the viability of the proposed approach, which involves the novel application of conditional value-at-risk theory to the problem. A comparative study that juxtaposes the proposed model and the CVAR criterion model presented in 1 is introduced as well.
Single-machine scheduling total tardiness cost stochastic processing times conditional value-at-risk stochastic programming
Xiaoxia HE Huan LI Qiuhua TANG
College of Scicence, Wuhan University of Science and Technology, Wuhan, Peoples Republic of China College of Machinery and Automation Wuhan University of Science and Technology, Wuhan, Peoples Repu
国际会议
秦皇岛
英文
1824-1827
2015-09-18(万方平台首次上网日期,不代表论文的发表时间)