Single machine scheduling with start time dependent processing times: Some solvable cases (Q1342026)

From MaRDI portal
Revision as of 01:09, 19 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
Single machine scheduling with start time dependent processing times: Some solvable cases
scientific article

    Statements

    Single machine scheduling with start time dependent processing times: Some solvable cases (English)
    0 references
    0 references
    0 references
    11 January 1995
    0 references
    single machine scheduling
    0 references
    processing time penalties
    0 references
    due date
    0 references
    polynomial time optimal algorithms
    0 references

    Identifiers