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

← Older edit

@@ description / en / description / en @@
+scientific article; zbMATH DE number 6195473
@@ Property / zbMATH Open document ID @@
+.90041
@@ Property / zbMATH Open document ID: 1336.90041 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-39206-1_65
@@ Property / DOI: 10.1007/978-3-642-39206-1_65 / rank @@
+Normal rank
@@ Property / published in @@
+Automata, Languages, and Programming
@@ Property / published in: Automata, Languages, and Programming / rank @@
+Normal rank
@@ Property / publication date @@
+August 2013Timestamp +2013-08-06T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2013-08-06T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 6 August 2013 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6195473
@@ Property / zbMATH DE Number: 6195473 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2133706738
@@ Property / OpenAlex ID: W2133706738 / rank @@
+Normal rank
@@ 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