A polynomial algorithm for an open shop problem with unit processing times and tree constraints (Q1804876): Difference between revisions

@@ Property / Wikidata QID @@
+Q57634009
@@ Property / Wikidata QID: Q57634009 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Openshop and flowshop scheduling to minimize sum of completion times
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem
+Normal rank
@@ Property / cites work @@
+Open shop problems with unit time operations
@@ Property / cites work: Open shop problems with unit time operations / rank @@
+Normal rank
@@ Property / cites work @@
+Unit Execution Time Shop Problems
@@ Property / cites work: Unit Execution Time Shop Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3899811
@@ Property / cites work: Q3899811 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
+Normal rank
@@ Property / cites work @@
+Scheduling with Deadlines and Loss Functions
@@ Property / cites work: Scheduling with Deadlines and Loss Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994687
@@ Property / cites work: Q3994687 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(93)e0156-s
+Normal rank
@@ Property / OpenAlex ID @@
+W2003459360
@@ Property / OpenAlex ID: W2003459360 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1804876