Parametric problem in scheduling theory (Q3904366)

From MaRDI portal
Revision as of 10:18, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parametric problem in scheduling theory
scientific article

    Statements

    title
    Parametric problem in scheduling theory (English)
    0 references
    author
    O. I. Mel'Nikov
    0 references
    Ya. M. Shafransky
    0 references
    published in
    Cybernetics
    0 references
    publication date
    1979
    0 references
    zbMATH Keywords
    single machine
    0 references
    permutation flow-shop
    0 references
    variable processing time
    0 references
    deterministic scheduling
    0 references
    algorithm
    0 references
    minimization of maximum completion time
    0 references
    job sequencing
    0 references
    cites work
    Q5342166
    0 references

    Identifiers

    DOI
    10.1007/BF01075095
    0 references
    zbMATH DE Number
    3713475
    0 references
    OpenAlex ID
    W1965903433
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3904366&oldid=37253612"
    Powered by MediaWiki