IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v63y2025i18p6758-6775.html
   My bibliography  Save this article

Sizing and scheduling for a fleet of reconfigurable mobile robots

Author

Listed:
  • Benoît Albert
  • Mari Chaikovskaia
  • Jean-Philippe Gayon
  • Alain Quilliot

Abstract

We consider a fleet of elementary robots that transport items within a warehouse. These elementary robots can be connected in different ways to transport loads of different types. The capacity of the resulting poly-robot depends on its configuration and on the load type being transported. For each load type, we have to meet a transportation demand within a given time interval. Several poly-robots may be required either simultaneously or sequentially to meet this demand. We have to decide how to decompose the demand into transportation tasks. A transportation task specifies the load type, the corresponding number of loads and the configuration of the involved poly-robot. The objective is to determine the transportation tasks and schedule them over time, in order to minimise the investment cost (related to the fleet size) and the running costs (related to the use of the fleet). We show that the resulting Multi-Bot problem is strongly NP-hard. We also study several special cases that can be solved in polynomial time and derive from our theoretical results an efficient heuristic for the general case. A numerical study shows that the heuristic algorithm is effective even for large instances.

Suggested Citation

  • Benoît Albert & Mari Chaikovskaia & Jean-Philippe Gayon & Alain Quilliot, 2025. "Sizing and scheduling for a fleet of reconfigurable mobile robots," International Journal of Production Research, Taylor & Francis Journals, vol. 63(18), pages 6758-6775, September.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:18:p:6758-6775
    DOI: 10.1080/00207543.2025.2487565
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2025.2487565
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2025.2487565?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:63:y:2025:i:18:p:6758-6775. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.