[1] Haskose A, Kinsman B G, Worthington D. Modelling flow and jobbing shops as a queueing network for workload control [J]. International Journal of Production Economics, 2002, 78(3): 271-285.
[2] Sumita U, Masuda Y, Yamakawa S. Optimal internal pricing and capacity planning for service facility with finite buffer [J].European Journal of Operational Research, 2001, 128(1): 192-205.
[3] Yamashita H, Suzuki S. An approximate solution method for optimal buffer allocation in serial nstage automatic production lines [J]. Transactions of Japan Science Mechanical Engineering (Serial C), 1987, 53(487): 807-814.
[4] Yamashita H, Onvural R O. Allocation of buffer capacities in queueing networks with arbitrary topologies [J]. Annals of Operations Research, 1994, 48(4): 313-332.
[5] Singh A, Smith J M. Buffer allocation for an integer nonlinear network design problem [J].Computers & Operations Research, 1997, 24(5): 453-472.
[6] 陈田, 陈庆新, 毛宁, 等. 具有两道工序的柔性同序加工车间任务投放策略[J]. 工业工程, 2010, 13(5): 69-74.
Chen Tian, Chen Qing-xin, Mao Ning, et al. Study on the strategy of Job release for to-stage flexible flow shop [J].Industrial Engineering Journal, 2010, 13(5): 69-74.
[7] Haskose A, Kingsman B G, Worthington D. Performance analysis of make-to-order manufacturing systems under different workload control regimes [J]. International Journal of Production Economics, 2004, 90(2): 169-186.
[8] Kincaid D, Cheney W. 数值分析[M]. 北京: 机械工业出版社, 2005: 170-172.
[9] Cruz F R B, Duarte A R van, Woensel T. Buffer allocation in general singleserver queueing networks [J]. Computers & Operations Research, 2008,35(11): 3581-3598.
[10]Kerbache L, Smith J M. Asymptotic behavior of the expansion method for open finite queueing networks [J]. Computers & Operations Research, 1988, 15(2): 157-169.
[11]Smith J M, Cruz F R B. The buffer allocation problem for general finite buffer queueing networks [J]. IIE Transactions, 2005, 37(4): 343-365. |