A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632)

From MaRDI portal
Revision as of 10:26, 7 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 pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
scientific article

    Statements

    A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (English)
    0 references
    0 references
    1989
    0 references
    0 references
    job shop
    0 references
    unit processing times
    0 references
    two machines
    0 references
    pseudo-polynomial algorithms
    0 references