单元物料订单分拣轮询控制系统研究
|
摘要
在大生产、大市场、大流通、大消费的背景下,我国国民经济多个行业已经呈现出规模经济的特征。但是,传统的“层层批发”的流通体制存在诸多弊端,生产者与消费者之间的信息不畅,在一定程度上影响了经济发展质量,所以,需要建设物流配送中心,进行流通体制的变革,同时满足规模经济发展的需要。
物流配送中心的核心业务是订单分拣,分拣的效率直接影响物流配送中心的效率,分拣作业分拣的速度越快,订单就会迅速地生产出来,货物就能更早地送达客户手中,客户的满意度就能提高。规模经济背景下,订单数量的巨大化,形成了高效率订单分拣控制的复杂系统难题。深入研究订单分拣的控制机理,对于开发研制高效率的自动化分拣设备、提高物流配送中心的作业效率、提高物流配送中心对客户需求的响应速度、提高服务水平、降低物流成本具有重要意义。
轮询为系统资源的合理配置提供了非竞争的访问控制机制,有效避免介入对象间的竞争冲突,特别在高负载情况下,轮询能够共享资源的利用率得到有效提高,例如在通讯与信息领域,为了增强网络控制能力,每个通信终端均有接入信道的机会,达到不同业务数据传输延迟的要求,应用线路共享和资源共享相结合的轮询多址通信系统分析方法,对信息流进行深入的研究,并将研究成果应用到实际问题中,对有线和无线网络系统资源进行有效分配、管理和调度,解决了通讯与信息领域内高度关注的许多热点和难点问题。物流是一种实物流,和信息流的性质具有高度的相似性。信息流通过通讯线缆进行传输活动,物流则通过以专门的物流设施为载体,在专门的通道上进行传输运动；信息流微观,物流宏观。物流中的订单分拣问题,实质也是一种设施共享和资源分配问题。本文研究将单元物料订单分拣系统视为动态分拣系统,用研究信息流的轮询理论方法研究物流中的订单分拣问题,研究订单分拣的轮询控制机理,构建出多种控制策略的系统数学模型,精确求解相应系统的特性参数,探索对自动化分拣设备开发和控制新思路。
本学位论文进行了下列几方面的创新性研究工作：
一是研究了配送中心的集成基础、设施及分拣工艺,论述单元物料订单VC(Virtual Container, VC,虚拟容器)思想及其过程控制指标,划分单元物料订单VC队列的到达过程、分拣机的服务过程和分拣机对各个VC的分拣转换过程,将门限、完全、限定(k=1)控制策略引入订单的分拣过程,建立相应的数学分析模型,在相应的约束条件和系统稳定的条件下,精确求解出其一阶系统特性分析(如平均排队队长、平均查询周期)、二阶系统特性分析。
二是基于物流配送的差异化服务,创新地将单元物料订单VC队列划分为两级,即一个优先队列和低优先级的多个普通队列,考虑分拣过程的优先服务和公平性服务,创新地提出了优先订单和普通订单分拣策略控制的两级并行轮询服务方式——订单分拣完全-并行门限轮询控制系统和订单分拣双完全并行门限轮询控制系统,并将订单分拣完全并行-限定(k=1)二级轮询控制系统应用于单元物料的订单分拣服务控制中,要求既确保分拣优先业务的订单顾客得到更优质的QoS (Quality of Service),也充分考虑到普通订单分拣的服务公平性,分别建立了系统状态变量的概率母函数,对优先订单队列和普通订单队列的平均等待队长、平均运行周期和平均等待时延等技术指标进行数学求解,并进行数值计算比较分析。
三是优先轮询控制机理在订单分拣系统集成中的拓展应用问题。研究主动轮询与被动随机的混合访销订单采集系统的设计,研究其结构模式和实现方法；研究基于完全-并行门限轮询控制机制的组合分拣线模型及其系统特性,并与常见的、基于随机控制的组合分拣机进行成本比较；采用双完全并行轮询服务机理控制,研究电子商务线上订单和线下订单的分拣问题；研究配送中心多分拣线的完全-并行限定(k=1)优先调度轮询控制模型,给出双到达率的优先分拣线的调度控制母函数,求出相应的特性参数,并进行数值计算分析。
Under the background of mass production, big market, big circulation and big consumption, China's national economy has shown characters of scale economies. However, the traditional "wholesale layers" of the circulation system has many shortcomings, information between poor producers and consumers, to a certain extent, affects the quality of economic development. Therefore, to build logistics distribution center for circulation system change is required, while it can meet the needs of the development under economics of the scale.
Core business of the distribution center is order picking, and sorting efficiency affects the one of whole logistics distribution center directly, the faster sorting operations, the quicker orders will be produced, goods can be earlier to deliver to the customers, and satisfaction of customer can be improved.Under the background of economies of scale, the huge number of orders informs the complex systems problems for highly efficient order picking control. In-depth study of the control mechanism of order picking can be meaningful to develop the highly efficient automated sorting equipment, also improve the efficiency of logistics distribution center operations, improve the response speed of customer needs for logistics distribution center, and the service levels, while it can reduce the costs of logistics.
The theory of polling provides a non-competitive access control mechanisms for rational allocation of system resources, and also an effective way to avoid conflicts between the objects involved in the competition. Especially under the high load conditions, polling can improve the utilization of the shared resources effectively. For example, in the field of communications and information network, in order to enhance the capability of control, every communication terminal has chance to access channel, to achieve the transmission delay requirements of multiple service data. By using polling multiple access communication system analysis method which is application sharing and resource sharing circuit combining to in-depth study the flow of information, also applicate research results into practical problems, effectively to allocate, manage and schedule the resource of wired and wireless network systems, which also solves lots of hot and complex issues for great concern in the field of communications and information.The flow of information is a concept of microscopic, while the logistics is concept of macro. Order picking in logistics is a kind of facility sharing and resource allocation problems in essence.
This paper studies the order picking system of the unit material as a dynamic sorting system, using the theory of polling to study the problems in sorting orders of logistics, also the polling mechanism of controlling, by building the mathematical model of variety control strategies, to make the exact solution of the corresponding system parameters, to explore the development of automated sorting equipments and new ideas for controlling.
This dissertation has carried on the innovative research work of the following aspects:
First, the study of the integrated basic distribution centers, facilities and sorting process, discusses VC (Virtual Container, VC, virtual container) thought and process control indicators of the unit material orders, devides the process of cell division to reach the material orders VC queue, service processes of sorting machines and the sorting conversion process for each VC of sorting machines, makes given threshold, complete, qualified (k=1) control strategy into the sorting process, builds the corresponding mathematical analysis model, and gives the exact solution of the first-order system characteristic analysis (such as average queue length, average polling period), the second-order system characterization under the corresponding constraints the system stable conditions.
Second, based on the differences of the logistics distribution services, divide VC queue of unit material into two levels which is an innovation, a priority queue, and the low priority common queue. Considering sorting priority service and fairness of the process, this paper innovately proposed the priority order and the general order sorting strategy to control two levels of parallel polling services-order sorting-parallel threshold polling control system completely and order sorting double parallel threshold polling control system completely, and the order sorting fully parallel- limited (k=1) secondary polling control system used in the unit material order sorting Service control. Requirement a priority is to ensure that the sorting order of preferred business customers get better QoS (Quality of Service), but also give full consideration to the service order picking of common equity, probability generating function are established system state variables, the average queue waiting for orders and the general order of priority queues captain, average operating cycle and the average waiting time for solving mathematical and other technical indicators and comparative analysis of the numerical calculations.
Third, the preferred polling control mechanism in order sorting system integration as the development of application problems. Research on Active and passive polling hybrid sales visits random order acquisition system design, research and implementation of its structural pattern; Based entirely a combination of parallel sorting line threshold polling model and system characteristics control mechanism, and with the common, which is based on a combination of randomized controlled sorter cost comparison; Sorting issue orders under study online e-commerce orders and lines, dual control mechanism fully parallel polling services; Research sorting line distribution centers and more fully-qualified parallel (k=1) priority scheduling polling control model, give out the priority sorting line dual arrival rate of scheduling control generating function, find the appropriate parameters, and give out the numerical analysis.
物流配送中心的核心业务是订单分拣,分拣的效率直接影响物流配送中心的效率,分拣作业分拣的速度越快,订单就会迅速地生产出来,货物就能更早地送达客户手中,客户的满意度就能提高。规模经济背景下,订单数量的巨大化,形成了高效率订单分拣控制的复杂系统难题。深入研究订单分拣的控制机理,对于开发研制高效率的自动化分拣设备、提高物流配送中心的作业效率、提高物流配送中心对客户需求的响应速度、提高服务水平、降低物流成本具有重要意义。
轮询为系统资源的合理配置提供了非竞争的访问控制机制,有效避免介入对象间的竞争冲突,特别在高负载情况下,轮询能够共享资源的利用率得到有效提高,例如在通讯与信息领域,为了增强网络控制能力,每个通信终端均有接入信道的机会,达到不同业务数据传输延迟的要求,应用线路共享和资源共享相结合的轮询多址通信系统分析方法,对信息流进行深入的研究,并将研究成果应用到实际问题中,对有线和无线网络系统资源进行有效分配、管理和调度,解决了通讯与信息领域内高度关注的许多热点和难点问题。物流是一种实物流,和信息流的性质具有高度的相似性。信息流通过通讯线缆进行传输活动,物流则通过以专门的物流设施为载体,在专门的通道上进行传输运动；信息流微观,物流宏观。物流中的订单分拣问题,实质也是一种设施共享和资源分配问题。本文研究将单元物料订单分拣系统视为动态分拣系统,用研究信息流的轮询理论方法研究物流中的订单分拣问题,研究订单分拣的轮询控制机理,构建出多种控制策略的系统数学模型,精确求解相应系统的特性参数,探索对自动化分拣设备开发和控制新思路。
本学位论文进行了下列几方面的创新性研究工作：
一是研究了配送中心的集成基础、设施及分拣工艺,论述单元物料订单VC(Virtual Container, VC,虚拟容器)思想及其过程控制指标,划分单元物料订单VC队列的到达过程、分拣机的服务过程和分拣机对各个VC的分拣转换过程,将门限、完全、限定(k=1)控制策略引入订单的分拣过程,建立相应的数学分析模型,在相应的约束条件和系统稳定的条件下,精确求解出其一阶系统特性分析(如平均排队队长、平均查询周期)、二阶系统特性分析。
二是基于物流配送的差异化服务,创新地将单元物料订单VC队列划分为两级,即一个优先队列和低优先级的多个普通队列,考虑分拣过程的优先服务和公平性服务,创新地提出了优先订单和普通订单分拣策略控制的两级并行轮询服务方式——订单分拣完全-并行门限轮询控制系统和订单分拣双完全并行门限轮询控制系统,并将订单分拣完全并行-限定(k=1)二级轮询控制系统应用于单元物料的订单分拣服务控制中,要求既确保分拣优先业务的订单顾客得到更优质的QoS (Quality of Service),也充分考虑到普通订单分拣的服务公平性,分别建立了系统状态变量的概率母函数,对优先订单队列和普通订单队列的平均等待队长、平均运行周期和平均等待时延等技术指标进行数学求解,并进行数值计算比较分析。
三是优先轮询控制机理在订单分拣系统集成中的拓展应用问题。研究主动轮询与被动随机的混合访销订单采集系统的设计,研究其结构模式和实现方法；研究基于完全-并行门限轮询控制机制的组合分拣线模型及其系统特性,并与常见的、基于随机控制的组合分拣机进行成本比较；采用双完全并行轮询服务机理控制,研究电子商务线上订单和线下订单的分拣问题；研究配送中心多分拣线的完全-并行限定(k=1)优先调度轮询控制模型,给出双到达率的优先分拣线的调度控制母函数,求出相应的特性参数,并进行数值计算分析。
Under the background of mass production, big market, big circulation and big consumption, China's national economy has shown characters of scale economies. However, the traditional "wholesale layers" of the circulation system has many shortcomings, information between poor producers and consumers, to a certain extent, affects the quality of economic development. Therefore, to build logistics distribution center for circulation system change is required, while it can meet the needs of the development under economics of the scale.
Core business of the distribution center is order picking, and sorting efficiency affects the one of whole logistics distribution center directly, the faster sorting operations, the quicker orders will be produced, goods can be earlier to deliver to the customers, and satisfaction of customer can be improved.Under the background of economies of scale, the huge number of orders informs the complex systems problems for highly efficient order picking control. In-depth study of the control mechanism of order picking can be meaningful to develop the highly efficient automated sorting equipment, also improve the efficiency of logistics distribution center operations, improve the response speed of customer needs for logistics distribution center, and the service levels, while it can reduce the costs of logistics.
The theory of polling provides a non-competitive access control mechanisms for rational allocation of system resources, and also an effective way to avoid conflicts between the objects involved in the competition. Especially under the high load conditions, polling can improve the utilization of the shared resources effectively. For example, in the field of communications and information network, in order to enhance the capability of control, every communication terminal has chance to access channel, to achieve the transmission delay requirements of multiple service data. By using polling multiple access communication system analysis method which is application sharing and resource sharing circuit combining to in-depth study the flow of information, also applicate research results into practical problems, effectively to allocate, manage and schedule the resource of wired and wireless network systems, which also solves lots of hot and complex issues for great concern in the field of communications and information.The flow of information is a concept of microscopic, while the logistics is concept of macro. Order picking in logistics is a kind of facility sharing and resource allocation problems in essence.
This paper studies the order picking system of the unit material as a dynamic sorting system, using the theory of polling to study the problems in sorting orders of logistics, also the polling mechanism of controlling, by building the mathematical model of variety control strategies, to make the exact solution of the corresponding system parameters, to explore the development of automated sorting equipments and new ideas for controlling.
This dissertation has carried on the innovative research work of the following aspects:
First, the study of the integrated basic distribution centers, facilities and sorting process, discusses VC (Virtual Container, VC, virtual container) thought and process control indicators of the unit material orders, devides the process of cell division to reach the material orders VC queue, service processes of sorting machines and the sorting conversion process for each VC of sorting machines, makes given threshold, complete, qualified (k=1) control strategy into the sorting process, builds the corresponding mathematical analysis model, and gives the exact solution of the first-order system characteristic analysis (such as average queue length, average polling period), the second-order system characterization under the corresponding constraints the system stable conditions.
Second, based on the differences of the logistics distribution services, divide VC queue of unit material into two levels which is an innovation, a priority queue, and the low priority common queue. Considering sorting priority service and fairness of the process, this paper innovately proposed the priority order and the general order sorting strategy to control two levels of parallel polling services-order sorting-parallel threshold polling control system completely and order sorting double parallel threshold polling control system completely, and the order sorting fully parallel- limited (k=1) secondary polling control system used in the unit material order sorting Service control. Requirement a priority is to ensure that the sorting order of preferred business customers get better QoS (Quality of Service), but also give full consideration to the service order picking of common equity, probability generating function are established system state variables, the average queue waiting for orders and the general order of priority queues captain, average operating cycle and the average waiting time for solving mathematical and other technical indicators and comparative analysis of the numerical calculations.
Third, the preferred polling control mechanism in order sorting system integration as the development of application problems. Research on Active and passive polling hybrid sales visits random order acquisition system design, research and implementation of its structural pattern; Based entirely a combination of parallel sorting line threshold polling model and system characteristics control mechanism, and with the common, which is based on a combination of randomized controlled sorter cost comparison; Sorting issue orders under study online e-commerce orders and lines, dual control mechanism fully parallel polling services; Research sorting line distribution centers and more fully-qualified parallel (k=1) priority scheduling polling control model, give out the priority sorting line dual arrival rate of scheduling control generating function, find the appropriate parameters, and give out the numerical analysis.
引文
[1]艾瑞咨询.2013年度中国B2C电子商务市场调查报告,2014年2月.
[2]Jeroen P.van den Berg. A literature survey on planning and control of warehousing system[J]. IEE Transactions,1999,31 (8):751-762.
[3]C. Mack. The efficiency of N machines uni-directionally patrolled by one operative when walking time is constant and repair times are variable[J]. Journal of the Royal Statistical Society Series B 19 (1), 1957:173-178.
[4]D. V. Lindley. The theory of queues with a single server[J]. In Proc. Cambridge Phil. Soc.,1952, 48:277-289.
[5]Pan J C-H, Wu M-H. A study of storage assignment problem for an order picking line in a pick-and-pass warehousing system[J]. Computers & Industrial Engineering,2009,57 (1):261-268.
[6]Tompkins J. A.White J. A., Bozer Y. A., Frazelle E. H. and Tanehoeo J. M. A. Facilities Planning
(NJ:John Wiley & Sons),2003.
[7]Goetschalckx M.and Ashayeri J.Classification and design of order Picking systems. Logistics World,1989, June,99-106.
[8]Rene de Koster, Edo van der Poort. Routing order pickers in a warehouse:A Comparison between optimal and heuristic solutions[J].IIE Transactions,1998,30 (5):468-480.
[9]C. G. Petersen, G. Aase. A comparison of picking, storage, and routing policies in manual order picking[J]. Int. J. production Economics.2004,92:11-19.
[10]Heskett J. L. Cube-Per-order index:A key to warehouse stock location[J]. Transport and Distribution Management,1963,3 (4):27-31.
[11]Kallina C., Lynn J. Application of the cube-per-order index rule for stock ocation in a distribution warehouse[J]. Interfaces,1976,7 (1):37-46.
[12]Hausman W. H., Schwarz L. B., Graves S. C. Optimal storage assignment in automatic warehousing systems [J]. Management Science,1976,22 (6):629-638.
[13]Bassan Y.Roll Y. And Rosenblatt M.J.Internal layout design of a warehouse[J]. IIE Transactions, 1980,12 (4):317-322.
[14]Rosenblat M. J. and Roll Y. Warehouse capaeity in a stochastic enviroriment[J]. International Journal of Production Researeh,1988,26 (12):1847-1851.
[15]Roodbergen K. J.Layout and routing methods for warehouses[D]. ph.D. Thesis, Erasmus Research Institute of Management (ERIM),2001.
[16]Caron F., Marehet G.and Perego A.Optimal layout in low-level picker-to-part systems[J]. International Journal of Production Research,2000,38 (1):101-117.
[17]Tho Le-Due. Design and control of efficient order picking proeesses[D]. Ph. D. Thesis, Erasmus University Rotterdam,2005.
[18]Petersen C. G. Considerations in order picking zone configuration[J].International Journal of Operations & Production Management,2002,27 (7):793-805.
[19]Bozer YA. And White J. A..Travel-time models for automated storage/retrieval systems[J]. IIE Transactions,1984,16:329-338.
[20]Kitaoka M.Nabeta T.Nakamura R. et al. EIQNK curve analysis for the design of distribution center and warehouse with spline function[J]. Computers & Industrial Engineering,1996,31 (3/4): 634-636.
[21]Hackman S. T. and Rosenblatt M. J.. Allocating items to an automated storage and retrieval system[J]. IIE Transactions,1990,22 (1):7-14.
[22]Frazelle E. H., Hackman, S. T.Passy U. and Platzman L. K., Eds.. The forward-reserve problem. Optimization in Industry 2, NewYork, John Wiley & Sons Ltd.1994.
[23]Van den Berg J. P.Sharp G. P.Gademann A. J. R. M. N. And Pochet Y. Forward-reserve allocation in a warehouse with unit-load replenishments [J]. European Journal of Operational Researeh,1998,111: 98-113.
[24]Chin Chia Jane. Storage location assignment in a distribution center[J]. International Journal of Physical Distribution & Logistics Management.2000,30 (1):54-71.
[25]Graves S. C.Hausman W. H. and Schwarz L. B..Storage-retrieval interleaving in automatic warehousings ystems[J]. Management Seience,1977,23:934-945.
[26]Speaker R. L., Bulk order picking[J]. Industrial Engineering,1975,7 (12):14-18.
[27]M. B. M. De Koster, T. Le-Duc, and K. J. Roodbergen. Design and control of warehouse order picking:A literature review[J]. European Journal of Operational Research,2007, Vol.182, pp:481-501.
[28]Chin-Chia Jane, Yih-Wenn Laih. A clustering algorithm for item assignment ina synchronized zone order pickings ystem[J]. European Journal of Operational Researeh, 2005,166 (2):459-496.
[29]Jewkes, E., Lee C. and R. Viekson. Product location, alloeation and server home base location for an order picking line with multiple servers[J]. Computers & Operations Researeh,2004,31:623-626.
[30]Gademann A. J. R. N., Van den Berg J. P. and Van der Hoff H. H.. An order batching algorithm for wave pieking in a parallel-aisle warehouse[J]. IIE Transaetions,2001,33:384-398.
[31]Gademann N. and Van de Velde S., Batehing to minimize total travel time in a parallel-aisle warehouse[J]. IIE Transaetions,2005,37 (1):63-75.
[32]Chen M. C.and Wu H. P.An assoeiation-based clustering approach to order batehing considering customer demand patterns[J]. Omega International Journal of Management Scienee,2005,33(4):333-343.
[33]Mu-Chen Chen, Cheng-Lung Huang, Kai-Ying Chen, Hsiao-Pin Wu. Aggregation of orders in distribution center susing datemining[J]. Expert Systems with Applieations,2005,28 (3):453-460.
[34]Hsu C. M., Chen K.Y.and Chen M. C. Batching orders in warehouses byminimizing travel distance with genetic algorithms[J]. Computers in Industry,2005,56 (2):169-178.
[35]H. Hwang and D. G. Kim. Order-batehing heuristics based on cluster analysis in a low-level picker-to-part warehousing system[J]. International Journal of Produetion Researeh,2005,43 (17): 3657-3670.
[36]M. B. M. de Koster, E. S. van der Poort, M. Walters. Effieient order-batehing methods in warehouse[J]. INT. J. PROD. RES.1999,37 (7):1479-1504.
[37]H. Donald Ratliff, Arnon S. Rosenthal. Order-sorting in a rectangular warehouse:a solvable case oft hetraveling salesman problem[J], Operation Research,1983,31 (3):507-521.
[38]Roodbergen K. J. and De Koster R., Routing methods for warehouses with multiple cross aisles[J]. International Journal of Production Research,2001a,39 (9):1864-1883.
[39]Roodbergen K. J. And De Koster R.Routing order-pickers in a warehouse with a middle aisle[J]. European Journal of Operational Research,2001b,133:32-43.
[40]Vaughan T.S. and Petersen C. G.. The effect of warehouse cross aisles on order picking effieiency [J]. International Journal of Produetion Research,1999,37(4):881-97.
[41]陈彦军等.以太网在配送分拣系统中的应用[J],现代制造,2004(19)：57-58.
[42]付静芳.配送中心的分拣作业模式研究[J ],物流技术,2005(3)：41-42.
[43]杨玮,刘昌祺等.物流配送中心分拣系统分析[J],包装工程,2005(1)
[44]冯冬青,李波.电子标签在智能分拣系统中的应用研究[J],河南科技,2005(2)：284-288.
[45]李家齐,樊双蛟.分拣作业方式的效率效益[J].中国物流与采购,2006(6)：40-42.
[46]李诗珍.ABC分类管理在配送中心中的应用研究[J].物流技术,2003(8)：33-35.
[47]王雄志,王国庆.配送中心定向补货作业问题[J].系统工程,2006(1)：48-52.
[48]宋齐军,胡声艳.物流中心零散分拣作业效率分析[J].邮电设计技术,2006(9)：54-59.
[49]文坚,马士华.基于时间延迟的订单分批策略研究,《物流技术与应用》,2005年第4期.
[50]于鸿鹏,秦磊,刘向峰.基于遗传算法的订单分批分拣的应用研究,《物流技术》,2009年,第28卷第8期(总第203期)
[51]代红艳,恩莉,李彦平.客户订单合成配送问题的建模与启发式算法,《控制工程》,2004年第5期,第11卷第3期.
[52]冯佳,王国庆,一种配送优先订单拣选方式优化的算法,《工业工程》,2009年9月,第11卷第5期.
[53]鲁五一,袁庆国,戴建民.甲类商品分拣系统的时间建模分析,《物流技术》,2007年第26卷第11期.
[54]刘德宝.复合式单元物料分拣系统研究与设计[D].济南：山东大学,2006.
[55]李娜娜,王莉,戴建民.单元物料配送中心自动分拣系统的规划设计[J].物流科技,2008,31(4)：133-135.
[56]张小勇,单元物料物流配送中心的规划与设计[J].物流技术与应用,2006,11(5)：82-85.
[57]冯华威,李云军.AHP在配送中心分拣策略中的应用[J].商品储运与养护,2007,29(6)：88-89.
[58]冉文学.单元物料物流配送中心组成设备的研究[J].物流技术与应用,2006,9：78-84.
[59]冉文学等.虚拟视窗算法在成品烟自动分拣控制中的应用[J],昆明理工大学学报,2004,1：64-68.
[60]张贻弓,吴耀华.可合流的自动分拣系统订单排序优化[J].山东大学学报(工学版),2008,38(5)：67-71.
[61]熊红云,凯赵,戴建民等.成品烟自动分拣系统的补给优化方法[J].控制工程,2009,16(1)：73-75.
[62]冉文学等.超高速单元物料分拣设备及技术[J].物流技术与应用,2009,9：109-112.
[63]PETER J. B. K.. Computer Communication Systems Performance Modelling[M]. Cambridge, Great Britain:Prentice Hall International (UK) Ltd,1990.
[65]R. B. Cooper, G. Murray. Queues served in cyclic order [J]. The Bell System Technical Journal, 1970,49(3):675-689.
[66]R. B. Cooper. Queues served in cyclic order:waiting times[J]. The Bell System Technical Journal,1970,49 (3):399-413.
[67]Wesley W. Chu Alan G. Konheim. On the analysis of a class of computer communication Systems [J].IEEE Transactions on Communications,1972,20 (3):644-660.
[68]Martin Eisenberg. Two queues with changeover times[J]. Operations Research.1971,19(2): 386-401.
[69]Alan G. Konheim, Bernd Meister. Service in a loop system[J]. Journal of the Association for Computing Machinery,1972,19 (1):92-108.
[70]Hashida O. Analysis of multiqueue[J]. Rev. Elect. Commun. Lab,1972,20(3-4):189-199.
[71]G. Boyd Swartz. Polling in a loop system[J]. Journal of the Association for Computing Machinery. 1980,27 (1):42-59.
[72]Rubin, De. Moraes.L. E. Message Delay Analysis for Polling andToken-Access Schemes for Local Communication Networks[J], IEEE J. Select. Areas COInmun.,1983, SAC-1 (5):934-947.
[73]H. Takagi. Queuing analysis of polling models. ACM Computing Surveys,1988,20(1):1-28.
[74]H. Takagi. Mean message waiting times in symmetric multiqueue systems with cyclic service[J]. Performance Evaluation,1985,5 (4):271-277.
[75]H. Takagi. Application of polling models to computer networks[J]. Computer Networks,1991, 22 (3):193-211.
[76]Oliver C. I Cheng X. Stability condition for multi-queue systems with cyclic serve[J]. IEEE Trans on Automatic Control,1988,33 (1):102-103.
[77]H. Levy, M. Sidi. Polling systems:applications, modeling and optimization[J]. IEEE Transactions on Communications,1990,38 (10):1750-1759.
[78]H. Levy, M. Sidi. Polling systems with simutaneous arrivals[J].IEEE Transactions on Communications,1991,39 (6):823-827.
[79]I. Frigui, A. S. Alfa. Analysis of a Time-limited Polling System.Computer Communication, 1998,21:558-571.
[80]Romano Fantacci, Luca Zoppi. Performance evaluation of polling systems for Wireless Local Communication Networks[J]. IEEE Transactions on Vehicular Technology,2000,49 (6):2148-2157.
[81]LO Shouchin, LEE Guanglin, CHEN Wentsuen. An efficient multipolling mechanism for IEEE 802.11 Wireless LANs[J]. IEEE Transactions on Computers,2003,52(6):764-778.
[82]Daniele Miorandi, Andrea Zanella. Performance analysis of limited-1 polling in a blue tooth piconet. In:Proceeding of the 11th International Conference on Information Systems Analysis and Synthesis (CITSA2005), July 2005, Florida, USA.
[83]V. M. Vishnevskii, O. V. Semenova. Mathematical methods to study the polling systems[J]. Automation and Remote Control,2006,67 (2):173-220.
[84]S. C. Horng, S. Y. Lin. Ordinal optimization of G/G/1/K polling systems with k-limited service discipline[J]. Journal of Optimization Theory and Applications,2009,140 (2):213-231.
[85]M. A. A. Boon, E. M. M. Winands, I. J. B. F. Adan, A. C. C. van Wijk. Closed-form waiting time approximations for polling systems[J]. Performance Evaluation,2011,68 (3):290-306.
[86]M. A. A. Boon, I. J. B. F. Adan, O. J. Boxma. A polling model with multiple priority levels Original Research Article[J]. Performance Evaluation,2010,67 (6):468-484.
[87]M. A. A. Boon, R. D. van der Mei, E. M. M. Winands. Applications of polling systems [J]. Research and Management Science,2011,16 (2):67-82.
[88]Onno Boxma, Josine Bruin, Brian Fralix. Sojourn times in polling systems with various service disciplines[J]. Performance Evaluation,2009,66 (11):621-639.
[89]R. D. van der Mei, E. M. M. Winands. Heavy traffic analysis of polling models by mean value analysis[J]. Performance Evaluation,2008,65 (6-7):400-416.
[90]赵东风.门限式令牌总线局部网协议性能分析[J].云南大学学报,1990,12(2)：146-152.
[91]ZHAO Dongfeng, ZHENG Sumin. Waiting Time Analysis for Polling and Token Passing Scheme for Computer and Communication Systems[C]. In:Proceeding of International Conference on Communication Technology (ICCT'92), Beijing, China, Sep.1992,15.04.1-15.04.3.
[92]ZHAO Dongfen, ZHENG Sumin. Message waiting time analysis for polling model for computer communication networks [J]云南大学学报(自然科学版),1993,15(1)：78-86.
[93]赵东风,郑苏民.周期查询式门限服务排队系统中订单的延迟分析[J].通信学报,1994,15(2)：18-23.
[94]赵东风,郑苏民.查询式完全服务排队模型分析[J].电子学报,1994,22(5)：102-107.
[95]ZHAO Dongfeng, SHI Jinlin, LI Bihai. Analysis of integrated voice/data in communication systems[C]. In:Proceeding of International Symposium on IN & ISDN (ISIB'95), Beijing, China, April 1995, page (s):361-364.
[96]赵东风,李必海,郑苏民.周期查询式限定服务排队系统研究[J].电子科学学刊,1997,19(1)：44-49.
[97]李俊生,彭兵,赵东风.ATM接入网络中非对称性周期传输过程分析[J].电子科技大学学报,1999,28(5)：550-553.
[98]李俊生,彭兵,赵东风,石晶林.环形LAN多业务模型求解[J].通信学报,1999,20(11)：1-6.
[99]赵东风.令牌网络中非对称性问题研究[J].通信学报,1998,19(1)：74-80.
[100]赵东风.物流加工优先级控制过程研究[J].信息与控制,1998,27(5)：364-368.
[101]赵东风,丁洪伟,赵一帆等.多级门限服务轮询系统MAC离散时间控制协议模型分析[J].电子学报,2010,38(7)：1494-1499.
[102]张宇眉,张欣,杨大成,赵东风.基于等待时间和信道状态的轮询多址协议[J].北京邮电大学学报,2008,31(4)：126-129.
[103]李俊生,彭兵,赵东风.非对称周期查询限定控制系统求解[J].电子学报,2001,29(4)：1-3.
[104]YANG Zhijun, ZHAO Dongfeng. QoS support polling scheme for multimedia traffic in wireless LAN MAC protocol. Tsinghua Science and Technology,2008,13 (6):754-758.
[105]LIU Qianlin, ZHAO Dongfeng. Priority polling strategy for wireless sensor networks[A]. In: Proceeding of IEEE International Conference on Information Science and Engineering (ICISE 2009) [C]. December 2009, Nanjing, China, Page (s):4062-4065.
[106]杨志军.两级优先级控制轮询系统理论及应用研究[D],云南大学博士学位论文,2008.11.
[107]柳虔林.离散时间完全与限定(K=1)服务两级轮询系统理论研究[D],云南大学博士学位论文,2010.11.
[108]保利勇.连续时间的优先级完全服务与限定服务轮询系统研究[D],云南大学博士学位论文,2011.6.
[109]王光兴,刘书生,赵海.无线介质计算机通信网络中周期优先轮询服务策略的研究[J].通信学报,1989,10(4)：68-73.
[110]王思明,逯昭义.带有优先级的令牌环行LAN守恒定律的探讨[J].计算机学报1991,16(8)：862-866.
[111]王思明,汪虹.资源共享方式若干问题的研讨[J].运筹与管理,1998,7(3)：83-89.
[112]刘强,张中兆,张乃通.排队优先权工位轮询系统的平均周期时间[J].通信学报,1999,20(2)：86-91.
[113]李福建,陈廷槐,康泰.容错轮询系统分析模型[J].电子学报,1992,20(5)：88-91.
[114]李福建.服务器个数随机可变的轮询系统分析[J].通信学报,1995,16(1)：88-95.
[115]SUN Ronghen. Asymmetric exhaustive service polling system with Bernoulli feedback[J].重庆大学学报(自然科学版),2001,24(2)：127-131.
[116]庞昆,郑君里,顾学道,基于动态令牌轮询提供视频QoS保证的无线ATM多址接入控制[J].电子学报,1999,27(11)：33-37.
[117]王智,申兴发,于海斌等.两类服务对象轮询模型的平均运行周期[J].计算机学报,2004,27(9)：1213-1220.
[118]CAO Chunsheng, YIN Rupo, ZHANG Weidong. Mean waiting time approximation for a real time polling system[J]. High Technology Letters,2007,13 (2):136-139.
[119]刘静,李建东,周雷,张光辉.有效提高吞吐量的UPMA++协议[J].电子学报,2005,33(4)：683-687.
[120]刘凯,李汉涛,张军.移动Ad Hoc网络中的公平按需多址接入协议[J].电子学报,2006,33(10)：130-134.
[121]马忠建,方旭明等人.蓝牙Ad hoc网调度策略的设计与仿真[J].系统仿真学报,2006,18(9)：2546-2549.
[122]杨帆,王珂,钱志鸿.按需轮循的蓝牙微微网调度算法与性能评估[J].电子学报,2007,35(4)：647-652.
[123]赵琪,毛玉泉,任浩,直升机战术数据链的轮询组网方式分析[.I].电讯技术,2008,50(11)：4-9.
[124]张红霞,戴居丰.基于IEEE 802.16e协议的公平调度算法[M].计算机应用,2009,29(5)1204-1207.
[125]RAN Wencue, ZHAO Dongfeng, WANG Fengyun. Study Multiple Sevices of the Random Onder Picking System about Distribution Center[J], Management Engineering and Applications.2010: 283-288.
[126]E.M.M.Winands, I.J.B.F.Adan and G.J.van. Houtum. A two queue model with alternating limited service and state-dependent setups[A]. In:Proceedings of Analysis of Manufacturing Systems Production Management[C].2005, Zakynthos, Page (s):200-208.
[127]H. Levy, M. Sidi. Polling systems:applications, modeling and optimization[J]. IEEE Transactions on Communications,1990,38 (10):1750-1759.
[128]Boxma O. J.Wal J. van der and Yechiali U. Polling with batch service. Stochastic Models,2008, 24 (4):604-625.
[129]Onno Boxma, Josine Bruin, Brian Fralix. Sojourn times in polling systems with various service disciplines[J]. Performance Evaluation,2009,66 (5):621-639.
[130]Martin Eisenberg. Two queues with changeover times[J]. Operations Research.1971,19(2): 386-401.
[131]Alan G. Konheim, Bernd Meister. Service in a loop system[J]. Journal of the Association for Computing Machinery.1972,19 (1):92-108.
[132]Hashida O. Analysis of multiqueue[J]. Rev. Elect. Commun. Lab,1972,20 (3-4):189-199.
[133]P. Humblet. Source coding for communication concentrators[J]. Electron. Syst. Lab., Massachusetts Inst. Technol., Cambridge, ESL-R-798, Jan.1978.
[134]M. J. Ferguson and Y. J. Aminetzah, Exact Results for Nonsymmetric Token Ring Systems[J], IEEE Trans. Commun., Mar.1985, COM-33:223-231.
[135]Konheim A. G. Descendent set:an efficient approach for analysis of polling systems[J]. IEEE Transactions on Communications,1994,42 (8):1244-1253.
[136]陈希孺,郑忠国.现代数学手册(随机数学卷)[M].中科技大学出版社,2000年12月.
[137]Martin Eisenberg. Two Queues with Changeover Times [J]. Operations Research, Mar.-Apr. 1971,19 (2):386-401.
[138]李诗珍.配送中心拣货作业优化设计与控制研究[D],西南交通大学博士论文,2008年.
[139]Wang Z.Song Y. Q.Yu H. B. Sun Y. X.. Stability analysis for multi class multi queue single server system under polling table. In:Proceedings of the 2002 American Control Conference, Alaska, USA, 2002,6:4732-4737.
[140]Wang Z., Song Y. Q., Yu H. B., Sun Y. X.. Characteristic of multi message multi queue single server system. In:Proceedings of the IEEE Control Systems Society Conf erence on Cont rol Applications, Glasgow, Scotland,2002,536-641.
[141]王明贵,赵东风,丁洪伟,赖欲平.服务2类业务的轮询系统性能分析[J].云南大学学报(自然科学版),2010,32(2)：147-151.
[142]王智,申兴发,于海斌等.两类服务对象轮询模型的平均运行周期[J].计算机学报,2004,27(9)：1213-1220.
[143]King P. J. B.. Coputer Communication Systems Performance Modeling[M]. Cambridge, Great Britain:Prentice Hall International (UK) Ltd.1990.
[144]Peter J. B King. Computer communication systems performance modeling[M], Pretence Hall, 1990.
[145]A. G. Konheim. Waiting lines and times in a system with polling, J. ACM,1979:470-490.
[146]P. J. Kuehen. Multi-queue system with nonexhaustive cycle serve. Bell Syst. Tech. J.1979: 671-698.
[147]H. Takagi. Queuing analysis of polling system[J]. ACM Computing Surveys.1988,20(1): 4-28.
[148]H. Takagi. Mean message waiting time in symmetric multi-queue systems with cycle serve [J]. Performance Evaluation,1985:271-277.
[149]Oliver C. Ibe, Xian Cheng. Stability condition for multi-queue systems with cyelic servefJ]. IEEE Trans on Automatic Control,1988:102-103.
[150]李剑,胡波,赵东风.一种提供时延Qos保障的无线网络MAC协议[J].电子学报,2005,33(7)：1168-1172.
[151]Tao Li, Logothetis D, Veeraraghavan M. Analysis of a polling system for telephony traffic with application to wireless LANs[J]. IEEE Transactions on Wireless Communications,2006,5(6):1284-1293.
[152]V. M. Vishnevskii, O. V. Semenova. Mathematical methods to study the polling systems[J]. Automation and Remote Control,2006,67 (2):173-220.
[153]A. Wierman, E. M. M. Winands, O. J. Boxma. Scheduling in polling systems[J]. Performance Evaluation,2007,64:1009-1028.
[154]Mei R. D. van der, Winands E. M. M.. Heavy traffic analysis of polling models by mean value analysis[J]. Performance Evaluation,2008,65 (6-7):400-416.
[155]Ben-Jye Chang, Yan-Ling Chen. Adaptive hierarchical polling and Markov decision process based CAC for increasing network reward and reducing average delay in IEEE 802.16 WiMAX networks[J]. Computer Communications,2008,31 (10):2280-2292.
[156]Beekhuizen P., Denteneer D., Resing J. A. C. Reduction of a polling network to a single node[J]. Queueing Systems:Theory and Applications,2008,58 (4):303-319.
[157]Boxma O. J., Wal J. van der, Yechiali U.. Polling with batch service[J]. Stochastic Models, 2008,24 (4):604-625.
[158]S.C. Horng, S. Y. Lin. Ordinal optimization of G/G/1/K polling systems with k-limited service discipline[J]. Journal of Optimization Theory and Applications,2009,140 (2):213-231.
[159]E. M. M. Winands, I. J. B.F.Adan, G. J. Van ho utum, D. G. Down. A state-dependent polling model with k-limited service[J]. Probability in the Engineering and Informational Sciences,2009,23 (2): 384-408.
[160]王明贵,赵东风,丁洪伟,赖裕平.优先队列二级址门限服务的轮询系统分析[J].计算机工程与应用,2009,45(22)：94-96.
[161]王菽兰,赵东风,丁洪伟.两种轮询服务有限级排队系统的研究[J].云南大学学报,2005,27(5A)：308-312.
[162]B. Sikdar. An analytic model for the delay in IEEE 802.11 PCF MAC based wireless networks. IEEE Transactions on Wireless Communications,2007,6 (4):1542-1560.
[163]Zsolt Saffer, Miklos Telek. Stability of periodic polling system with BMAP arrivals[J]. European Journal of Operational Research,2009,197 (1):188-195.
[164]Bilpab Sikdar. An analytic model for the delay in IEEE 802.11 PCF MAC based wireless networks[J]. IEEE Trans. Wireless Commun,2007,6 (4):1542-1560.
[165]冉文学.卷烟销售自动化配送中心的研究[M],西北工业大学硕士论文,2004年5月.
[166]赵东风.时隙式随机争用多址系统分析方法研究[J],《通信学报》,1999年8月,20(8)：80-85.
[167]M. A. A. Boon, E. M. M. Winands, I. J. B. F. Adan, A. C. C. van Wijk. Closed-form waiting time approximations for polling systems[J]. Performance Evaluation,2011,68 (3):290-306.
[168]Elie Inaty. A multiservice WLAN using a radio resource scheduler[J]. European Transactions on Telecommunications,2010,21(1):90-100.
[169]张宇眉,张欣,杨大成,赵东风.基于等待时间和信道状态的轮询多址协议[J].北京邮电大学学报,2008,31(4)：126-129.
[170]赵东风,丁洪伟,赵一帆等.多级门限服务轮询系统MAC离散时间控制协议模型分析[J].电子学报,2010,38(7)：1494-1499.
[171]YANG Zhijun, ZHAO Dongfeng. QoS support polling scheme for multimedia traffic in wireless LAN MAC protocol. Tsinghua Science and Technology,2008,13(6):754-758.
[172]LIU Qianlin, ZHAO Dongfeng. Priority polling strategy for wireless sensor networks[A]. In: Proceeding of IEEE International Conference on Information Science and Engineering (ICISE 2009) [C]. December 2009, Nanjing, China, Page (s):4062-4065.
[173]Bao Liyong, Zhao Dongfeng, Ding Hongwei. A Dynamic Scheme for Multimedia Support in IEEE802.11 Wireless Network.2010 the 2nd International Conference on Signal Processing Systems (ICSPS 2010),4-7 July 2010, Vol.1, Dalian, China,828-832.
[174]Koh S. G, Kwon H. M., Kim Y. J.. An analysis of the end-of-aisle order Picking system: Multi-aisle served by a single order Pieker [J]. International Journal of production Economies,2005,98 (2):162-271.
[175]E. M. M. Winands, I. J. B. F. Adan and G. J. van. Houtum. A two queue model with alternating limited service and state-dependent setups[A]. In:Proceedings of Analysis of Manufacturing Systems Production Management[C].2005, Zakyntho, Page (s):200-208.
[176]DeKoster M. B. M., J. Neuteboom. The logistics of supermarket chains[M], Elsevier, Doetinehem,2001.
[177]Kamarminen V., Saranen J. and Holmstrom J. The reception box impact on home delivery effielency in the e-grocery business[J], International Journal of Physleal Distribution and Logistics Management,2001, Vol.31, No.6:414-426.
[178]Tom Hays, Pinar Keskinoeak, Virginia Maleome de Lopez.. Strategies and challenges of intemet grocery retalling logltics [J]. Forthcoming in Application of Supply Chain Management and E-Commerce Researeh, (2004), The Neitherland.
[179]梁竹关.离散时间完全服务两级轮询系统理论研究[D].云南大学博士学位论文,2010.5.
[180]肖际伟.配送中心分拣系统优化[D].济南：山东大学,2010.
[181]吴颖颖,吴耀华.基于并行拣选的自动拣选系统订单拆分优化[J].计算机集成制造系统,2012,10, Vol.18, No.10:2264-2271.
[182]官铮.离散时间并行调度两级服务与非对称门限服务轮询系统理论研究[D].云南大学博士学位论文,2012.12.
[183]李晓春.配送中心拣货作业设计与优化[D].暨南大学博士研究生学位论文,2009.
[184]王艳艳,吴耀华,孙国华,于洪鹏.配送中心分拣订单合批策略的研究[J].山东大学学报
(工学版),2010(2)：43-46.
[185]张贻弓,吴耀华.基于并行拣选策略的自动拣选系统品项分配[J].计算机集成制造系统.2010(08)：1720-1725.
[186]郭进,江志斌.紧固件分拣中心拣选策略的动态EIQ分析[J].科学技术与工程.2012(4)：2655-2659.
[187]王艳艳,吴耀华,吴颖颖.并行自动拣选系统品项拣选量拆分优化[J].机械工程学报,2013(16)：177-184
[188]LAU Henry Y. K, ZHAO Ying. Joint seheduling of material handling equipment in automated air cargo terminals[J].Computers in Industry,2006,57:398-41.
[189]Dallari F., Marchet G., Melaeini M.. Design of order pickingsystem[J]. The International Journal of Advanced Manufacturing Technology,2009,42:1-12.
[190]王华.拣货系统布局选择的决策模型与应用[J].物流技术,2011(2)：67-72.
[191]杨琼华,高超,刘秀菊,刘国庆.基于TaraVRbuilder的快件分拣系统建模与仿真[J].重庆科技学院学报.2012(13)：70-72.
[192]蔺媛媛,刘云.立体仓库固定货架拣选路径优化的蚁群算法研究[J].中国西部科技.2010(11)：43-47.
[193]邵刘霞等.基于遗传算法的人工订单拣选路径优化研究.物流技术,2012(21)：76-80..
[194]陆园,洪跃.多目标下的自动化立体仓库拣选作业路径优化[J].机械制造.2012(3)：84-87.
[195]Yeming Gong and Rene De Koster. A polling-based dynamic order picking system for online retailers. HE Transactions,2008(40):1070-1082.
[196]ForresterResearch公司报告, http://www.forrester.com/eBusiness-Channel-Strategy.2013.
[197]Ben-Jye Chang, YanLing Chen. Adaptive hierarchical polling and Markov decision process based CAC for increasing network reward and reducing average delay in IEEE 802.16 WiMAX networks[J]. Computer Communications,2008,31(10):2280-2292.
[198]ZHAO Liqiang, ZHANG Jie, ZHANG Hailin. Hub-polling-based IEEE 802.11 PCF with integration QoS differentiation[J]. Wireless Communications and Mobile Computing,2009,9:1220-1230.
[2]Jeroen P.van den Berg. A literature survey on planning and control of warehousing system[J]. IEE Transactions,1999,31 (8):751-762.
[3]C. Mack. The efficiency of N machines uni-directionally patrolled by one operative when walking time is constant and repair times are variable[J]. Journal of the Royal Statistical Society Series B 19 (1), 1957:173-178.
[4]D. V. Lindley. The theory of queues with a single server[J]. In Proc. Cambridge Phil. Soc.,1952, 48:277-289.
[5]Pan J C-H, Wu M-H. A study of storage assignment problem for an order picking line in a pick-and-pass warehousing system[J]. Computers & Industrial Engineering,2009,57 (1):261-268.
[6]Tompkins J. A.White J. A., Bozer Y. A., Frazelle E. H. and Tanehoeo J. M. A. Facilities Planning
(NJ:John Wiley & Sons),2003.
[7]Goetschalckx M.and Ashayeri J.Classification and design of order Picking systems. Logistics World,1989, June,99-106.
[8]Rene de Koster, Edo van der Poort. Routing order pickers in a warehouse:A Comparison between optimal and heuristic solutions[J].IIE Transactions,1998,30 (5):468-480.
[9]C. G. Petersen, G. Aase. A comparison of picking, storage, and routing policies in manual order picking[J]. Int. J. production Economics.2004,92:11-19.
[10]Heskett J. L. Cube-Per-order index:A key to warehouse stock location[J]. Transport and Distribution Management,1963,3 (4):27-31.
[11]Kallina C., Lynn J. Application of the cube-per-order index rule for stock ocation in a distribution warehouse[J]. Interfaces,1976,7 (1):37-46.
[12]Hausman W. H., Schwarz L. B., Graves S. C. Optimal storage assignment in automatic warehousing systems [J]. Management Science,1976,22 (6):629-638.
[13]Bassan Y.Roll Y. And Rosenblatt M.J.Internal layout design of a warehouse[J]. IIE Transactions, 1980,12 (4):317-322.
[14]Rosenblat M. J. and Roll Y. Warehouse capaeity in a stochastic enviroriment[J]. International Journal of Production Researeh,1988,26 (12):1847-1851.
[15]Roodbergen K. J.Layout and routing methods for warehouses[D]. ph.D. Thesis, Erasmus Research Institute of Management (ERIM),2001.
[16]Caron F., Marehet G.and Perego A.Optimal layout in low-level picker-to-part systems[J]. International Journal of Production Research,2000,38 (1):101-117.
[17]Tho Le-Due. Design and control of efficient order picking proeesses[D]. Ph. D. Thesis, Erasmus University Rotterdam,2005.
[18]Petersen C. G. Considerations in order picking zone configuration[J].International Journal of Operations & Production Management,2002,27 (7):793-805.
[19]Bozer YA. And White J. A..Travel-time models for automated storage/retrieval systems[J]. IIE Transactions,1984,16:329-338.
[20]Kitaoka M.Nabeta T.Nakamura R. et al. EIQNK curve analysis for the design of distribution center and warehouse with spline function[J]. Computers & Industrial Engineering,1996,31 (3/4): 634-636.
[21]Hackman S. T. and Rosenblatt M. J.. Allocating items to an automated storage and retrieval system[J]. IIE Transactions,1990,22 (1):7-14.
[22]Frazelle E. H., Hackman, S. T.Passy U. and Platzman L. K., Eds.. The forward-reserve problem. Optimization in Industry 2, NewYork, John Wiley & Sons Ltd.1994.
[23]Van den Berg J. P.Sharp G. P.Gademann A. J. R. M. N. And Pochet Y. Forward-reserve allocation in a warehouse with unit-load replenishments [J]. European Journal of Operational Researeh,1998,111: 98-113.
[24]Chin Chia Jane. Storage location assignment in a distribution center[J]. International Journal of Physical Distribution & Logistics Management.2000,30 (1):54-71.
[25]Graves S. C.Hausman W. H. and Schwarz L. B..Storage-retrieval interleaving in automatic warehousings ystems[J]. Management Seience,1977,23:934-945.
[26]Speaker R. L., Bulk order picking[J]. Industrial Engineering,1975,7 (12):14-18.
[27]M. B. M. De Koster, T. Le-Duc, and K. J. Roodbergen. Design and control of warehouse order picking:A literature review[J]. European Journal of Operational Research,2007, Vol.182, pp:481-501.
[28]Chin-Chia Jane, Yih-Wenn Laih. A clustering algorithm for item assignment ina synchronized zone order pickings ystem[J]. European Journal of Operational Researeh, 2005,166 (2):459-496.
[29]Jewkes, E., Lee C. and R. Viekson. Product location, alloeation and server home base location for an order picking line with multiple servers[J]. Computers & Operations Researeh,2004,31:623-626.
[30]Gademann A. J. R. N., Van den Berg J. P. and Van der Hoff H. H.. An order batching algorithm for wave pieking in a parallel-aisle warehouse[J]. IIE Transaetions,2001,33:384-398.
[31]Gademann N. and Van de Velde S., Batehing to minimize total travel time in a parallel-aisle warehouse[J]. IIE Transaetions,2005,37 (1):63-75.
[32]Chen M. C.and Wu H. P.An assoeiation-based clustering approach to order batehing considering customer demand patterns[J]. Omega International Journal of Management Scienee,2005,33(4):333-343.
[33]Mu-Chen Chen, Cheng-Lung Huang, Kai-Ying Chen, Hsiao-Pin Wu. Aggregation of orders in distribution center susing datemining[J]. Expert Systems with Applieations,2005,28 (3):453-460.
[34]Hsu C. M., Chen K.Y.and Chen M. C. Batching orders in warehouses byminimizing travel distance with genetic algorithms[J]. Computers in Industry,2005,56 (2):169-178.
[35]H. Hwang and D. G. Kim. Order-batehing heuristics based on cluster analysis in a low-level picker-to-part warehousing system[J]. International Journal of Produetion Researeh,2005,43 (17): 3657-3670.
[36]M. B. M. de Koster, E. S. van der Poort, M. Walters. Effieient order-batehing methods in warehouse[J]. INT. J. PROD. RES.1999,37 (7):1479-1504.
[37]H. Donald Ratliff, Arnon S. Rosenthal. Order-sorting in a rectangular warehouse:a solvable case oft hetraveling salesman problem[J], Operation Research,1983,31 (3):507-521.
[38]Roodbergen K. J. and De Koster R., Routing methods for warehouses with multiple cross aisles[J]. International Journal of Production Research,2001a,39 (9):1864-1883.
[39]Roodbergen K. J. And De Koster R.Routing order-pickers in a warehouse with a middle aisle[J]. European Journal of Operational Research,2001b,133:32-43.
[40]Vaughan T.S. and Petersen C. G.. The effect of warehouse cross aisles on order picking effieiency [J]. International Journal of Produetion Research,1999,37(4):881-97.
[41]陈彦军等.以太网在配送分拣系统中的应用[J],现代制造,2004(19)：57-58.
[42]付静芳.配送中心的分拣作业模式研究[J ],物流技术,2005(3)：41-42.
[43]杨玮,刘昌祺等.物流配送中心分拣系统分析[J],包装工程,2005(1)
[44]冯冬青,李波.电子标签在智能分拣系统中的应用研究[J],河南科技,2005(2)：284-288.
[45]李家齐,樊双蛟.分拣作业方式的效率效益[J].中国物流与采购,2006(6)：40-42.
[46]李诗珍.ABC分类管理在配送中心中的应用研究[J].物流技术,2003(8)：33-35.
[47]王雄志,王国庆.配送中心定向补货作业问题[J].系统工程,2006(1)：48-52.
[48]宋齐军,胡声艳.物流中心零散分拣作业效率分析[J].邮电设计技术,2006(9)：54-59.
[49]文坚,马士华.基于时间延迟的订单分批策略研究,《物流技术与应用》,2005年第4期.
[50]于鸿鹏,秦磊,刘向峰.基于遗传算法的订单分批分拣的应用研究,《物流技术》,2009年,第28卷第8期(总第203期)
[51]代红艳,恩莉,李彦平.客户订单合成配送问题的建模与启发式算法,《控制工程》,2004年第5期,第11卷第3期.
[52]冯佳,王国庆,一种配送优先订单拣选方式优化的算法,《工业工程》,2009年9月,第11卷第5期.
[53]鲁五一,袁庆国,戴建民.甲类商品分拣系统的时间建模分析,《物流技术》,2007年第26卷第11期.
[54]刘德宝.复合式单元物料分拣系统研究与设计[D].济南：山东大学,2006.
[55]李娜娜,王莉,戴建民.单元物料配送中心自动分拣系统的规划设计[J].物流科技,2008,31(4)：133-135.
[56]张小勇,单元物料物流配送中心的规划与设计[J].物流技术与应用,2006,11(5)：82-85.
[57]冯华威,李云军.AHP在配送中心分拣策略中的应用[J].商品储运与养护,2007,29(6)：88-89.
[58]冉文学.单元物料物流配送中心组成设备的研究[J].物流技术与应用,2006,9：78-84.
[59]冉文学等.虚拟视窗算法在成品烟自动分拣控制中的应用[J],昆明理工大学学报,2004,1：64-68.
[60]张贻弓,吴耀华.可合流的自动分拣系统订单排序优化[J].山东大学学报(工学版),2008,38(5)：67-71.
[61]熊红云,凯赵,戴建民等.成品烟自动分拣系统的补给优化方法[J].控制工程,2009,16(1)：73-75.
[62]冉文学等.超高速单元物料分拣设备及技术[J].物流技术与应用,2009,9：109-112.
[63]PETER J. B. K.. Computer Communication Systems Performance Modelling[M]. Cambridge, Great Britain:Prentice Hall International (UK) Ltd,1990.
[65]R. B. Cooper, G. Murray. Queues served in cyclic order [J]. The Bell System Technical Journal, 1970,49(3):675-689.
[66]R. B. Cooper. Queues served in cyclic order:waiting times[J]. The Bell System Technical Journal,1970,49 (3):399-413.
[67]Wesley W. Chu Alan G. Konheim. On the analysis of a class of computer communication Systems [J].IEEE Transactions on Communications,1972,20 (3):644-660.
[68]Martin Eisenberg. Two queues with changeover times[J]. Operations Research.1971,19(2): 386-401.
[69]Alan G. Konheim, Bernd Meister. Service in a loop system[J]. Journal of the Association for Computing Machinery,1972,19 (1):92-108.
[70]Hashida O. Analysis of multiqueue[J]. Rev. Elect. Commun. Lab,1972,20(3-4):189-199.
[71]G. Boyd Swartz. Polling in a loop system[J]. Journal of the Association for Computing Machinery. 1980,27 (1):42-59.
[72]Rubin, De. Moraes.L. E. Message Delay Analysis for Polling andToken-Access Schemes for Local Communication Networks[J], IEEE J. Select. Areas COInmun.,1983, SAC-1 (5):934-947.
[73]H. Takagi. Queuing analysis of polling models. ACM Computing Surveys,1988,20(1):1-28.
[74]H. Takagi. Mean message waiting times in symmetric multiqueue systems with cyclic service[J]. Performance Evaluation,1985,5 (4):271-277.
[75]H. Takagi. Application of polling models to computer networks[J]. Computer Networks,1991, 22 (3):193-211.
[76]Oliver C. I Cheng X. Stability condition for multi-queue systems with cyclic serve[J]. IEEE Trans on Automatic Control,1988,33 (1):102-103.
[77]H. Levy, M. Sidi. Polling systems:applications, modeling and optimization[J]. IEEE Transactions on Communications,1990,38 (10):1750-1759.
[78]H. Levy, M. Sidi. Polling systems with simutaneous arrivals[J].IEEE Transactions on Communications,1991,39 (6):823-827.
[79]I. Frigui, A. S. Alfa. Analysis of a Time-limited Polling System.Computer Communication, 1998,21:558-571.
[80]Romano Fantacci, Luca Zoppi. Performance evaluation of polling systems for Wireless Local Communication Networks[J]. IEEE Transactions on Vehicular Technology,2000,49 (6):2148-2157.
[81]LO Shouchin, LEE Guanglin, CHEN Wentsuen. An efficient multipolling mechanism for IEEE 802.11 Wireless LANs[J]. IEEE Transactions on Computers,2003,52(6):764-778.
[82]Daniele Miorandi, Andrea Zanella. Performance analysis of limited-1 polling in a blue tooth piconet. In:Proceeding of the 11th International Conference on Information Systems Analysis and Synthesis (CITSA2005), July 2005, Florida, USA.
[83]V. M. Vishnevskii, O. V. Semenova. Mathematical methods to study the polling systems[J]. Automation and Remote Control,2006,67 (2):173-220.
[84]S. C. Horng, S. Y. Lin. Ordinal optimization of G/G/1/K polling systems with k-limited service discipline[J]. Journal of Optimization Theory and Applications,2009,140 (2):213-231.
[85]M. A. A. Boon, E. M. M. Winands, I. J. B. F. Adan, A. C. C. van Wijk. Closed-form waiting time approximations for polling systems[J]. Performance Evaluation,2011,68 (3):290-306.
[86]M. A. A. Boon, I. J. B. F. Adan, O. J. Boxma. A polling model with multiple priority levels Original Research Article[J]. Performance Evaluation,2010,67 (6):468-484.
[87]M. A. A. Boon, R. D. van der Mei, E. M. M. Winands. Applications of polling systems [J]. Research and Management Science,2011,16 (2):67-82.
[88]Onno Boxma, Josine Bruin, Brian Fralix. Sojourn times in polling systems with various service disciplines[J]. Performance Evaluation,2009,66 (11):621-639.
[89]R. D. van der Mei, E. M. M. Winands. Heavy traffic analysis of polling models by mean value analysis[J]. Performance Evaluation,2008,65 (6-7):400-416.
[90]赵东风.门限式令牌总线局部网协议性能分析[J].云南大学学报,1990,12(2)：146-152.
[91]ZHAO Dongfeng, ZHENG Sumin. Waiting Time Analysis for Polling and Token Passing Scheme for Computer and Communication Systems[C]. In:Proceeding of International Conference on Communication Technology (ICCT'92), Beijing, China, Sep.1992,15.04.1-15.04.3.
[92]ZHAO Dongfen, ZHENG Sumin. Message waiting time analysis for polling model for computer communication networks [J]云南大学学报(自然科学版),1993,15(1)：78-86.
[93]赵东风,郑苏民.周期查询式门限服务排队系统中订单的延迟分析[J].通信学报,1994,15(2)：18-23.
[94]赵东风,郑苏民.查询式完全服务排队模型分析[J].电子学报,1994,22(5)：102-107.
[95]ZHAO Dongfeng, SHI Jinlin, LI Bihai. Analysis of integrated voice/data in communication systems[C]. In:Proceeding of International Symposium on IN & ISDN (ISIB'95), Beijing, China, April 1995, page (s):361-364.
[96]赵东风,李必海,郑苏民.周期查询式限定服务排队系统研究[J].电子科学学刊,1997,19(1)：44-49.
[97]李俊生,彭兵,赵东风.ATM接入网络中非对称性周期传输过程分析[J].电子科技大学学报,1999,28(5)：550-553.
[98]李俊生,彭兵,赵东风,石晶林.环形LAN多业务模型求解[J].通信学报,1999,20(11)：1-6.
[99]赵东风.令牌网络中非对称性问题研究[J].通信学报,1998,19(1)：74-80.
[100]赵东风.物流加工优先级控制过程研究[J].信息与控制,1998,27(5)：364-368.
[101]赵东风,丁洪伟,赵一帆等.多级门限服务轮询系统MAC离散时间控制协议模型分析[J].电子学报,2010,38(7)：1494-1499.
[102]张宇眉,张欣,杨大成,赵东风.基于等待时间和信道状态的轮询多址协议[J].北京邮电大学学报,2008,31(4)：126-129.
[103]李俊生,彭兵,赵东风.非对称周期查询限定控制系统求解[J].电子学报,2001,29(4)：1-3.
[104]YANG Zhijun, ZHAO Dongfeng. QoS support polling scheme for multimedia traffic in wireless LAN MAC protocol. Tsinghua Science and Technology,2008,13 (6):754-758.
[105]LIU Qianlin, ZHAO Dongfeng. Priority polling strategy for wireless sensor networks[A]. In: Proceeding of IEEE International Conference on Information Science and Engineering (ICISE 2009) [C]. December 2009, Nanjing, China, Page (s):4062-4065.
[106]杨志军.两级优先级控制轮询系统理论及应用研究[D],云南大学博士学位论文,2008.11.
[107]柳虔林.离散时间完全与限定(K=1)服务两级轮询系统理论研究[D],云南大学博士学位论文,2010.11.
[108]保利勇.连续时间的优先级完全服务与限定服务轮询系统研究[D],云南大学博士学位论文,2011.6.
[109]王光兴,刘书生,赵海.无线介质计算机通信网络中周期优先轮询服务策略的研究[J].通信学报,1989,10(4)：68-73.
[110]王思明,逯昭义.带有优先级的令牌环行LAN守恒定律的探讨[J].计算机学报1991,16(8)：862-866.
[111]王思明,汪虹.资源共享方式若干问题的研讨[J].运筹与管理,1998,7(3)：83-89.
[112]刘强,张中兆,张乃通.排队优先权工位轮询系统的平均周期时间[J].通信学报,1999,20(2)：86-91.
[113]李福建,陈廷槐,康泰.容错轮询系统分析模型[J].电子学报,1992,20(5)：88-91.
[114]李福建.服务器个数随机可变的轮询系统分析[J].通信学报,1995,16(1)：88-95.
[115]SUN Ronghen. Asymmetric exhaustive service polling system with Bernoulli feedback[J].重庆大学学报(自然科学版),2001,24(2)：127-131.
[116]庞昆,郑君里,顾学道,基于动态令牌轮询提供视频QoS保证的无线ATM多址接入控制[J].电子学报,1999,27(11)：33-37.
[117]王智,申兴发,于海斌等.两类服务对象轮询模型的平均运行周期[J].计算机学报,2004,27(9)：1213-1220.
[118]CAO Chunsheng, YIN Rupo, ZHANG Weidong. Mean waiting time approximation for a real time polling system[J]. High Technology Letters,2007,13 (2):136-139.
[119]刘静,李建东,周雷,张光辉.有效提高吞吐量的UPMA++协议[J].电子学报,2005,33(4)：683-687.
[120]刘凯,李汉涛,张军.移动Ad Hoc网络中的公平按需多址接入协议[J].电子学报,2006,33(10)：130-134.
[121]马忠建,方旭明等人.蓝牙Ad hoc网调度策略的设计与仿真[J].系统仿真学报,2006,18(9)：2546-2549.
[122]杨帆,王珂,钱志鸿.按需轮循的蓝牙微微网调度算法与性能评估[J].电子学报,2007,35(4)：647-652.
[123]赵琪,毛玉泉,任浩,直升机战术数据链的轮询组网方式分析[.I].电讯技术,2008,50(11)：4-9.
[124]张红霞,戴居丰.基于IEEE 802.16e协议的公平调度算法[M].计算机应用,2009,29(5)1204-1207.
[125]RAN Wencue, ZHAO Dongfeng, WANG Fengyun. Study Multiple Sevices of the Random Onder Picking System about Distribution Center[J], Management Engineering and Applications.2010: 283-288.
[126]E.M.M.Winands, I.J.B.F.Adan and G.J.van. Houtum. A two queue model with alternating limited service and state-dependent setups[A]. In:Proceedings of Analysis of Manufacturing Systems Production Management[C].2005, Zakynthos, Page (s):200-208.
[127]H. Levy, M. Sidi. Polling systems:applications, modeling and optimization[J]. IEEE Transactions on Communications,1990,38 (10):1750-1759.
[128]Boxma O. J.Wal J. van der and Yechiali U. Polling with batch service. Stochastic Models,2008, 24 (4):604-625.
[129]Onno Boxma, Josine Bruin, Brian Fralix. Sojourn times in polling systems with various service disciplines[J]. Performance Evaluation,2009,66 (5):621-639.
[130]Martin Eisenberg. Two queues with changeover times[J]. Operations Research.1971,19(2): 386-401.
[131]Alan G. Konheim, Bernd Meister. Service in a loop system[J]. Journal of the Association for Computing Machinery.1972,19 (1):92-108.
[132]Hashida O. Analysis of multiqueue[J]. Rev. Elect. Commun. Lab,1972,20 (3-4):189-199.
[133]P. Humblet. Source coding for communication concentrators[J]. Electron. Syst. Lab., Massachusetts Inst. Technol., Cambridge, ESL-R-798, Jan.1978.
[134]M. J. Ferguson and Y. J. Aminetzah, Exact Results for Nonsymmetric Token Ring Systems[J], IEEE Trans. Commun., Mar.1985, COM-33:223-231.
[135]Konheim A. G. Descendent set:an efficient approach for analysis of polling systems[J]. IEEE Transactions on Communications,1994,42 (8):1244-1253.
[136]陈希孺,郑忠国.现代数学手册(随机数学卷)[M].中科技大学出版社,2000年12月.
[137]Martin Eisenberg. Two Queues with Changeover Times [J]. Operations Research, Mar.-Apr. 1971,19 (2):386-401.
[138]李诗珍.配送中心拣货作业优化设计与控制研究[D],西南交通大学博士论文,2008年.
[139]Wang Z.Song Y. Q.Yu H. B. Sun Y. X.. Stability analysis for multi class multi queue single server system under polling table. In:Proceedings of the 2002 American Control Conference, Alaska, USA, 2002,6:4732-4737.
[140]Wang Z., Song Y. Q., Yu H. B., Sun Y. X.. Characteristic of multi message multi queue single server system. In:Proceedings of the IEEE Control Systems Society Conf erence on Cont rol Applications, Glasgow, Scotland,2002,536-641.
[141]王明贵,赵东风,丁洪伟,赖欲平.服务2类业务的轮询系统性能分析[J].云南大学学报(自然科学版),2010,32(2)：147-151.
[142]王智,申兴发,于海斌等.两类服务对象轮询模型的平均运行周期[J].计算机学报,2004,27(9)：1213-1220.
[143]King P. J. B.. Coputer Communication Systems Performance Modeling[M]. Cambridge, Great Britain:Prentice Hall International (UK) Ltd.1990.
[144]Peter J. B King. Computer communication systems performance modeling[M], Pretence Hall, 1990.
[145]A. G. Konheim. Waiting lines and times in a system with polling, J. ACM,1979:470-490.
[146]P. J. Kuehen. Multi-queue system with nonexhaustive cycle serve. Bell Syst. Tech. J.1979: 671-698.
[147]H. Takagi. Queuing analysis of polling system[J]. ACM Computing Surveys.1988,20(1): 4-28.
[148]H. Takagi. Mean message waiting time in symmetric multi-queue systems with cycle serve [J]. Performance Evaluation,1985:271-277.
[149]Oliver C. Ibe, Xian Cheng. Stability condition for multi-queue systems with cyelic servefJ]. IEEE Trans on Automatic Control,1988:102-103.
[150]李剑,胡波,赵东风.一种提供时延Qos保障的无线网络MAC协议[J].电子学报,2005,33(7)：1168-1172.
[151]Tao Li, Logothetis D, Veeraraghavan M. Analysis of a polling system for telephony traffic with application to wireless LANs[J]. IEEE Transactions on Wireless Communications,2006,5(6):1284-1293.
[152]V. M. Vishnevskii, O. V. Semenova. Mathematical methods to study the polling systems[J]. Automation and Remote Control,2006,67 (2):173-220.
[153]A. Wierman, E. M. M. Winands, O. J. Boxma. Scheduling in polling systems[J]. Performance Evaluation,2007,64:1009-1028.
[154]Mei R. D. van der, Winands E. M. M.. Heavy traffic analysis of polling models by mean value analysis[J]. Performance Evaluation,2008,65 (6-7):400-416.
[155]Ben-Jye Chang, Yan-Ling Chen. Adaptive hierarchical polling and Markov decision process based CAC for increasing network reward and reducing average delay in IEEE 802.16 WiMAX networks[J]. Computer Communications,2008,31 (10):2280-2292.
[156]Beekhuizen P., Denteneer D., Resing J. A. C. Reduction of a polling network to a single node[J]. Queueing Systems:Theory and Applications,2008,58 (4):303-319.
[157]Boxma O. J., Wal J. van der, Yechiali U.. Polling with batch service[J]. Stochastic Models, 2008,24 (4):604-625.
[158]S.C. Horng, S. Y. Lin. Ordinal optimization of G/G/1/K polling systems with k-limited service discipline[J]. Journal of Optimization Theory and Applications,2009,140 (2):213-231.
[159]E. M. M. Winands, I. J. B.F.Adan, G. J. Van ho utum, D. G. Down. A state-dependent polling model with k-limited service[J]. Probability in the Engineering and Informational Sciences,2009,23 (2): 384-408.
[160]王明贵,赵东风,丁洪伟,赖裕平.优先队列二级址门限服务的轮询系统分析[J].计算机工程与应用,2009,45(22)：94-96.
[161]王菽兰,赵东风,丁洪伟.两种轮询服务有限级排队系统的研究[J].云南大学学报,2005,27(5A)：308-312.
[162]B. Sikdar. An analytic model for the delay in IEEE 802.11 PCF MAC based wireless networks. IEEE Transactions on Wireless Communications,2007,6 (4):1542-1560.
[163]Zsolt Saffer, Miklos Telek. Stability of periodic polling system with BMAP arrivals[J]. European Journal of Operational Research,2009,197 (1):188-195.
[164]Bilpab Sikdar. An analytic model for the delay in IEEE 802.11 PCF MAC based wireless networks[J]. IEEE Trans. Wireless Commun,2007,6 (4):1542-1560.
[165]冉文学.卷烟销售自动化配送中心的研究[M],西北工业大学硕士论文,2004年5月.
[166]赵东风.时隙式随机争用多址系统分析方法研究[J],《通信学报》,1999年8月,20(8)：80-85.
[167]M. A. A. Boon, E. M. M. Winands, I. J. B. F. Adan, A. C. C. van Wijk. Closed-form waiting time approximations for polling systems[J]. Performance Evaluation,2011,68 (3):290-306.
[168]Elie Inaty. A multiservice WLAN using a radio resource scheduler[J]. European Transactions on Telecommunications,2010,21(1):90-100.
[169]张宇眉,张欣,杨大成,赵东风.基于等待时间和信道状态的轮询多址协议[J].北京邮电大学学报,2008,31(4)：126-129.
[170]赵东风,丁洪伟,赵一帆等.多级门限服务轮询系统MAC离散时间控制协议模型分析[J].电子学报,2010,38(7)：1494-1499.
[171]YANG Zhijun, ZHAO Dongfeng. QoS support polling scheme for multimedia traffic in wireless LAN MAC protocol. Tsinghua Science and Technology,2008,13(6):754-758.
[172]LIU Qianlin, ZHAO Dongfeng. Priority polling strategy for wireless sensor networks[A]. In: Proceeding of IEEE International Conference on Information Science and Engineering (ICISE 2009) [C]. December 2009, Nanjing, China, Page (s):4062-4065.
[173]Bao Liyong, Zhao Dongfeng, Ding Hongwei. A Dynamic Scheme for Multimedia Support in IEEE802.11 Wireless Network.2010 the 2nd International Conference on Signal Processing Systems (ICSPS 2010),4-7 July 2010, Vol.1, Dalian, China,828-832.
[174]Koh S. G, Kwon H. M., Kim Y. J.. An analysis of the end-of-aisle order Picking system: Multi-aisle served by a single order Pieker [J]. International Journal of production Economies,2005,98 (2):162-271.
[175]E. M. M. Winands, I. J. B. F. Adan and G. J. van. Houtum. A two queue model with alternating limited service and state-dependent setups[A]. In:Proceedings of Analysis of Manufacturing Systems Production Management[C].2005, Zakyntho, Page (s):200-208.
[176]DeKoster M. B. M., J. Neuteboom. The logistics of supermarket chains[M], Elsevier, Doetinehem,2001.
[177]Kamarminen V., Saranen J. and Holmstrom J. The reception box impact on home delivery effielency in the e-grocery business[J], International Journal of Physleal Distribution and Logistics Management,2001, Vol.31, No.6:414-426.
[178]Tom Hays, Pinar Keskinoeak, Virginia Maleome de Lopez.. Strategies and challenges of intemet grocery retalling logltics [J]. Forthcoming in Application of Supply Chain Management and E-Commerce Researeh, (2004), The Neitherland.
[179]梁竹关.离散时间完全服务两级轮询系统理论研究[D].云南大学博士学位论文,2010.5.
[180]肖际伟.配送中心分拣系统优化[D].济南：山东大学,2010.
[181]吴颖颖,吴耀华.基于并行拣选的自动拣选系统订单拆分优化[J].计算机集成制造系统,2012,10, Vol.18, No.10:2264-2271.
[182]官铮.离散时间并行调度两级服务与非对称门限服务轮询系统理论研究[D].云南大学博士学位论文,2012.12.
[183]李晓春.配送中心拣货作业设计与优化[D].暨南大学博士研究生学位论文,2009.
[184]王艳艳,吴耀华,孙国华,于洪鹏.配送中心分拣订单合批策略的研究[J].山东大学学报
(工学版),2010(2)：43-46.
[185]张贻弓,吴耀华.基于并行拣选策略的自动拣选系统品项分配[J].计算机集成制造系统.2010(08)：1720-1725.
[186]郭进,江志斌.紧固件分拣中心拣选策略的动态EIQ分析[J].科学技术与工程.2012(4)：2655-2659.
[187]王艳艳,吴耀华,吴颖颖.并行自动拣选系统品项拣选量拆分优化[J].机械工程学报,2013(16)：177-184
[188]LAU Henry Y. K, ZHAO Ying. Joint seheduling of material handling equipment in automated air cargo terminals[J].Computers in Industry,2006,57:398-41.
[189]Dallari F., Marchet G., Melaeini M.. Design of order pickingsystem[J]. The International Journal of Advanced Manufacturing Technology,2009,42:1-12.
[190]王华.拣货系统布局选择的决策模型与应用[J].物流技术,2011(2)：67-72.
[191]杨琼华,高超,刘秀菊,刘国庆.基于TaraVRbuilder的快件分拣系统建模与仿真[J].重庆科技学院学报.2012(13)：70-72.
[192]蔺媛媛,刘云.立体仓库固定货架拣选路径优化的蚁群算法研究[J].中国西部科技.2010(11)：43-47.
[193]邵刘霞等.基于遗传算法的人工订单拣选路径优化研究.物流技术,2012(21)：76-80..
[194]陆园,洪跃.多目标下的自动化立体仓库拣选作业路径优化[J].机械制造.2012(3)：84-87.
[195]Yeming Gong and Rene De Koster. A polling-based dynamic order picking system for online retailers. HE Transactions,2008(40):1070-1082.
[196]ForresterResearch公司报告, http://www.forrester.com/eBusiness-Channel-Strategy.2013.
[197]Ben-Jye Chang, YanLing Chen. Adaptive hierarchical polling and Markov decision process based CAC for increasing network reward and reducing average delay in IEEE 802.16 WiMAX networks[J]. Computer Communications,2008,31(10):2280-2292.
[198]ZHAO Liqiang, ZHANG Jie, ZHANG Hailin. Hub-polling-based IEEE 802.11 PCF with integration QoS differentiation[J]. Wireless Communications and Mobile Computing,2009,9:1220-1230.