Online rescheduling of multiple picking agents for warehouse management

Authors:
Jose I. U. Rubrico;Toshimitu Higashi;Hirofumi Tamura;Jun Ota
Affiliations:
Department of Precision Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan;Murata Machinery, Ltd., 2 Nakajima, Hashizume, Inuyama-shi, Aichi 484-0076, Japan;Murata Systems, Ltd., 3 Minamiochiai-cho, Kisshoin, Minami-ku, Kyoto 601-8326, Japan;Research into Artifacts, Center for Engineering (RACE), The University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba 270-8568, Japan
Venue:
Robotics and Computer-Integrated Manufacturing
Year:
2011

Citing 15
Cited 1

Amortized efficiency of list update and paging rules

Communications of the ACM
A vehicle routing improvement algorithm comparison of a “greedy” and a matching implementation for inventory routing

Computers and Operations Research
Parallel savings based heuristics for the delivery problem

Operations Research
On-line load balancing with applications to machine scheduling and virtual circuit routing

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A better lower bound for on-line scheduling

Information Processing Letters
New algorithms for an ancient scheduling problem

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
A better algorithm for an ancient scheduling problem

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Better Bounds for Online Scheduling

SIAM Journal on Computing
Discrete Online and Real-Time Optimization

IFIP World Computer Congress on Fundamentals - Foundations of Computer Science
On-line Load Balancing

Developments from a June 1996 seminar on Online algorithms: the state of the art
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching

Transportation Science
A reactive method for real time dynamic vehicle routing problem

ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
Better bounds for online load balancing on unrelated machines

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic vehicle routing with stochastic requests

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Modeling warehouse logistics using agent organizations

CARE@AI'09/CARE@IAT'10 Proceedings of the CARE@AI 2009 and CARE@IAT 2010 international conference on Collaborative agents - research and development

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a solution for a dynamic rescheduling problem involving new orders arriving randomly while static orders have been given in advance in warehouse environments. We propose two variations of an incremental static scheduling scheme: one based on the steepest descent insertion, called OR1, and the other, on multistage rescheduling, called OR2. Both techniques are enhanced by a local search procedure specifically designed for the problem at hand. We also implemented several existing online algorithms to our problem for evaluative purposes. Extensive statistical experiments based on real picking data indicate that the proposed methodologies are competitive with existing online schedulers and show that load-balancing algorithms, such as OR1, yield the best results on the average and that OR2 is effective in reducing the picking time when dynamism is low to moderate.