An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem (Q398866): Difference between revisions

@@ Property / cites work @@
+Maximizing the weighted number of just-in-time jobs in flow shop scheduling
+Normal rank
@@ Property / cites work @@
+An improved FPTAS for Restricted Shortest Path.
@@ Property / cites work: An improved FPTAS for Restricted Shortest Path. / rank @@
+Normal rank
@@ Property / cites work @@
+Fast approximation algorithm for job sequencing with deadlines
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Approximation Schemes for the Restricted Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Single machine scheduling to minimize the number of early and tardy jobs
+Normal rank
@@ Property / cites work @@
+Q2917206
@@ Property / cites work: Q2917206 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple efficient approximation scheme for the restricted shortest path problem
+Normal rank
@@ Property / cites work @@
+Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
+Normal rank