Mixed binary integer programming formulations for the reentrant job shop scheduling problem (Q2485171)

From MaRDI portal
Revision as of 22:58, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Mixed binary integer programming formulations for the reentrant job shop scheduling problem
scientific article

    Statements

    title
    Mixed binary integer programming formulations for the reentrant job shop scheduling problem (English)
    0 references
    author
    Jason Chao-Hsien Pan
    0 references
    Jen-Shiang Chen
    0 references
    publication date
    3 August 2005
    0 references
    zbMATH Keywords
    Scheduling
    0 references
    Reentrant job shops
    0 references
    Integer programming
    0 references
    describes a project that uses
    LINGO
    0 references
    LINDO
    0 references

    Identifiers

    zbMATH DE Number
    2191449
    0 references
    OpenAlex ID
    W2041592598
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2485171&oldid=39114806"
    Powered by MediaWiki