Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772)

From MaRDI portal
Revision as of 07:41, 5 August 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
Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
scientific article

    Statements

    Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (English)
    0 references
    0 references
    0 references
    29 May 2006
    0 references
    0 references
    scheduling
    0 references
    single machine
    0 references
    earliness-tardiness cost
    0 references
    neighborhoods
    0 references
    search method
    0 references