Branch-and-bound algorithms for the multi-product assembly line balancing problem (Q1194733): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, Effective Algorithms for Simple Assembly Line Balancing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Vehicle Routing on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and reduction procedures for the bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assembly line balancing as generalized bin packing / rank
 
Normal rank

Revision as of 13:29, 16 May 2024

scientific article
Language Label Description Also known as
English
Branch-and-bound algorithms for the multi-product assembly line balancing problem
scientific article

    Statements

    Branch-and-bound algorithms for the multi-product assembly line balancing problem (English)
    0 references
    0 references
    0 references
    0 references
    6 October 1992
    0 references
    assembly line balancing
    0 references
    bin packing
    0 references
    flexible manufacturing system
    0 references
    sequential nonpreemptive tasks
    0 references
    branch-and-bound
    0 references
    tree search
    0 references

    Identifiers