Home > Research > Datasets > Test instances for the job shop scheduling prob...

Electronic data

View graph of relations

Test instances for the job shop scheduling problem with flexible maintenance planning and double due dates

Dataset

Description

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.
Date made available2017
PublisherLancaster University

Contact person

Relations

Research outputs