Optimal Batching in a Semi-Automated Order Picking System

Journal of the Operational Research SocietyPublished 1 August 1979

Ronald D. Armstrong, Wade D. Cook, Alan Saipe

DOI10.1057/jors.1979.173

Source URL

Citations63

SJR quartileQ1

SJR score0.92

SNIP1.26

TL;DR

The use of Management Science techniques to batch orders in a semi-automated order-picking system of a Canadian provincial liquor board is discussed.

Abstract

As the materials handling revolution continues, the techniques of Management Science are finding more and varied application in the design and operation of production and distribution systems. This paper discusses the use of these techniques to batch orders in a semi-automated order-picking system of a Canadian provincial liquor board. The problem is formulated as a mixed-integer programming problem with the objective of arranging orders into batches so that the processing time is minimised. A sample problem is presented and solved, and computational aspects are discussed. Other possible application areas are outlined.

Keywords

Engineering

International series in management science/operations research/International series in operations research & management scienceMulticommodity Distribution System Design by Benders Decomposition * † ‡

983 Citations2010Arthur M. Geoffrion, G. W. Graves§

Lagrangian Relaxation for Integer Programming

978 Citations2009Arthur M. Geoffrion

It is a pleasure to write this commentary because it offers an opportunity to express my gratitude to several people who helped me in ways that turned out to be essential to the birth of [8].

Management ScienceOptimal Storage Assignment in Automatic Warehousing Systems

630 Citations1976Warren H. Hausman, Leroy B. Schwarz +1 more

It is shown that significant reductions in crane travel time and distance are obtainable from turnover-based rules, and these improvements can be directly translated into increased throughput capacity for existing systems, and may be used to alter the design of proposed systems.

Management ScienceInteger Programming Algorithms: A Framework and State-of-the-Art Survey

353 Citations1972Arthur M. Geoffrion, Roy E. Marsten

A unifying framework is developed to facilitate the understanding of most known computational approaches to integer programming, and a number of currently operational algorithms are related to this framework.

Management ScienceStorage-Retrieval Interleaving in Automatic Warehousing Systems

304 Citations1977Stephen C. Graves, Warren H. Hausman +1 more

The results indicate that significant reductions in crane travel time and distance are obtainable in some real-world and previously modeled situations via the proposed storage assignment/interleaving policies, which may be directly translated into increased throughput capacity for existing systems.

Management SciencePractical Solution of Large Mixed Integer Programming Problems with Umpire

145 Citations1974J. J. H. Forrest, Jack Hirst +1 more

This paper discusses some branch and bound methods implemented in the UMPIRE mathematical programming system for solving practical integer programming problems and gives details of computational experience with these methods.

Operations ResearchSolving Constrained Transportation Problems

81 Citations1975Darwin Klingman, Robert A. Russell

The method is basically the primal simplex method, specialized to exploit fully the topological structure embedded in the problem, and couples the poly-ω technique of Charnes and Cooper with the row-column sum method to yield an “inverse compactification” that minimizes the basis information to be stored between successive iterations.

Mathematical ProgrammingImproved penalty calculations for a mixed integer branch-and-bound algorithm

19 Citations1974Ronald D. Armstrong, Prabhakant Sinha

This paper presents an extension of Tomlin's penalties for the branch-and-bound linear mixed integer programming algorithm of Beale and Small, and shows that this penalty can be computed with a little additional arithmetic and some extra bookkeeping.