Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
type: Item
instance of: scholarly article
title: Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
author: Jana Köhler
author: Josef Bürgler
author: Urs Fontana
author: Etienne Fux
author: Florian Herzog
author: Marc Pouly
author: Sophia Saller
author: Anastasia Salyaeva
author: Peter Scheiblechner
author: Kai Waelti
published in: Constraints
publication date: 2022-02-10T00:00:00Z
full work available at URL: https://arxiv.org/abs/2011.12862
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7471953
zbMATH Keywords: TSP with precedence constraints
zbMATH Keywords: tour-dependent edge costs
zbMATH Keywords: soft coupled task scheduling
zbMATH Keywords: constraint optimization
zbMATH Keywords: benchmarking CP-SAT
zbMATH Keywords: MIP
zbMATH Keywords: OMT solvers
describes a project that uses: z3
describes a project that uses: CHUFFED
describes a project that uses: OptiMathSAT
describes a project that uses: MiniZinc
describes a project that uses: vZ
describes a project that uses: CPLEX
describes a project that uses: OR-tools
describes a project that uses: GitHub
MaRDI profile type: Publication
OpenAlex ID: W3170953471
cites work: On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
cites work: Soft car sequencing with colors: lower bounds and optimality proofs
cites work: Resolution for Max-SAT
cites work: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
cites work: Approximating Capacitated Routing and Delivery Problems
cites work: Q4012216
cites work: Dominance breaking constraints
cites work: Scheduling coupled-operation jobs with exact time-lags
cites work: Q5020564
cites work: Time dependent vehicle routing problem with a multi ant colony system
cites work: Q4418384
cites work: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
cites work: The traveling salesman problem and its variations.
cites work: A dynamic vehicle routing problem with time-dependent travel times
cites work: Using dual presolving reductions to reformulate cumulative constraints
cites work: Q5715662
cites work: Topological sorting of large networks
cites work: Reducibility among Combinatorial Problems
cites work: Mixed integer programming models for job shop scheduling: A computational analysis
cites work: THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
cites work: A General Bounding Scheme for the Permutation Flow-Shop Problem
cites work: Debugging unsatisfiable constraint models
cites work: ``Almost-stable'' matchings in the hospitals/residents problem with couples
cites work: On the maximum acyclic subgraph problem under disjunctive constraints
cites work: On converting CNF to DNF
cites work: An efficient genetic algorithm for the traveling salesman problem with precedence constraints
cites work: Cores in Core Based MaxSat Algorithms: An Analysis
cites work: On SAT Modulo Theories and Optimization Problems
cites work: Automatically improving constraint models in Savile Row
cites work: On the complexity of coupled-task scheduling
cites work: The maximum flow problem with disjunctive constraints
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: Q4473038
cites work: Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
cites work: An Asymptotic, Probabilistic Analysis of a Routing Problem
cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
cites work: Q3285992
cites work: Q4715981
cites work: The pickup and delivery traveling salesman problem with handling costs
cites work: Permutation Problems and Channelling Constraints
cites work: Single-machine scheduling with precedence constraints and position-dependent processing times

Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (DOI)
DOI: 10.1007/S10601-021-09321-W