IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v44y2012i3p230-248.html
   My bibliography  Save this article

Scheduling robotic cells served by a dual-arm robot

Author

Listed:
  • Neil Geismar
  • U. Manoj
  • Avanthi Sethi
  • Chelliah Sriskandarajah

Abstract

This article assesses the benefits of implementing a dual-arm robot in a flow shop manufacturing cell. Such a robot has the ability to tend (unload or load) to two adjacent machines simultaneously. This significantly changes the analysis required to find sequences of robot actions that maximize a cell's throughput. For cells processing identical parts, optimal sequences are identified for two- and three-machine cells and also structural results are derived for cells with an arbitrary number of machines. Cells processing different part-types are fully analyzed for the case of two-machine cells. For each case the productivity of single-arm and dual-arm robotic cells is compared.

Suggested Citation

  • Neil Geismar & U. Manoj & Avanthi Sethi & Chelliah Sriskandarajah, 2012. "Scheduling robotic cells served by a dual-arm robot," IISE Transactions, Taylor & Francis Journals, vol. 44(3), pages 230-248.
    • Handle: RePEc:taf:uiiexx:v:44:y:2012:i:3:p:230-248
    DOI: 10.1080/0740817X.2011.618174
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2011.618174
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2011.618174?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xin Li & Richard Y. K. Fung, 2016. "Optimal K-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times," Journal of Scheduling, Springer, vol. 19(2), pages 165-176, April.

    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:uiiexx:v:44:y:2012:i:3:p:230-248. 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/uiie .

    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.