A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness (Q2770081)

From MaRDI portal
Revision as of 21:33, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
scientific article

    Statements

    A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 February 2002
    0 references
    0 references
    weighted tardiness job-shop scheduling
    0 references
    random shop disturbances
    0 references
    decomposition method
    0 references
    scheduling decisions
    0 references
    branch-and-bound algorithm
    0 references
    0 references