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

Resolution of the two-part cyclic hoist scheduling problem with bounded processing times in complex lines' configuration

Author

Listed:
  • Adnen El Amraoui
  • Marie-Ange Manier
  • Abdellah El Moudni
  • Mohamed Benrejeb

Abstract

The performance of an enterprise largely depends on the schedule of its resources. A good schedule may increase the output rate and reduce the production costs. Therefore, in this paper, we consider the cyclic schedule of hoist activities in automated electroplating lines which is commonly known as cyclic hoist scheduling problem (CHSP). The CHSPs appear in the manufacturing facilities to achieve a mass production and to search a repetitive sequence of moves for the hoist. In such kind of lines, hoist is used for moving electroplates through a line of tanks containing chemical baths. In this paper, we first study the impact of non-fixed processing time in cycle duration and then we extend our elaborated two-degree cyclic model to a more complex configuration of the production lines. [Received 26 June 2010; Revised 14 November 2010; Accepted 15 February 2011]

Suggested Citation

  • Adnen El Amraoui & Marie-Ange Manier & Abdellah El Moudni & Mohamed Benrejeb, 2012. "Resolution of the two-part cyclic hoist scheduling problem with bounded processing times in complex lines' configuration," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(4), pages 454-473.
    • Handle: RePEc:ids:eujine:v:6:y:2012:i:4:p:454-473
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=47661
    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.

    Citations

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


    Cited by:

    1. Feng, Jianguang & Che, Ada & Chu, Chengbin & Levner, Eugene & Kats, Vladimir, 2024. "Scheduling robotic cells with fixed processing times or time windows: Classification, solution approaches, polynomial algorithms and complexity," European Journal of Operational Research, Elsevier, vol. 319(2), pages 468-483.

    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:6:y:2012:i:4:p:454-473. 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.