Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (Q2835686)

From MaRDI portal
Revision as of 00:14, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut
scientific article

    Statements

    Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (English)
    0 references
    30 November 2016
    0 references
    polyhedral
    0 references
    valid inequalities
    0 references
    unrelated parallel machines
    0 references
    scheduling
    0 references
    precedence constraints
    0 references
    branch-and-cut
    0 references

    Identifiers