Multiple Order Pick Sequencing in a Carousel System: A Solvable Case of the Rural Postman Problem
作者:
Van den BergJeroen P.,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1996)
卷期:
Volume 47,
issue 12
页码: 1504-1515
ISSN:0160-5682
年代: 1996
DOI:10.1057/jors.1996.194
出版商: Taylor&Francis
关键词: dynamic programming;production;rural postman problem;sequencing;warehousing
数据来源: Taylor
摘要:
AbstractWe consider the problem of sequencing picks in a set of orders on a single carousel. First we consider the situation in which the sequence of the orders is given. For this problem we present an efficient dynamic programming algorithm. Second, we consider the problem without a given order sequence. We simplify this problem to a Rural Postman Problem on a circle and solve this problem to optimality. Finally, we show that the solution of the Rural Postman Problem requires at most 1.5 revolutions more than a lower bound of an optimum solution to the original problem.
点击下载:
PDF (4802KB)
返 回