An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs (Q5548719)

From MaRDI portal
Revision as of 11:37, 29 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3262861
Language Label Description Also known as
English
An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
scientific article; zbMATH DE number 3262861

    Statements

    An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs (English)
    0 references
    0 references
    1968
    0 references
    operations research
    0 references

    Identifiers