Three is easy, two is hard: Open shop sum-batch scheduling problem refined (Q2466597): Difference between revisions

@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2005.07.006
+Normal rank
@@ Property / OpenAlex ID @@
+W1987105744
@@ Property / OpenAlex ID: W1987105744 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
+Normal rank
@@ Property / cites work @@
+Open Shop Scheduling to Minimize Finish Time
@@ Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3137912
@@ Property / cites work: Q3137912 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3964013
@@ Property / cites work: Q3964013 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms for Knapsack Problems with Bounded Weights
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2466597