An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357): Difference between revisions

@@ Property / cites work @@
+A branch and bound algorithm for the job-shop scheduling problem
+Normal rank
@@ Property / cites work @@
+The one-machine sequencing problem
@@ Property / cites work: The one-machine sequencing problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Solving the Job-Shop Problem
@@ Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing late jobs in the general one machine scheduling problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+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 @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank
@@ Property / cites work @@
+Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
+Normal rank
@@ Property / Wikidata QID @@
+Q127960074
@@ Property / Wikidata QID: Q127960074 / rank @@
+Normal rank