Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268)

From MaRDI portal
Revision as of 13:44, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
scientific article

    Statements

    Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (English)
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    0 references
    just-in-time scheduling
    0 references
    flow shop
    0 references
    job shop
    0 references
    open shop
    0 references
    complexity
    0 references
    pseudo-polynomial time algorithm
    0 references
    FPTAS
    0 references