Approximation algorithms for two-machine flow-shop scheduling with a conflict graph (Q1790974)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
scientific article

    Statements

    Approximation algorithms for two-machine flow-shop scheduling with a conflict graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 October 2018
    0 references
    flow-shop scheduling
    0 references
    conflict graph
    0 references
    \(b\)-matching
    0 references
    path cover
    0 references
    approximation algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references