A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints (Q691393): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-011-0281-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2002962759
@@ Property / OpenAlex ID: W2002962759 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+An improved heuristic for two-machine flowshop scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+Encyclopedia of Optimization
@@ Property / cites work: Encyclopedia of Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
+Normal rank
@@ Property / cites work @@
+An improved algorithm for the two machine flow shop problem with several availability constraints
+Normal rank
@@ Property / cites work @@
+An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
+Normal rank
@@ Property / cites work @@
+Two-machine flowshop scheduling with availability constraints
+Normal rank
@@ Property / cites work @@
+Approximation results for flow shop scheduling problems with machine availability constraints
+Normal rank
@@ Property / cites work @@
+Two-machine flow shops with limited machine availability
+Normal rank
@@ Property / cites work @@
+An FPTAS for scheduling a two-machine flowshop with one unavailability interval
+Normal rank