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

An unrelated parallel machines model for an industrial production resetting problem

Author

Listed:
  • Cedric Pessan
  • Jean-Louis Bouquard
  • Emmanuel Neron

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]

Suggested Citation

  • Cedric Pessan & Jean-Louis Bouquard & Emmanuel Neron, 2008. "An unrelated parallel machines model for an industrial production resetting problem," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 2(2), pages 153-171.
    • Handle: RePEc:ids:eujine:v:2:y:2008:i:2:p:153-171
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=17349
    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. Yunqiang Yin & Du‐Juan Wang & Chin‐Chia Wu & T.C.E. Cheng, 2016. "CON/SLK due date assignment and scheduling on a single machine with two agents," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(5), pages 416-429, August.

    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:2:y:2008:i:2:p:153-171. 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.