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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
+Normal rank
@@ Property / cites work @@
+Q3347319
@@ Property / cites work: Q3347319 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Capacitated Vehicle Routing on Trees
@@ Property / cites work: Capacitated Vehicle Routing on Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds and reduction procedures for the bin packing problem
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
+Normal rank
@@ Property / cites work @@
+An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
+Normal rank
@@ Property / cites work @@
+Assembly line balancing as generalized bin packing
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(92)90208-q
+Normal rank
@@ Property / OpenAlex ID @@
+W2090324882
@@ Property / OpenAlex ID: W2090324882 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1194733