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

From MaRDI portal
Revision as of 15:32, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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