Approximation Algorithms for Three-Machine Open Shop Scheduling (Q4282281)

From MaRDI portal
Revision as of 16:31, 27 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 516691
Language Label Description Also known as
English
Approximation Algorithms for Three-Machine Open Shop Scheduling
scientific article; zbMATH DE number 516691

    Statements

    Approximation Algorithms for Three-Machine Open Shop Scheduling (English)
    0 references
    0 references
    0 references
    24 March 1994
    0 references
    greedy algorithm
    0 references
    three machine open shop scheduling
    0 references
    makespan
    0 references
    worst- case performance ratio
    0 references
    linear time heuristic
    0 references

    Identifiers