Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine (Q4432721): Difference between revisions

@@ Property / DOI @@
-.1002/nav.10056
@@ Property / DOI: 10.1002/nav.10056 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2009682943
@@ Property / OpenAlex ID: W2009682943 / rank @@
+Normal rank
@@ Property / cites work @@
+Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
+Normal rank
@@ Property / cites work @@
+Minimizing late jobs in the general one machine scheduling problem
+Normal rank
@@ Property / cites work @@
+A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
+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 @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank
@@ Property / cites work @@
+Q4040299
@@ Property / cites work: Q4040299 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
+Normal rank
@@ Property / DOI @@
+.1002/NAV.10056
@@ Property / DOI: 10.1002/NAV.10056 / rank @@
+Normal rank