An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times (Q1644059)

From MaRDI portal
Revision as of 15:40, 24 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
An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times
scientific article

    Statements

    An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times (English)
    0 references
    0 references
    0 references
    21 June 2018
    0 references
    scheduling
    0 references
    open shop
    0 references
    quadratic completion time
    0 references
    Lagrangian relaxation
    0 references
    dynamic programming
    0 references
    optimal property
    0 references

    Identifiers