[1]PEZZELLA F, MERELLI E. A tabu search method guided by shifting bottleneck for the job shop scheduling problem[J]. European Journal of Operational Research, 2000,120(2): 297-310.
[2]CROCE F D, et al. An improved general procedure for lexicographic bottleneck problems[J]. Operation Research Letters, 1999, 24(4):187-194.
[3]SOKKALINGAM P T, ANEJA Y P. Lexicographic bottleneck combinatorial problems[J]. Operation Research Letters, 1998,23(1-2):27-33.
[4]KATAGIRI H, ISHII H. Chance constrained bottleneck spanning tree problem with fuzzy random edge Costs[J]. Journal of the Operations Research Society of Japan,2000, 43(1): 128-137.
[5]ARNOTT R, PALMA A D, LINDSEY R. Information and time-of-usage decisions in the bottleneck model with stochastic capacity and demand[J]. European Economic Review,1999, 43(3):525-548.
[6]ANEJA Y P, PUNNEN A P. Multiple bottleneck assignment problem[J]. European Journal of Operational Reearch,1999,112(1):167-173.
[7]GOLDBERG A V,PLOTKIN S A, et al. Algorithms for the generalized circulation problem[J]. Mathematics of Operation Research, 1991, 16(2):351-381.
[8]REKLAITIS G V. Overview of scheduling and planning of batch process operations[A].NATO ASI Batch Processing Systems Engineering[C].Turkey:Antalya,1992: 660-705.
[9]AHUJA R K, MAGNANTI T L, ORLIN J B. Network flows theory, algorithm,and applications[M]. Englewood Cliffs, N.J.: Prentice Hall, 1993.
[10]江永亨,金以慧.一般环流过程瓶颈分析[J].系统工程理论与实践,2002,22(3):46-50.
[11]王军.流程工业的过程瓶颈分析及生产调度问题的研究[D].北京:清华大学,1998.
[12]江永亨,金以慧.基于最优生成树结构的过程瓶颈分析[J].自动化学报(增刊B), 2000: 71-75.
|