Complexity of the job insertion problem in multi-stage scheduling (Q2467449): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2007.02.004
@@ Property / DOI: 10.1016/j.orl.2007.02.004 / rank @@
-Normal rank
@@ Property / author @@
-Gerhard J. Woeginger
@@ Property / author: Gerhard J. Woeginger / rank @@
-Normal rank
@@ Property / author @@
+Gerhard J. Woeginger
@@ Property / author: Gerhard J. Woeginger / 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.2007.02.004
+Normal rank
@@ Property / OpenAlex ID @@
+W1986470794
@@ Property / OpenAlex ID: W1986470794 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for the job insertion problem.
@@ Property / cites work: A lower bound for the job insertion problem. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3995531
@@ Property / cites work: Q3995531 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of shop-scheduling problems with two or three jobs
+Normal rank
@@ Property / cites work @@
+Job Shop Scheduling by Local Search
@@ Property / cites work: Job Shop Scheduling by Local Search / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2007.02.004
@@ Property / DOI: 10.1016/J.ORL.2007.02.004 / rank @@
+Normal rank