Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming (Q633553): 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.1007/s10951-009-0160-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1989343205
@@ Property / OpenAlex ID: W1989343205 / rank @@
+Normal rank
@@ Property / cites work @@
+Order review and release strategies ina job shop environment: A review and a classification
+Normal rank
@@ Property / cites work @@
+Q4257216
@@ Property / cites work: Q4257216 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+The Linear Programming Approach to Approximate Dynamic Programming
+Normal rank
@@ Property / cites work @@
+Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming
+Normal rank
@@ Property / cites work @@
+Tactically delayed versus non-delay scheduling: An experimental investigation
+Normal rank
@@ Property / cites work @@
+A weighted modified due date rule for sequencing to minimize weighted tardiness
+Normal rank
@@ Property / cites work @@
+Approximate Dynamic Programming
@@ Property / cites work: Approximate Dynamic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3525911
@@ Property / cites work: Q3525911 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic non-preemptive single machine scheduling
@@ Property / cites work: Dynamic non-preemptive single machine scheduling / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:633553