An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time (Q2084598)

From MaRDI portal
Revision as of 13:20, 30 July 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 approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time
scientific article

    Statements

    An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    supply chain scheduling
    0 references
    due window assignment
    0 references
    holding time
    0 references
    approximation algorithm
    0 references
    fully polynomial-time approximation scheme
    0 references
    0 references
    0 references