Flexible job-shop scheduling problem with resource recovery constraints

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...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research 2018-05, Vol.56 (9), p.3326-3343
Main Authors: Vallikavungal Devassia, Jobish, Salazar-Aguilar, M. Angélica, Boyer, Vincent
Format: Article
Language:English
Subjects:
Brewing
flexible job-shop scheduling problem
Heuristic methods
Job shops
makespan
Production scheduling
Recovery time
resource constraints
Resource recovery
Resource scheduling
variable neighbourhood search
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2017.1420262