Makespan minimization in preemptive two machine job shops (Q1377264): Difference between revisions

@@ Property / author @@
-Q1377263
@@ Property / author: Q1377263 / rank @@
-Normal rank
@@ Property / author @@
-Gerhard J. Woeginger
@@ Property / author: Gerhard J. Woeginger / rank @@
-Normal rank
@@ Property / author @@
+Sergey Sevast'janov
@@ Property / author: Sergey Sevast'janov / 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 / cites work @@
+Preemptive job-shop scheduling problems with a fixed number of jobs
+Normal rank
@@ Property / cites work @@
+Flowshop and Jobshop Schedules: Complexity and Approximation
+Normal rank
@@ Property / cites work @@
+Bounds on Multiprocessing Timing Anomalies
@@ Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231913
@@ Property / cites work: Q4231913 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
+Normal rank
@@ Property / cites work @@
+Makespan minimization in open shops: A polynomial time approximation scheme
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Shop Scheduling Problems
+Normal rank