A heuristic for the two-machine open-shop scheduling problem with transportation times (Q1296581)

From MaRDI portal
Revision as of 11:24, 18 July 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
A heuristic for the two-machine open-shop scheduling problem with transportation times
scientific article

    Statements

    A heuristic for the two-machine open-shop scheduling problem with transportation times (English)
    0 references
    7 August 2000
    0 references
    open shop
    0 references
    transportation time
    0 references
    approximation
    0 references
    worst-case analysis
    0 references

    Identifiers