Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers (Q2412847)

From MaRDI portal
Revision as of 16:09, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jota/EspinousePS17, #quickstatements; #temporary_batch_1731508824982)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers
scientific article

    Statements

    Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers (English)
    0 references
    0 references
    0 references
    0 references
    27 October 2017
    0 references
    flexible manufacturing system
    0 references
    single machine
    0 references
    one depot
    0 references
    one vehicle
    0 references
    NP-hardness proof
    0 references
    approximation algorithm
    0 references
    0 references
    0 references

    Identifiers