The paper studies single-machine scheduling to maximize number of batch of jobs with uncertain processing times. Firstly, an expected value model to maximize number of batch of jobs processed is given based on uncertainty theory. Then, the model is transformed into a deterministic integer programming model and its properties are provided. Further, its arithmetic, called Man-computer Alternant Arithmetic, is presented. Finally, a numerical example on the model is given.
Zhang, Xingfang; Li, Lingqiang; and Meng, Guangwu, "Single Machine Scheduling to Maximize Number of Batch of Jobs with Uncertain Processing Times" (2012). ICEB 2012 Proceedings. 13.