Test Laboratory Scheduling
The Test Laboratory Scheduling Problem (TLSP) arises in the context of a real-world industrial test laboratory.
It is related to the well-known Resource Constrained Project Scheduling Problem (RCPSP).
A detailed description of TLSP can be found in the following report: The Test Laboratory Scheduling Problem (PDF)
Data sets
All instance sets for TLSP available for download are listed here.
Currently, there are two datasets, LabStructure and General.
Both of these datasets are randomly generated based on real-world data.
They contain instances from 5 projects and 88 time slots up to 90 projects and 782 time slots.
All instances contain a base schedule with some fixed assignments and a complete grouping of tasks into jobs that has at least one feasible solution (see reference solution for each instance).
More details about the instance sets and the various parameters can be found in the report linked above.
This table will be extended once additional datasets become available.
|
|
|
|
|
|
|
Base schedule |
Data set |
Projects |
Time slots |
Scenario |
Equipment |
Task families |
Precedence |
Mode |
Perturbation |
Flags |
LabStructure |
5-90 |
88-782 |
Full Scheduling |
Lab equivalent |
Lab equivalent |
Ranked |
Delete |
1.0 |
Grouping constant |
General |
5-90 |
88-782 |
Full Scheduling |
General |
General |
General |
Delete |
1.0 |
Grouping constant |
A subset of these instances was used for evaluations.
It contains 15 instances each from the General and LabStructure data sets, chosen to cover the whole range of instance sizes.
The instances of this set are contained in this ZIP-Archive
Real world instances
These instances were taken (in anonymized form) from a real-world laboratory whose scheduling process is based on TLSP.
Each instance includes a README.txt file that contains additional information about the instance and schedule.
Download real-world instances
Publications
Journal
Conferences
-
Florian Mischek, Nysret Musliu.
Preference Explanation and Decision Support for Multi-Objective Real-World Test Laboratory Scheduling.
Accepted for publication in the Proceedings of the International Conference on Automated Planning and Scheduling. ICAPS 2024
-
Florian Mischek, Nysret Musliu.
Leveraging problem-independent hyper-heuristics for real-world test laboratory scheduling.
Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2023
-
Tobias Geibinger, Florian Mischek and Nysret Musliu.
Constraint Logic Programming for Real-World
Test Laboratory Scheduling.
AAAI 2021
-
Philipp Danzinger, Tobias Geibinger, Florian Mischek and Nysret Musliu.
Solving the Test Laboratory Scheduling Problem with Variable Task Grouping.
Proceedings of the International Conference on Automated Planning and Scheduling - ICAPS 2020
-
Florian Mischek, Nysret Musliu and Andrea Schaerf.
Local Search Neighborhoods for Industrial Test Laboratory Scheduling with Flexible Grouping.
accepted at PATAT2020
-
Tobias Geibinger, Florian Mischek and Nysret Musliu.
Investigating Constraint Programming for Real-World Industrial Test Laboratory Scheduling.
Proceedings of the 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research - CPAIOR 2019, Thessaloniki, June 4 - 7, 2019
Changelog
- 2024-12-12: Added two new real-world instances (Lab 4, Lab 5)
- 2023-08-14: Added Pareto front approximations for the TLSP benchmark instances
- 2020-05-04: Removed unused and obsolete soft constraint H6a&b
- 2019-10-30: Added real-world instances. Minor update for generated instances: Removed list of holidays, timeslots are no longer linked to specific dates.