Scheduling three-operation jobs in a two-machine flow shop to minimize makespan (Q596459)

From MaRDI portal
Revision as of 21:49, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
scientific article

    Statements

    Scheduling three-operation jobs in a two-machine flow shop to minimize makespan (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2004
    0 references
    scheduling
    0 references
    flow shop
    0 references
    makespan
    0 references
    approximation algorithm
    0 references
    polynomial time approximation scheme
    0 references

    Identifiers