The complexity of scheduling job families about a common due date (Q1376265)

From MaRDI portal
Revision as of 19:47, 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
The complexity of scheduling job families about a common due date
scientific article

    Statements

    The complexity of scheduling job families about a common due date (English)
    0 references
    0 references
    17 December 1997
    0 references
    nonregular performance measure
    0 references
    family scheduling
    0 references
    setup time structure
    0 references
    parallel machines
    0 references
    common due-date
    0 references
    complexity results
    0 references
    total earliness/tardiness problem
    0 references

    Identifiers