Perfect matching instances
收藏官方服务：
资源简介：
A set of perfect matching instances for the P||Cmax problem. 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. 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.
提供机构：
Zenodo创建时间：
2023-12-18
