Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of single machine, multi-criteria scheduling problems
+Normal rank
@@ Property / cites work @@
+A new decomposition approach for the single machine total tardiness scheduling problem
+Normal rank
@@ 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 @@
+Q4002567
@@ Property / cites work: Q4002567 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4124332
@@ Property / cites work: Q4124332 / rank @@
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation scheme for the total tardiness problem
+Normal rank
@@ Property / cites work @@
+Solution of the single machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Algorithmic paradoxes of the single-machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+A bicriterion approach to time/cost trade-offs in sequencing
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0166-218x(01)00334-1
+Normal rank
@@ Property / OpenAlex ID @@
+W1994488876
@@ Property / OpenAlex ID: W1994488876 / rank @@
+Normal rank