An FPTAS for scheduling a two-machine flowshop with one unavailability interval (Q3156725)

From MaRDI portal
Revision as of 17:06, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An FPTAS for scheduling a two-machine flowshop with one unavailability interval
scientific article

    Statements

    An FPTAS for scheduling a two-machine flowshop with one unavailability interval (English)
    0 references
    0 references
    11 January 2005
    0 references
    0 references
    flowshop scheduling
    0 references
    machine availability
    0 references
    fully polynomial time approximation scheme
    0 references
    0 references
    0 references