A lower bound for the job insertion problem. (Q1811122)

From MaRDI portal
Revision as of 21:44, 27 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 lower bound for the job insertion problem.
scientific article

    Statements

    title
    A lower bound for the job insertion problem. (English)
    0 references
    author
    Tamás Kis
    0 references
    Alain Hertz
    0 references
    publication date
    10 June 2003
    0 references
    zbMATH Keywords
    Job-shop scheduling
    0 references
    Perfect graphs
    0 references
    Polyhedral methods
    0 references

    Identifiers

    zbMATH DE Number
    1925296
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1811122&oldid=2129956"
      Powered by MediaWiki