A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:17, 5 March 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
scientific article

    Statements

    A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (English)
    0 references
    0 references
    7 March 2006
    0 references
    flowshop
    0 references
    blocking
    0 references
    makespan
    0 references
    lower bound
    0 references
    branch-and-bound
    0 references

    Identifiers