IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v8y2014i2p143-167.html
   My bibliography  Save this article

Optimal cyclic scheduling of a robotic flowshop with multiple part types and flexible processing times

Author

Listed:
  • Weidong Lei
  • Ada Che
  • Chengbin Chu

Abstract

This paper proposes a branch-and-bound algorithm for cyclic scheduling of a robotic flowshop with multiple part types in which the processing times of parts can vary within their given time windows. The problem consists of two types of sequencing issues: part input sequencing and robot move sequencing. We give a formulation for the problem and propose a branch-and-bound algorithm based on the properties of the developed model. The proposed branch-and-bound algorithm consists of three nested procedures, called procedures A, B and C, respectively. Procedures A and B are mainly designed for enumerating part input sequences, while procedure C is responsible for numerating robot move sequences. To reduce the solution space and speed up the algorithm, we derive the upper bound of the number of parts that can be serviced by the robot within a cycle. Computational results on both benchmark and randomly generated instances are reported. [Received 19 August 2011; Revised 16 February 2012; Revised 29 June 2012; Accepted 22 July 2012]

Suggested Citation

  • Weidong Lei & Ada Che & Chengbin Chu, 2014. "Optimal cyclic scheduling of a robotic flowshop with multiple part types and flexible processing times," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 8(2), pages 143-167.
    • Handle: RePEc:ids:eujine:v:8:y:2014:i:2:p:143-167
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=60434
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:eujine:v:8:y:2014:i:2:p:143-167. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.