On the <i>N</i>-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution (Q5639517)

From MaRDI portal
Revision as of 11:21, 30 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3366697
Language Label Description Also known as
English
On the <i>N</i>-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution
scientific article; zbMATH DE number 3366697

    Statements

    On the <i>N</i>-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution (English)
    0 references
    0 references
    1972
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references