Approximating the 2-machine flow shop problem with exact delays taking two values (Q2174271): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963657568
@@ Property / OpenAlex ID: W2963657568 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00081
@@ Property / arXiv ID: 1711.00081 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for UET scheduling problems with exact delays
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Scheduling Problems with Exact Delays
+Normal rank
@@ Property / cites work @@
+Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
+Normal rank
@@ Property / cites work @@
+Radar pulse interleaving for multi‐target tracking
+Normal rank
@@ Property / cites work @@
+Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
+Normal rank
@@ Property / cites work @@
+Interleaving two-phased jobs on a single machine
@@ Property / cites work: Interleaving two-phased jobs on a single machine / rank @@
+Normal rank
@@ Property / cites work @@
+Q4884350
@@ Property / cites work: Q4884350 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
+Normal rank
@@ Property / Wikidata QID @@
+Q128026758
@@ Property / Wikidata QID: Q128026758 / rank @@
+Normal rank