Dynamic programming approach for solving the open shop problem

DOI10.1007/s10100-019-00630-3OpenAlexW2951368496WikidataQ127710514 ScholiaQ127710514MaRDI QIDQ2033324

Ansis Ozolins

Publication date: 16 June 2021

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-019-00630-3

zbMATH Keywords

dynamic programmingmakespanopen shop scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions

Uses Software

• Sugar

Cites Work

• Solving the job-shop scheduling problem optimally by dynamic programming
• Compiling finite linear CSP into SAT
• 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
• Improved bounded dynamic programming algorithm for solving the blocking flow shop problem
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• A new lower bound for the open-shop problem
• A two-level particle swarm optimisation algorithm for open-shop scheduling problem
• Benchmarks for basic scheduling problems
• A new particle swarm optimization for the open shop scheduling problem
• An Optimal Constraint Programming Approach to the Open-Shop Problem
• Open Shop Scheduling to Minimize Finish Time
• Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem
• Solving the open shop scheduling problem

This page was built for publication: Dynamic programming approach for solving the open shop problem