Single machine batch scheduling with non-increasing time slot costs (Q2673533)

From MaRDI portal
Revision as of 16:26, 19 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
Single machine batch scheduling with non-increasing time slot costs
scientific article

    Statements

    title
    Single machine batch scheduling with non-increasing time slot costs (English)
    0 references
    author
    Junfeng Ren
    0 references
    publication date
    10 June 2022
    0 references
    zbMATH Keywords
    polynomial-time algorithm
    0 references
    time slot cost
    0 references
    batch
    0 references
    scheduling
    0 references

    Identifiers

    zbMATH DE Number
    7539460
    0 references
    OpenAlex ID
    W3204611586
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2673533&oldid=39187892"
    Powered by MediaWiki