Skip to main content
zenodoopen

Perfect matching instances

<p>A set of perfect matching instances for the P||Cmax problem.</p> <p>They are formatted in JSON. In each instance entry, n is the number of jobs, m the number of machines, P is the list of processing times.</p> <p>A perfect matching instance (P, m) is such that m divides sum(P) and it exists a schedule such that each machine load and the makespan are equal to sum(P)/m.</p>

ShareScore

32/100

Overall dataset sharing score

Score breakdown

These five areas show where the dataset supports — or may limit — practical reuse.

Stewardship
4
Harmonization
4
Access
16
Reuse readiness
8
Engagement
0

ScienceDex for faculty

Your academic CV and NIH biosketch

Make your CV in your school's format and your NIH biosketch from it, then download both as Word files.