XCSP 2.1 Benchmarks

---

cjssExtConvert

Lecoutre's category
PATT (Patterned instances) - Job-Shop
Lecoutre's tooltips
These problems are derived from classical job-shop scheduling problems by multiplying the number of jobs and the capacity of the resources (that is, the number of machines) by the given factor. The makespan value is also specified. For example, ft06x2-55.xml is obtained from ft10 multiplied by two with the makespan value 55. For more information, see this link , or/and consult [Laborie,"Complete MCS-based search: Application to resource constrained project scheduling", IJCAI-05], [Nuijten,"A computational study of constraint satisfaction for multiple capacitated job shop scheduling", European Journal of Operational Research, 90(2), 1996]. This series has been submitted by Naoyuki Tamura to the 2008 CSP solver competition and involves the global constraint cumulative.
Source
http://www.cril.univ-artois.fr/~lecoutre/research/benchmarks/cjss.tgz
Comments
None

Number of instances: 5 (0 processed, 0 partially processed, 5 failed)

Processing completed

Partially processed

Processing failed
ft06x2-54-ext
ft06x2-55
ft06x2-55-ext
ft06x3-54
ft06x3-54-ext