Proven optimal solutions for the RCPSP-AS benchmark ASLIB0: code, results and verified schedules

Supplementary code and data for the article Proven Optimal Solutions for Resource-Constrained Projects with Alternative Subgraphs: Constraint Programming, Selection Hints and Learning (M. Bara, J. Torres-Pruñonosa and S. del-Canto-García). Contents: per-instance results of a 60-second CP-SAT run on all 36,000 ASLIB0 instances (29,822 proven optimal); complete schedules for the 11,909 instances whose published best makespan is improved, each verified by an independent checker; the constraint programming model, the checker and the scripts for the experiments, tables and figures. The benchmark instances are not redistributed; see README.md. Version 1.1 updates the README to the article title. Version 1.0 (published 1 November 2026) contains the same results. SHA-256 of aslib0_supplementary.zip (v1.1): 3a69d91f32f54d98d7b124592138086ae34d7b1c8ec2db4aba69171a02c95227