An unrelated parallel machines model for an industrial production resetting problem Online publication date: Sat, 01-Mar-2008
by Cedric Pessan, Jean-Louis Bouquard, Emmanuel Neron
European J. of Industrial Engineering (EJIE), Vol. 2, No. 2, 2008
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]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com