Minimum number of resources in a perfect schedule

Published: 26 September 2022| Version 1 | DOI: 10.17632/2zn9jymfc7.1
Contributor:
Rachid Benmansour

Description

Each file is named NxUy where x is the number of jobs and y is the upper bound of the discrete uniform distribution U[1, y] from which the processing times were generated. Each file contains 10 instances. The first line of the file represents the number of jobs in each instance. The following lines (ten in total) contain the processing time of the jobs.

Files

Steps to reproduce

Please follow the instructions in the description to (re)generate these instances or others with a larger number of jobs.

Categories

Deterministic Scheduling Theory

Licence