An order batching policy determines how orders are combined to form batches. Previous studies on order batching policy focused primarily on classic manual warehouses, and its effect on pick-and-pass systems has rarely been discussed. Pick-and-pass systems, a commonly used warehousing installation for small to medium-sized items, play a key role in managing a supply chain efficiently because the...

We present a new solution approach for short-term planning of batch production, which decomposes the problem into batching and batch scheduling. Batching converts the primary requirements for products into individual batches. We formulate the batching problem as a mixed-integer nonlinear program, which can be solved by standard software. Batch scheduling allocates the batches to scarce resource...

A bucket brigade strategy allows workloads in warehouses to be distributed with a minimal level of managerial planning and oversight. However, the variability and uncertainty of the pick locations within a particular order or batch often results in picker blocking and subsequent losses in productivity. This study formulates an order batching model for robust blocking control of dynamic bucket b...

We introduce on-line batching problems as a new class of on-line combinatorial problems. In an on-line batching problem the task is to chop batches from a growing queue of objects, such that the cost is minimized, where the cost consists of setup cost for each batch, processing cost for each batch, and holding cost for each object that is not processed immediately. For on-line batching problems...

Scalability is a key issue of on-line video service. Different methods have been proposed for the closed-loop video service, such as batching and patching. However, scalability itself has not been formally defined and the condition for a scalable system is not well studied yet. This paper studies scalability and the condition for scalable systems. It is found that when the arrival rate is acros...

In this work we develop a new algorithm for regularized empirical risk minimization. Our method extends recent techniques of Shalev-Shwartz [02/2015], which enable a dual-free analysis of SDCA, to arbitrary mini-batching schemes. Moreover, our method is able to better utilize the information in the data defining the ERM problem. For convex loss functions, our complexity results match those of Q...

In this work we investigate the problem of order batching and picker routing in storage areas. These are labour and capital intensive problems, often responsible for a substantial share of warehouse operating costs. In particular, we consider the case of online grocery shopping in which orders may be composed of dozens of items. We present a formulation for the problem based on an exponential n...

Parallel video servers provide highly scalable video-on-demand service for a huge number of clients. The conventional streamscheduling scheme does not use I/O and network bandwidth efficiently. Some other schemes, such as batching and streammerging, can effectively improve server I/O and network bandwidth efficiency. However, the batching scheme results in long startup latency and high reneging...

The key performance bottleneck for large-scale video-on-demand (VoD) systems is the server bandwidth, which controls the number of clients a video server can support. Two existing stream scheduling schemes can save server bandwidth significantly by using multicast method to transmit video data: the batching scheme and the patching scheme. However, the batching scheme results in long start-up la...