Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop (Q3360653)

From MaRDI portal
Revision as of 15:51, 4 September 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
Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop
scientific article

    Statements

    Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop (English)
    0 references
    0 references
    1991
    0 references
    polynomial-time algorithm
    0 references
    known processing times and due dates
    0 references
    single machine
    0 references
    bicriteria objective function
    0 references

    Identifiers