Complexity and approximability of scheduling resumable proportionally deteriorating jobs (Q2379562): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2008.12.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2058023296
@@ Property / OpenAlex ID: W2058023296 / rank @@
+Normal rank
@@ Property / cites work @@
+A concise survey of scheduling with time-dependent processing times
+Normal rank
@@ Property / cites work @@
+Scheduling deteriorating jobs subject to job or machine availability constraints
+Normal rank
@@ Property / cites work @@
+Time-dependent scheduling
@@ Property / cites work: Time-dependent scheduling / rank @@
+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 @@
+Two-machine flowshop scheduling with availability constraints
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank
@@ Property / cites work @@
+Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
+Normal rank