Title: An unrelated parallel machines model for an industrial production resetting problem

Authors: Cedric Pessan, Jean-Louis Bouquard, Emmanuel Neron

Addresses: LI, University Francois-Rabelais Tours, 64 Avenue Jean Portalis, 37200 Tours, France. ' LI, University Francois-Rabelais Tours, 64 Avenue Jean Portalis, 37200 Tours, France. ' LI, University Francois-Rabelais Tours, 64 Avenue Jean Portalis, 37200 Tours, France

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.

DOI: 10.1504/EJIE.2008.017349

European Journal of Industrial Engineering, 2008 Vol.2 No.2, pp.153 - 171

Published online: 01 Mar 2008 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article