Test instances for the job shop scheduling problem with flexible maintenance planning and double due dates
收藏DataCite Commons2025-09-23 更新2025-04-17 收录
下载链接：
https://research.lancaster-university.uk/en/datasets/73ed33da-04c2-42e7-ab81-ae5ae7ed5ca5
下载链接
链接失效反馈官方服务：
资源简介：
These test instances were created to test the algorithms presented in Ivar
Struijker Boudier's PhD thesis, titled "Job Shop Scheduling with
Flexible Maintenance Planning" (2017). A full description of the test
instances can be found in the thesis. The algorithms in the thesis solve
the job shop scheduling problem with flexible maintenance activities and
double due dates. The test problems are suitable for both the blocking and
the non-blocking variants of this problem.
提供机构：
Lancaster University
创建时间：
2017-07-13
