A note on the single machine scheduling to minimize the number of tardy jobs with deadlines (Q1038367): Difference between revisions

@@ Property / author @@
+Yanpei Liu
@@ Property / author: Yanpei Liu / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2009.05.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2038017970
@@ Property / OpenAlex ID: W2038017970 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4396949
@@ Property / cites work: Q4396949 / rank @@
+Normal rank
@@ Property / cites work @@
+Monge properties, discrete convexity and applications
+Normal rank
@@ Property / cites work @@
+Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+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 @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Necessary and sufficient conditions of optimality for some classical scheduling problems
+Normal rank