A decomposition heuristic for the twin robots scheduling problem

A decomposition heuristic for the twin robots scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor201524055
Volume: 62
Issue: 1
Start Page Number: 16
End Page Number: 22
Publication Date: Feb 2015
Journal: Naval Research Logistics (NRL)
Authors: , ,
Keywords: heuristics, programming: dynamic
Abstract:

This article provides an efficient heuristic based on decomposition for the twin robots scheduling problem (TRSP). TRSP concerns two moving robots executing storage and retrieval requests in parallel along a shared pathway. The depots are located at both ends of the line and a dedicated robot is assigned to each of them. While moving goods between their respective depots and some storage locations on the line, noncrossing constraints among robots need to be considered. Our heuristic uses a dynamic programming framework to determine the schedule of one robot while keeping the other one's fixed. It finds near‐optimal solutions even for large problem instances with hundreds of jobs in a short time span.

Reviews

Required fields are marked *. Your email address will not be published.