Name
Abstract | ||
|---|---|---|
In this paper, the final stage of a multiphase approach for solving the picking problem in a warehouse is addressed. Given a number of agents, each with its own set of picking sequences (trips or routes) to accomplish, a dispatching problem is described and shown to have a non-polynomial search space with respect to the number of agents and number of routes. A simulation-based scheduling procedure is proposed to solve the problem. The aim is to reduce potential delays induced by agent queues. Extensive statistical simulations on a realistic warehouse operating at varying conditions are conducted to show that the said dispatching procedure is able to make significant improvements with respect to minimizing operating time, on the average, over the case when no dispatching policy is applied to the agents. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ROBOT.2006.1641911 | 2006 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), VOLS 1-10 |
Keywords | Field | DocType |
warehouse scheduling, dispatching, scheduler, warehouse automation, multiple-agents | Warehouse,Operating time,Scheduling (computing),Queue,Control engineering,Multi-agent system,Real-time computing,Precision engineering,Engineering,TRIPS architecture,Mobile robot,Distributed computing | Conference |
Volume | Issue | ISSN |
2006 | 1 | 1050-4729 |
Citations | PageRank | References |
5 | 0.63 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jose Ildefonso U. Rubrico | 1 | 10 | 3.84 |
| Jun Ota | 2 | 527 | 109.77 |
| Toshimitsu Higashi | 3 | 18 | 6.33 |
| Hirofumi Tamura | 4 | 13 | 2.70 |