An optimal constraint programming approach to the open-shop problem
From MaRDI portal
Recommendations
- Solving the open shop scheduling problem
- A Position-Based Propagator for the Open-Shop Problem
- A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
- scientific article; zbMATH DE number 1192259
Cites work
- A branch \(\&\) bound algorithm for the open-shop problem
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
- A dynamic topological sort algorithm for directed acyclic graphs
- A new lower bound for the open-shop problem
- A new particle swarm optimization for the open shop scheduling problem
- Adjustment of heads and tails for the job-shop problem
- An experimental study of dynamic algorithms for transitive closure
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Benchmarks for basic scheduling problems
- Competitive genetic algorithms for the open-shop scheduling problem
- Compiling Finite Linear CSP into SAT
- Constructive heuristic algorithms for the open shop problem
- scientific article; zbMATH DE number 3989126 (Why is no real title available?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Methods and Applications of Artificial Intelligence
- On Universal Restart Strategies for Backtracking Search
- Open Shop Scheduling to Minimize Finish Time
- Optimal speedup of Las Vegas algorithms
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- Solving the open shop scheduling problem
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
Cited in
(17)- A branch \(\&\) bound algorithm for the open-shop problem
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports
- Dynamic programming approach for solving the open shop problem
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Hybrid metaheuristics for stochastic constraint programming
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- A Position-Based Propagator for the Open-Shop Problem
- scientific article; zbMATH DE number 2084745 (Why is no real title available?)
- Multi-level weighted all-different constraint
- Solving the open shop scheduling problem
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
- Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem
This page was built for publication: An optimal constraint programming approach to the open-shop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815442)
