Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem (Q4274645)

From MaRDI portal
scientific article; zbMATH DE number 482404
Language Label Description Also known as
English
Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
scientific article; zbMATH DE number 482404

    Statements

    Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 January 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    assembly-type production
    0 references
    makespan
    0 references
    3-machine assembly-type flowshop
    0 references
    strongly NP-complete
    0 references
    polynomially solvable cases
    0 references
    branch-and-bound
    0 references
    heuristics
    0 references
    0 references