Multiplicity and complexity issues in contemporary production scheduling (Q5422015): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2140037720
@@ Property / OpenAlex ID: W2140037720 / rank @@
+Normal rank
@@ Property / cites work @@
+No-wait flow shop scheduling with large lot sizes
@@ Property / cites work: No-wait flow shop scheduling with large lot sizes / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Service and Operation Costs of Periodic Scheduling
+Normal rank
@@ Property / cites work @@
+The maximum deviation just-in-time scheduling problem.
+Normal rank
@@ Property / cites work @@
+Complexity of one-cycle robotic flow-shops
@@ Property / cites work: Complexity of one-cycle robotic flow-shops / rank @@
+Normal rank
@@ Property / cites work @@
+A framework for the complexity of high-multiplicity scheduling problems
+Normal rank
@@ Property / cites work @@
+High Multiplicity in Earliness-Tardiness Scheduling
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Many Visits to Few Cities
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On polynomial solvability of the high multiplicity total weighted tardiness problem
+Normal rank
@@ Property / cites work @@
+On the high multiplicity traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Minimizing the number of tardy job units under release time constraints
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for an integer quadratic non-separable transportation problem
+Normal rank
@@ Property / cites work @@
+Makespan minimization for flow-shop problems with transportation times and a single robot
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
+Normal rank
@@ Property / cites work @@
+Q3525910
@@ Property / cites work: Q3525910 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting and enumeration complexity with application to multicriteria scheduling
+Normal rank