[1] Epstein L. A survey on makespan minimization in semi-online environments[J]. Journal of Scheduling, 2018, 21(3):269-284. [2] 唐国春, 井彩霞. 现代排序论应用[J]. 自然杂志, 2015, 37(2):115-120. [3] Cheng Bayi, Yang Shanlin, Hu Xiaoxuan, et al. Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes[J]. Applied Mathematical Modelling, 2012, 36(7):3161-3167. [4] Chung S H, Tai Y T, Pearn W L. Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes[J]. International Journal of Production Research, 2007, 47(18):5109-5128. [5] Li Shuguang. Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan[J]. European Journal of Operational Research, 2017, 260(1):12-20. [6] Wang Junqiang, Leung J Y T. Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan[J]. International Journal of Production Economics, 2014, 156:325-331. [7] 李小林. 平行机环境下批处理机调度问题研究[D]. 合肥:中国科学技术大学, 2012. [8] Hou Y T, Yang D L, Kou W H. Lot scheduling on a single machine[J]. Information Processing Letters, 2014, 114:718-722. [9] Santo C, Magazine M. Batching in single operation manufacturing systems[J]. Operation Research Letters, 1985, 4:99-103. [10] Yang D L, Hou Y T, Kuo W H. A note on a single-machine lot scheduling problem with indivisible orders[J].Computers & Operations Research, 2017, 79:34-38. [11] Li Wenhua, Zhang Zhenkun, Yang Sufang. Online algorithms for scheduling unit length jobs on parallel batch machines with lookahead[J]. Information Processing Letters, 2012, 112(7):292-297. [12] Ma Ran, Wan Long, Wei Lijun, et al. Online bounded-batch scheduling to minimize total weighted completion time on parallel machines[J]. International Journal of Production Economics, 2014, 156:31-38. [13] Borodin A, El-Yaniv R. Online computation and competitive analysis[M]. Cambridge:Cambridge University Press, 2005. |