A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (Q1364482)

From MaRDI portal
Revision as of 10:20, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
scientific article

    Statements

    A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (English)
    0 references
    4 September 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling problem
    0 references
    pseudopolynomial-time algorithms
    0 references
    0 references