Unary NP-hardness of minimizing the number of tardy jobs with deadlines (Q2398650): Difference between revisions

@@ 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.1007/s10951-016-0479-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2341012368
@@ Property / OpenAlex ID: W2341012368 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of single machine scheduling to minimize weighted number of tardy jobs
+Normal rank
@@ Property / cites work @@
+Multiagent Scheduling
@@ Property / cites work: Multiagent Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Problems with Two Competing Agents
@@ Property / cites work: Scheduling Problems with Two Competing Agents / rank @@
+Normal rank
@@ Property / cites work @@
+A multiple-criterion model for machine scheduling
@@ Property / cites work: A multiple-criterion model for machine scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
+Normal rank
@@ Property / cites work @@
+The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
+Normal rank
@@ Property / cites work @@
+A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
+Normal rank
@@ Property / cites work @@
+Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
+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 @@
+The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2398650