Order Picking in an Aisle,

Abstract

A classical order picking problem is the case where items have to be picked from both sides of an aisle and the picker cannot reach items on both sides simultaneously. Hence the picker must cross the aisle one or more times. Efficient optimal algorithms are developed for the cases where the picker enters and exits the aisle at the same end or at opposing ends. For all practical aisle widths and number of picks in an order, it is more efficient to enter and exit the aisle at opposing ends. The algorithms can be implemented in real time on a microcomputer. An optimal fixed picking sequence, suitable for implementation in a manual system is also developed and compared with the optimal policy.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1984
Accession Number
ADA149553

Entities

People

  • H. D. Ratliff
  • M. Goetschalckx

Organizations

  • Georgia Tech

Tags

Communities of Interest

  • Cyber

DTIC Thesaurus Topics

  • Algorithms
  • Circuits
  • Computations
  • Computers
  • Convex Sets
  • Engineering
  • High Density
  • Industrial Engineering
  • Mainframe Computers
  • Military Research
  • Printed Circuits
  • Sequences
  • Standards
  • Structural Properties
  • Systems Engineering
  • Transitions

Fields of Study

  • Engineering

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Canadian European Scientific Immigration and Epilepsy Clearance Studies
  • Combustion and Flow Dynamics.