Graph-based heuristics for operational planning and scheduling problem in automatic picking system

3Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we study an operational planning and scheduling problem in an automatic picking system. This problem was introduced as a practical benchmark problem arising in logistics and involves assignment and scheduling tasks. We first show the NP-hardness of the problem. We then propose a graph-based heuristic algorithm for computing a good schedule of requests for a given assignment of products. The computational results for benchmark instances show that good schedules of requests are obtained in short computation time.

Cite

CITATION STYLE

APA

Imahori, S., & Hase, Y. (2016). Graph-based heuristics for operational planning and scheduling problem in automatic picking system. Journal of Advanced Mechanical Design, Systems and Manufacturing, 10(3). https://doi.org/10.1299/jamdsm.2016jamdsm0039

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free