关键词: 柔性物流仓库, Kiva充电策略, 调度算法, 半定规划, 局部搜索

Abstract: Aiming at the charging scheduling of automatic carrier robots Kiva in the flexible automatic warehouse,the scheduling model by taking minimal sum of weighted waiting time as the optimization was proposed.This kind of scheduling problem is NP-hard.As a result,a new approximation algorithm was devised to decompose the original problem into several sub-problems,which were transformed with semi-definite relaxation and tackled by the semi-definite programming based approach.Then a tailored local search algorithm was employed to derive the detailed sequence of each sub-problem,which was applied to construct the charging scheduling of the original problem.A series of computational experiments demonstrated that the proposed algorithm outperformed several known methods in terms of quality of solutions.

Key words: flexible warehouse, Kiva charging strategy, scheduling algorithm, semi-definite programming, local search