A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem (Q1046099): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2009.07.025
+Normal rank
@@ Property / OpenAlex ID @@
+W2054179508
@@ Property / OpenAlex ID: W2054179508 / rank @@
+Normal rank
@@ Property / cites work @@
+Designing PTASs for MIN-SUM scheduling problems
@@ Property / cites work: Designing PTASs for MIN-SUM scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with time dependent processing times: Review and extensions
+Normal rank
@@ Property / cites work @@
+A state-of-the-art review on scheduling with learning effects
+Normal rank
@@ Property / cites work @@
+Scheduling Deteriorating Jobs on a Single Processor
+Normal rank
@@ 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 @@
+Q4737345
@@ Property / cites work: Q4737345 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel-machine scheduling with simple linear deterioration to minimize total completion time
+Normal rank
@@ Property / cites work @@
+V-Shaped Policies for Scheduling Deteriorating Jobs
+Normal rank
@@ Property / cites work @@
+Complexity analysis of job-shop scheduling with deteriorating jobs
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank