No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (Q2800373): Difference between revisions

@@ Property / cites work @@
+Q5417632
@@ Property / cites work: Q5417632 / rank @@
+Normal rank
@@ Property / cites work @@
+On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
+Normal rank
@@ Property / cites work @@
+New Inapproximability Bounds for TSP
@@ Property / cites work: New Inapproximability Bounds for TSP / rank @@
+Normal rank
@@ Property / cites work @@
+Flowshop scheduling with limited temporary storage
+Normal rank
@@ Property / cites work @@
+The Three-Machine No-Wait Flow Shop is NP-Complete
+Normal rank
@@ Property / cites work @@
+Q3670909
@@ Property / cites work: Q3670909 / rank @@
+Normal rank
@@ Property / cites work @@
+The no-wait flow-shop paradox
@@ Property / cites work: The no-wait flow-shop paradox / rank @@
+Normal rank
@@ Property / cites work @@
+Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
+Normal rank
@@ Property / cites work @@
+Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
+Normal rank