On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for the Decomposition of Graphs and Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in Trees, Series-Parallel and Interval Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / 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: On Dynamic Programming Methods for Assembly Line Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming and decomposition approaches for the single machine total tardiness 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: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Precedence Constraints of Dimension 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to generate the ideals of a partial order / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank

Latest revision as of 11:39, 21 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of dynamic programming for sequencing problems with precedence constraints
scientific article

    Statements

    On the complexity of dynamic programming for sequencing problems with precedence constraints (English)
    0 references
    0 references
    1990
    0 references
    precedence constrained sequencing
    0 references
    assembly line balancing
    0 references
    regression equations
    0 references
    storage requirements
    0 references

    Identifiers

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