Dynamic programming approach for solving the open shop problem (Q2033324): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \(\&\) bound algorithm for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the job-shop scheduling problem optimally by dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Constraint Programming Approach to the Open-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounded dynamic programming algorithm for solving the blocking flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-level particle swarm optimisation algorithm for open-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive genetic algorithms for the open-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new particle swarm optimization for the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling finite linear CSP into SAT / rank
 
Normal rank

Revision as of 23:58, 25 July 2024

scientific article
Language Label Description Also known as
English
Dynamic programming approach for solving the open shop problem
scientific article

    Statements

    Dynamic programming approach for solving the open shop problem (English)
    0 references
    0 references
    16 June 2021
    0 references
    open shop scheduling
    0 references
    makespan
    0 references
    dynamic programming
    0 references

    Identifiers