Single machine scheduling with release times, deadlines and tardiness objectives (Q5946156): Difference between revisions

@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
+Normal rank
@@ Property / cites work @@
+A New Dominance Concept in Scheduling <i>n</i> Jobs on a Single Machine with Ready Times and Due Dates
+Normal rank
@@ Property / cites work @@
+Two-Processor Scheduling with Start-Times and Deadlines
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
+Normal rank
@@ Property / cites work @@
+A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
+Normal rank
@@ Property / cites work @@
+The Total Tardiness Problem: Review and Extensions
+Normal rank
@@ Property / cites work @@
+Q4124332
@@ Property / cites work: Q4124332 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4055377
@@ Property / cites work: Q4055377 / 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 @@
+A decomposition algorithm for the single machine total tardiness problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(00)00207-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2021945696
@@ Property / OpenAlex ID: W2021945696 / rank @@
+Normal rank