scientific article; zbMATH DE number 7453120

MaRDI QIDQ5020564

Giacomo da Col, Erich Christian Teppan

Publication date: 6 January 2022

Full work available at URL: https://arxiv.org/abs/1909.08247

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints

Uses Software

• JOBSHOP
• MiniZinc
• ILOG SCHEDULE
• CP Optimizer

Cites Work

• Temporal linear relaxation in IBM ILOG CP optimizer
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• Benchmarks for basic scheduling problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• Failure-Directed Search for Constraint-Based Scheduling

This page was built for publication: