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

Adnen El Amraoui, Marie-Ange Manier, Abdellah El Moudni and Mohamed Benrejeb

European Journal of Industrial Engineering, 2012, vol. 6, issue 4, 454-473

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]

Keywords: cyclic hoist scheduling problem; CHSP; linear programming; time windows; flexibility; complex line configurations; bounded processing times. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=47661 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:6:y:2012:i:4:p:454-473

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().