Flexible job-shop scheduling problem with resource recovery constraints
Jobish Vallikavungal Devassia,
M. Angélica Salazar-Aguilar and
Vincent Boyer
International Journal of Production Research, 2018, vol. 56, issue 9, 3326-3343
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.
Date: 2018
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2017.1420262 (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:taf:tprsxx:v:56:y:2018:i:9:p:3326-3343
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20
DOI: 10.1080/00207543.2017.1420262
Access Statistics for this article
International Journal of Production Research is currently edited by Professor A. Dolgui
More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().