Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10951-010-0181-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2005380783
@@ Property / OpenAlex ID: W2005380783 / rank @@
+Normal rank
@@ Property / cites work @@
+A new dominance rule to minimize total weighted tardiness with unequal release dates.
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
+Normal rank
@@ Property / cites work @@
+Scheduling equal-length jobs on identical parallel machines
+Normal rank
@@ Property / cites work @@
+Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Q4124332
@@ Property / cites work: Q4124332 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821818
@@ Property / cites work: Q4821818 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
+Normal rank