A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem (Q582208): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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: Q3206647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dynamic Programming Methods for Assembly Line Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Stochastic Assembly Line Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method and two algorithms on the theory of partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound Strategies for Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assembly-Line Balancing—Dynamic Programming with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks / rank
 
Normal rank

Revision as of 11:13, 20 June 2024

scientific article
Language Label Description Also known as
English
A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references