A linear time approximation algorithm for permutation flow shop scheduling (Q764320): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Partitioning a sequence into few monotone subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance guarantees for flowshop heuristics to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Permutation Flow Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Permutation Flow Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of an approximation algorithm for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results in the worst-case analysis for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation vs. non-permutation flow shop schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some geometric methods in scheduling theory: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on permutation flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681937 / rank
 
Normal rank

Latest revision as of 00:27, 5 July 2024

scientific article
Language Label Description Also known as
English
A linear time approximation algorithm for permutation flow shop scheduling
scientific article

    Statements

    A linear time approximation algorithm for permutation flow shop scheduling (English)
    0 references
    0 references
    0 references
    13 March 2012
    0 references
    permutation flow shop scheduling
    0 references
    approximation algorithms
    0 references
    Erdős-Szekeres theorem
    0 references

    Identifiers