Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
DOI10.1007/s10601-021-09321-wOpenAlexW3170953471MaRDI QIDQ2074672
Urs Fontana, Florian Herzog, Anastasia Salyaeva, Kai Waelti, Josef Bürgler, Marc Pouly, Jana Koehler, Sophia Saller, Etienne Fux, Peter Scheiblechner
Publication date: 10 February 2022
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.12862
constraint optimizationMIPbenchmarking CP-SATOMT solverssoft coupled task schedulingtour-dependent edge costsTSP with precedence constraints
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed integer programming models for job shop scheduling: A computational analysis
- Single-machine scheduling with precedence constraints and position-dependent processing times
- The maximum flow problem with disjunctive constraints
- On the maximum acyclic subgraph problem under disjunctive constraints
- Using dual presolving reductions to reformulate cumulative constraints
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Scheduling coupled-operation jobs with exact time-lags
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Soft car sequencing with colors: lower bounds and optimality proofs
- Resolution for Max-SAT
- Automatically improving constraint models in Savile Row
- ``Almost-stable matchings in the hospitals/residents problem with couples
- The pickup and delivery traveling salesman problem with handling costs
- A dynamic vehicle routing problem with time-dependent travel times
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Debugging unsatisfiable constraint models
- Dominance breaking constraints
- The traveling salesman problem and its variations.
- Time dependent vehicle routing problem with a multi ant colony system
- On converting CNF to DNF
- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
- Permutation Problems and Channelling Constraints
- Cores in Core Based MaxSat Algorithms: An Analysis
- Topological sorting of large networks
- THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- An Asymptotic, Probabilistic Analysis of a Routing Problem
- Approximating Capacitated Routing and Delivery Problems
- Reducibility among Combinatorial Problems
- On SAT Modulo Theories and Optimization Problems
- On the complexity of coupled-task scheduling
This page was built for publication: Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
