A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246)

From MaRDI portal
Revision as of 16:36, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags
scientific article

    Statements

    A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (English)
    0 references
    0 references
    0 references
    27 March 2007
    0 references
    0 references
    scheduling
    0 references
    one machine
    0 references
    makespan
    0 references
    branch and bound algorithm
    0 references
    minimum and maximum time lags
    0 references
    0 references
    0 references