scientific article; zbMATH DE number 7453120

MaRDI QIDQ5020564zbMATH OpenFDO

Authors Giacomo da Col, Erich Christian Teppan

Publication date 6 January 2022

Full work available at URL https://arxiv.org/abs/1909.08247, http://eptcs.web.cse.unsw.edu.au/paper.cgi?ICLP2019.30

Mathematics Subject Classification ID

Logic programming (68N17)

Cites work

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

Cited in

(2)

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

Describes a project that uses

Uses Software

• JOBSHOP
• MiniZinc
• ILOG SCHEDULE
• CP Optimizer

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020564)