Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs (Q839781): Difference between revisions

@@ 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 @@
+Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
+Normal rank
@@ Property / cites work @@
+Q4826104
@@ Property / cites work: Q4826104 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for single-machine problems with positive finish-start time-lags
+Normal rank
@@ Property / cites work @@
+Scheduling equal processing time jobs to minimize the weighted number of late jobs
+Normal rank
@@ Property / cites work @@
+How useful are preemptive schedules?
@@ Property / cites work: How useful are preemptive schedules? / rank @@
+Normal rank
@@ Property / cites work @@
+A note on scheduling equal-length jobs to maximize throughput
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+A Functional Equation and its Application to Resource Allocation and Sequencing Problems
+Normal rank
@@ Property / cites work @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank