Single Machine Scheduling to Maximize Number of Batch of Jobs with Uncertain Processing Times

Authors

Xingfang Zhang, School of Mathematical Sciences, Liaocheng University, Liaocheng 252059, ChinaFollow
Lingqiang Li, School of Mathematical Sciences, Liaocheng University, Liaocheng 252059, ChinaFollow
Guangwu Meng, School of Mathematical Sciences, Liaocheng University, Liaocheng 252059, ChinaFollow

Document Type

Article

Abstract

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.

Recommended Citation

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 (Xi'an, China). 13.
https://aisel.aisnet.org/iceb2012/13