``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654): Difference between revisions

@@ Property / cites work @@
+Parallel machine scheduling with time dependent processing times
+Normal rank
@@ Property / cites work @@
+A concise survey of scheduling with time-dependent processing times
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Performance Guarantees for Scheduling Algorithms
@@ Property / cites work: Performance Guarantees for Scheduling Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling deteriorating jobs subject to job or machine availability constraints
+Normal rank
@@ Property / cites work @@
+Scheduling linear deteriorating jobs with an availability constraint on a single machine
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing guide
@@ Property / cites work: The NP-completeness column: An ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714493
@@ Property / cites work: Q4714493 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4233364
@@ Property / cites work: Q4233364 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hard cases in scheduling deteriorating jobs on dedicated machines
+Normal rank
@@ Property / cites work @@
+Q3686512
@@ Property / cites work: Q3686512 / rank @@
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
+Normal rank
@@ Property / cites work @@
+On different approximation criteria for subset product problems
+Normal rank
@@ Property / cites work @@
+General approximation algorithms for some arithmetical combinatorial problems
+Normal rank
@@ Property / cites work @@
+Multi-Machine Scheduling With Linear Deterioration
+Normal rank
@@ Property / cites work @@
+Complexity analysis of job-shop scheduling with deteriorating jobs
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Prime numbers and computer methods for factorization.
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank