Dynamic programming approach for solving the open shop problem
From MaRDI portal
Cites work
- A branch \(\&\) bound algorithm for the open-shop problem
- A new lower bound for the open-shop problem
- A new particle swarm optimization for the open shop scheduling problem
- A two-level particle swarm optimisation algorithm for open-shop scheduling problem
- An optimal constraint programming approach to the open-shop problem
- 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
- Improved bounded dynamic programming algorithm for solving the blocking flow shop problem
- Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem
- Open Shop Scheduling to Minimize Finish Time
- Solving the job-shop scheduling problem optimally by dynamic programming
- Solving the open shop scheduling problem
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
Cited in
(2)
This page was built for publication: Dynamic programming approach for solving the open shop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033324)
