An unrelated parallel machines model for an industrial production resetting problem

Cedric Pessan, Jean-Louis Bouquard and Emmanuel Neron

European Journal of Industrial Engineering, 2008, vol. 2, issue 2, 153-171

Abstract: Efficient production resettings are necessary to achieve production flexibility. For this reason, most modern companies are trying to reduce the setup time required to switch the production from one product type to another. One way to minimise these times is to schedule correctly the various tasks involved during a production resetting: changing tools, modifying each machine setting, etc. In this paper, we present how this problem can be identified to an unrelated parallel machines problem with release dates and delivery times where the resources are operators. We show that the data structure allows simplifying the problem into an assignment problem, even when we take into consideration the availability constraints of the operators. A branch-and-bound method is presented which has been tested on industrial and generated instances. [Received 6 February 2007; Revised 22 August 2007; Accepted 11 November 2007]

Keywords: unrelated parallel machines; machine scheduling; branch-and-bound; production resetting; availability constraints; production flexibility. (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=17349 (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:2:y:2008:i:2:p:153-171

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 ().