A note on the maximum number of on-time jobs on parallel identical machines. (Q1422366): Difference between revisions

@@ Property / cites work @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank
@@ Property / cites work @@
+Q4055377
@@ Property / cites work: Q4055377 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for scheduling chains on a single machine
+Normal rank
@@ Property / cites work @@
+Q4016820
@@ Property / cites work: Q4016820 / rank @@
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
+Normal rank
@@ Property / cites work @@
+Single machine scheduling to minimize the number of early and tardy jobs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0305-0548(02)00084-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2017215554
@@ Property / OpenAlex ID: W2017215554 / rank @@
+Normal rank