280
Views
65
CrossRef citations to date
0
Altmetric
Original Articles

Order batching algorithms and travel-time estimation for automated storage/retrieval systems

&
Pages 1097-1114 | Received 01 Jul 1988, Published online: 28 Mar 2007
 

SUMMARY

In this paper we present heuristics and analytical models for the order batching problem. Orders are batched into tours such that the total travel time is minimized. Four heuristics are developed for the order batching problem, for which no exact solution exists. All heuristics are based on the time-saving criterion of combining two or more orders in a single tour rather than processing them one order at a time. Among the heuristics that are presented, the SL algorithm has the best performance. An analytical model is developed to estimate the travel time of the S/R machine as a function of the number of locations to be visited and the physical specifications of the structure. Expressions for upper and lower bounds for travel time are presented.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.