Equivalent time-dependent scheduling problems (Q1041934): 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.2008.04.040
+Normal rank
@@ Property / OpenAlex ID @@
+W2084399987
@@ Property / OpenAlex ID: W2084399987 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with time dependent processing times: Review and extensions
+Normal rank
@@ Property / cites work @@
+Handbook on Scheduling
@@ Property / cites work: Handbook on Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with time dependent processing times
+Normal rank
@@ Property / cites work @@
+Single machine scheduling with deadlines and increasing rates of processing times
+Normal rank
@@ Property / cites work @@
+The complexity of scheduling starting time dependent tasks with release 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 @@
+Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
+Normal rank
@@ Property / cites work @@
+Parallel Processing and Applied Mathematics
@@ Property / cites work: Parallel Processing and Applied Mathematics / rank @@
+Normal rank
@@ Property / cites work @@
+Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
+Normal rank
@@ Property / cites work @@
+Parallel Processing and Applied Mathematics
@@ Property / cites work: Parallel Processing and Applied Mathematics / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of scheduling tasks with time-dependent execution times
+Normal rank
@@ Property / cites work @@
+A note on parallel-machine scheduling with deteriorating jobs
+Normal rank
@@ Property / cites work @@
+Q4233364
@@ Property / cites work: Q4233364 / rank @@
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1041934