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


Home / Kontakt / Webmaster / Offenlegung gemäß § 25 Mediengesetz: Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. Disclaimer / Datenschutzerklärung