Optimality proof of the Kise-Ibaraki-Mine algorithm (Q2434284): Difference between revisions

@@ Property / cites work @@
+An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
+Normal rank
@@ Property / cites work @@
+A branch and bound to minimize the number of late jobs on a single machine with release time constraints
+Normal rank
@@ Property / cites work @@
+An exact method to minimize the number of tardy jobs in single machine scheduling
+Normal rank
@@ Property / cites work @@
+A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
+Normal rank
@@ Property / cites work @@
+A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
+Normal rank
@@ Property / cites work @@
+Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
+Normal rank
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on the Optimality Proof of the Kise-Ibaraki-Mine Algorithm
+Normal rank
@@ Property / cites work @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank
@@ Property / cites work @@
+Q3525911
@@ Property / cites work: Q3525911 / rank @@
+Normal rank