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

@@ Property / cites work @@
+An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
+Normal rank
@@ Property / cites work @@
+Q3206647
@@ Property / cites work: Q3206647 / rank @@
+Normal rank
@@ Property / cites work @@
+On Dynamic Programming Methods for Assembly Line Balancing
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Stochastic Assembly Line Balancing
+Normal rank
@@ Property / cites work @@
+A method and two algorithms on the theory of partitions
+Normal rank
@@ Property / cites work @@
+Branch-and-Bound Strategies for Dynamic Programming
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Assembly-Line Balancing—Dynamic Programming with Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0305-0548(90)90040-e
+Normal rank
@@ Property / OpenAlex ID @@
+W1998581758
@@ Property / OpenAlex ID: W1998581758 / rank @@
+Normal rank