Improved bounds and proved optima on the MMLIB benchmark for multi-mode resource-constrained project scheduling

Certificates for 83 results on 81 distinct instances of the MMLIB benchmark for the multi-mode resource-constrained project scheduling problem (MRCPSP): 34 instances closed by proving the optimum, 46 with a raised lower bound and still open against the reference table (one of them, j508_5, is closed when combined with a published upper bound), and 1 independent confirmation. In addition, three instances carry a schedule shorter than the one listed.

Every claim is stated against one specific reference and only that one: the table of best known values distributed with MMLIB release v2.1 (SHA-256 452f16c6f78f4c8936162185c1155c57dcffcf7a3dbe2f092ac82e979b6ab707), captured on 14 August 2026 and verified byte for byte against the live release on 2 September 2026. It is not stated against the literature: that table does not carry every published result, and the deposit documents two cases where published values from 2019 and 2021 are absent from it.

Each instance directory holds the claim and how it was checked, the certificate record of the run, the extract of the baseline row improved on and, where the claim includes one, the schedule.

This is a data and certificate deposit, not a paper: it records what was obtained and how a third party can check it, and does not describe how the solutions were found.

The results were emailed to the maintainers of the table on 18 August and 2 September 2026. No reply has been received, and nothing here has been verified or accepted by them.