英文翻译外文文献翻译43仓储控制堆垛系统，理论基础.docxVIP

PAGE  PAGE 7 附 录 Storage controlled pile-up systems, theoretical foundations Abstract： This paper presents the theoretical foundations for controlling pile-up systems. A pile-up system consists of one or more stacker cranes picking up bins from a conveyor and placing them onto pallets with respect to costumer orders. The bins usually arrive at a conveyor from an order picking system. We give a mathematical definition of the pile-up problem, define a data structure for control algorithms, introduce polynomial time algorithms for deciding whether a system can be blocked by making bad decisions, and show that the pile-up problem is in general NP-complete. For pile-up systems with a restricted storage capacity or with a fixed number of pile-up places the pile-up problem is proved to be solvable very efficiently. 1. Introduction A pile-up system usually consists of one or more stacker cranes which pick up bins from a conveyor and place them onto pallets. Vehicles take full pallets from pile-up places to trucks and bring new empty pallets to pile-up places. The conveyor at which the bins arrive is in general the back-end of an order picking system. To understand the problems involved when controlling pile-up systems we first sketch the operation mode of an order picking system. Most of our notations are adopted from [ 2] A customer order consists of a list of articles. The ordered articles have to be packed for delivery into bins of equal size. An order is divided into several order lists, one for each bin. The order list contains the articles and their quantities to be picked from shelf racks into the bin. Empty bins are placed at the beginning of a conveyor. A barcode containing the order list number is attached to each empty bin. The barcode is used to recognize automatically a bin at control positions. A common size of the bins is 60 cm × 40 cm× 35cm(1 × w× h). The conveyor transports the bins to the so-called picking stations. If some articles