Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
scientific article

    Statements

    Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (English)
    0 references
    0 references
    0 references
    0 references
    1 December 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    Lagrangian relaxation
    0 references
    unrelated machine scheduling
    0 references
    total weighted flow time
    0 references
    time-window job availability
    0 references
    machine downtime
    0 references
    branch-and-cut
    0 references
    Lagrangian dual formulation
    0 references
    lower and upper bounds
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references