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