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

Energy efficient scheduling in a robotic cell with a material handling robot serving two parallel machines

Author

Listed:
  • Çiya Aydoğan
  • Sinan Gürel

Abstract

As the robots take over more logistics tasks in factories, the energy consumption of material handling robots becomes a significant concern. This study considers a robotic cell with two parallel machines and a material-handling robot transporting parts between the machines and buffer locations. A set of parts is to be scheduled on the machines. Also, the robot's moves, activities, and speed have to be planned. While programming a robot, its speed can be easily adjusted. Speeding up a robot can reduce the makespan of a schedule while increasing the robot's energy consumption. A holistic scheduling approach is required to coordinate machines' and robot activities. We first present a mathematical formulation and reformulate it via second-order cone programming inequalities. Then, we develop heuristic search algorithms: a greedy search algorithm and two versions of the simulated annealing algorithm. We test the proposed solution methods' computational performance and demonstrate that the robot speed control strategy can achieve significant energy savings.

Suggested Citation

  • Çiya Aydoğan & Sinan Gürel, 2025. "Energy efficient scheduling in a robotic cell with a material handling robot serving two parallel machines," International Journal of Production Research, Taylor & Francis Journals, vol. 63(6), pages 2213-2230, March.
    • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:6:p:2213-2230
    DOI: 10.1080/00207543.2024.2398585
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2398585
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2024.2398585?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 search 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:6:p:2213-2230. 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.