The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine (Q1951910): Difference between revisions

@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Q4055377
@@ Property / cites work: Q4055377 / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
+Normal rank
@@ Property / cites work @@
+Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
+Normal rank
@@ Property / cites work @@
+Efficient approximation schemes for scheduling problems with release dates and delivery times
+Normal rank
@@ Property / cites work @@
+Optimal Sequencing of a Single Machine Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Q3885495
@@ Property / cites work: Q3885495 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s1064230706060098
+Normal rank
@@ Property / OpenAlex ID @@
+W2129008451
@@ Property / OpenAlex ID: W2129008451 / rank @@
+Normal rank