25 citations · 27 across the 2 of their papers we have counts for
2 papers
cs.DS2021★ 2 cited
Large-Scale Benchmarks for the Job Shop Scheduling Problem
Giacomo Da Col, Erich Teppan
This report contains the description of two novel job shop scheduling benchmarks that resemble instances of real scheduling problem as they appear in industry. In particular, the a…
cs.AI2019★ 25 cited
Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem
Giacomo Da Col, Erich Teppan
The job-shop scheduling is one of the most studied optimization problems from the dawn of computer era to the present day. Its combinatorial nature makes it easily expressible as a…