- The first line indicates the value x considered to compute the maximum number of groups which can be active simultaneously. In the tight instances, the limit L on the number of active groups is equal to x*30/100; in the loose instances, it is equal to x*70/100.
- The second line indicates the number of machines m.
- The next m lines describe the machines. Given a line among these m ones, the fields are separated by commas.
- The first field indicates the speed of the machine (the processing time of a job is equal to its duration times the speed of the machine.
- The second field indicates the time at which the machine starts (it is the number of milliseconds from time 0).
- The third field indicates the start of the first break on the machine.
- The fourth field indicates the end of the first break on the machine.
- The fifth field indicates the start of the second break on the machine.
- The sixth field indicates the end of the second break on the machine.

- The remaining lines describe the jobs. Given a line among these ones, the fields are separated by commas.
- The first field is NOT used (in the application context, it indicates the customer. However it is not used for scheduling).
- The second field indicates the used article by the job. When two consecutive jobs use different articles, a 16 seconds sequence dependent setup-time is required.
- The third field indicates the release date of the job.
- The fourth field indicates the number of pieces needed for the job. It is used to compute the duration of the job. Each piece needs 3 seconds to be prepared. Hence the duration of the job is equal to the number in this fourth field times three seconds.
- The fifth field is NOT used (it indicates the number of pieces in each package. However the number of package is not used in our scheduling problem).
- The sixth field indicates the group of each job.
- The seventh field indicates the roll used to prepare the job. When two consecutive jobs use different rolls, a 60 seconds sequence dependent setup-time is required. (In particular, when two consecutive jobs use different rolls and different articles, a 76 seconds sequence dependent setup-time is required.)

nbPallets

nbMachines

speedMachine_1, startMachine_1, startFirstBreak_1, endFirstBreak_1, startSecondBreak_1, endSecondBreak_1, ...

speedMachine_2, startMachine_2, startFirstBreak_2, endFirstBreak_2, startSecondBreak_2, endSecondBreak_2, ...

...

speedMachine_m, startMachine_m, startFirstBreak_m, endFirstBreak_m, startSecondBreak_m, endSecondBreak_m, ...

customer_1 (unused), article_1, release-date_1, due-date_1, number of pieces_1, number of pieces in each package_1 (unused), group_1, roll_1

customer_2 (unused), article_2, release-date_2, due-date_2, number of pieces_2, number of pieces in each package_2 (unused), group_2, roll_2

...

- Lucas Groleaz, Samba Ndojh Ndiaye, and Christine Solnon. ACO with automatic parameter selection for a scheduling problem with a group cumulative constraint. In GECCO 2020 - Genetic and Evolutionary Computation Conference. 2020.
- Lucas Groleaz, Samba N. Ndiaye, and Christine Solnon. Solving the Group Cumulative Scheduling Problem with CPO and ACO. In Principles and Practice of Constraint Programming (CP). 2020.
- Lucas Groleaz. The Group Cumulative Scheduling Problem. PhD thesis. INSA Lyon, 2021.