An Optimal Constraint Programming Approach to the Open-Shop Problem
From MaRDI portal
Publication:2815442
DOI10.1287/ijoc.1100.0446zbMath1460.90089OpenAlexW2157541676MaRDI QIDQ2815442
Hadrien Cambazard, André Langevin, Narendra Jussien, Arnaud Malapert, Louis-Martin Rousseau, Christelle Guéret
Publication date: 29 June 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1100.0446
production schedulingartificial intelligenceopen shopcomputer scienceconstraint programmingcomputersrandomization and restart
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search, A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times, Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition, 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, 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
Cites Work
- Unnamed Item
- Optimal speedup of Las Vegas algorithms
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
- Constructive heuristic algorithms for the open shop problem
- Adjustment of heads and tails for the job-shop problem
- A branch \(\&\) bound algorithm for the open-shop problem
- Competitive genetic algorithms for the open-shop scheduling problem
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Resource-constrained project scheduling: Notation, classification, models, and methods
- A new lower bound for the open-shop problem
- Benchmarks for basic scheduling problems
- A new particle swarm optimization for the open shop scheduling problem
- A dynamic topological sort algorithm for directed acyclic graphs
- On Universal Restart Strategies for Backtracking Search
- Compiling Finite Linear CSP into SAT
- Open Shop Scheduling to Minimize Finish Time
- An Experimental Study of Dynamic Algorithms for Transitive Closure
- Methods and Applications of Artificial Intelligence
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Solving the open shop scheduling problem
