On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023677
@@ Property / cites work: Q4023677 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the job-shop problem with two jobs
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
+Normal rank
@@ Property / cites work @@
+Q4859840
@@ Property / cites work: Q4859840 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Q4882997
@@ Property / cites work: Q4882997 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of shop-scheduling problems with two or three jobs
+Normal rank
@@ Property / cites work @@
+NP-hardness of shop-scheduling problems with three jobs
+Normal rank