Dra. Angélica Salazar Aguilar
FIME – UANL
In this talk, a Flexible Job-shop Scheduling Problem with Resource Recovery Constrains (FRRC) is described in the FRRC, besides the constrains of the classical Flexible Job-shop Scheduling Problem (FJSP), operations may require resources to be processed. The resources are availables in batches and a recovery time is required between each batch. The objective is to schedule the operations such that the makespan is minimized. A mathematical formulation ans a metaheuristic based on General Variable Neighborhood Search are presented. Computational results over a large set of instances, adapted from the FJSP literature, are analyzed.