A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191)

From MaRDI portal
Revision as of 02:49, 18 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
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
scientific article

    Statements

    A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (English)
    0 references
    0 references
    0 references
    0 references
    28 June 1999
    0 references
    metra potential method
    0 references

    Identifiers