IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v56y2018i9p3326-3343.html
   My bibliography  Save this article

Flexible job-shop scheduling problem with resource recovery constraints

Author

Listed:
  • Jobish Vallikavungal Devassia
  • M. Angélica Salazar-Aguilar
  • Vincent Boyer

Abstract

In this work, we introduce a Flexible Job-shop Scheduling Problem with Resource Recovery Constraints (FRRC). In the FRRC, besides the constraints of the classical Flexible Job-shop Scheduling Problem (FJSP), operations may require resources to be processed. The resources are available in batches and a recovery time is required between each batch. This problem is inspired by a real situation faced by a brewing company where different yeasts are available in a limited quantity and are recovered only once they have been completely used. The objective is to schedule the operations such that the makespan is minimised. A mathematical model and a metaheuristic based on a General Variable Neighborhood Search is proposed for the solution of the FRRC. Computational results over a large set of instances, adapted from the FJSP literature, are presented.

Suggested Citation

  • Jobish Vallikavungal Devassia & M. Angélica Salazar-Aguilar & Vincent Boyer, 2018. "Flexible job-shop scheduling problem with resource recovery constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 56(9), pages 3326-3343, May.
    • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:9:p:3326-3343
    DOI: 10.1080/00207543.2017.1420262
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1420262
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2017.1420262?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:56:y:2018:i:9:p:3326-3343. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.