Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-34171-2_6
+Normal rank
@@ Property / OpenAlex ID @@
+W2288973395
@@ Property / OpenAlex ID: W2288973395 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of scheduling problems with setup times or costs
+Normal rank
@@ Property / cites work @@
+A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
+Normal rank
@@ Property / cites work @@
+The routing open-shop problem on a network: complexity and approximation
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Treatment of the Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Approximability and parameterized complexity of multicover by \(c\)-intervals
+Normal rank
@@ Property / cites work @@
+Interval scheduling and colorful independent sets
@@ Property / cites work: Interval scheduling and colorful independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q5271449
@@ Property / cites work: Q5271449 / rank @@
+Normal rank
@@ Property / cites work @@
+A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
+Normal rank
@@ Property / cites work @@
+\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
+Normal rank
@@ Property / cites work @@
+Efficient approximation algorithms for the routing open shop problem
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Eulerian Extension and Rural Postman
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the parametric complexity of schedules to minimize tardy tasks.
+Normal rank
@@ Property / cites work @@
+The list chromatic index of a bipartite multigraph
+Normal rank
@@ Property / cites work @@
+Open Shop Scheduling to Minimize Finish Time
@@ Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of the k-Arc Chinese Postman Problem
+Normal rank
@@ Property / cites work @@
+Structural Parameterizations of the Mixed Chinese Postman Problem
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of \(k\)-Chinese postman problem
+Normal rank
@@ Property / cites work @@
+Strip Graphs: Recognition and Scheduling
@@ Property / cites work: Strip Graphs: Recognition and Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs
+Normal rank
@@ Property / cites work @@
+Minkowski's Convex Body Theorem and Integer Programming
+Normal rank
@@ Property / cites work @@
+O(log m)-approximation for the routing open shop problem
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+Scheduling and fixed-parameter tractability
@@ Property / cites work: Scheduling and fixed-parameter tractability / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+The open shop problem with routing at a two-node network and allowed preemption
+Normal rank
@@ Property / cites work @@
+Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
+Normal rank
@@ Property / cites work @@
+A new view on rural postman based on Eulerian extension and matching
+Normal rank
@@ Property / cites work @@
+Routing open shop and flow shop scheduling problems
+Normal rank