An efficient algorithm for the job-shop problem with two jobs (Q1108919)

From MaRDI portal
Revision as of 10:32, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient algorithm for the job-shop problem with two jobs
scientific article

    Statements

    title
    An efficient algorithm for the job-shop problem with two jobs (English)
    0 references
    author
    Peter Brucker
    0 references
    published in
    Computing
    0 references
    publication date
    1988
    0 references
    zbMATH Keywords
    job-shop scheduling
    0 references
    two jobs
    0 references
    shortest path
    0 references
    obstacles in the plane
    0 references
    special network
    0 references

    Identifiers

    DOI
    10.1007/BF02276919
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    90C35
    0 references
    68Q25
    0 references
    zbMATH DE Number
    4068592
    0 references
    OpenAlex ID
    W201573687
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1108919&oldid=37297091"
    Powered by MediaWiki