Exact makespan minimization of unrelated parallel machines (Q2165594)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Exact makespan minimization of unrelated parallel machines
scientific article

    Statements

    Exact makespan minimization of unrelated parallel machines (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2022
    0 references
    unrelated parallel machine problem
    0 references
    makespan
    0 references
    variable fixing
    0 references
    binary knapsack
    0 references
    Lagrangian relaxation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references