Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641): Difference between revisions

← Older edit Newer edit →

@@ Property / Recommended article @@
+Makespan minimization in job shops: a polynomial time approximation scheme
+Normal rank
+Similarity Score: 0.93882847Amount 0.93882847
Unit 1
-Amount
+.93882847
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
+Normal rank
+Similarity Score: 0.9200907Amount 0.9200907
Unit 1
-Amount
+.9200907
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+New efficient heuristics for scheduling open shops with makespan minimization
+Normal rank
+Similarity Score: 0.91364694Amount 0.91364694
Unit 1
-Amount
+.91364694
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
+Normal rank
+Similarity Score: 0.9089877Amount 0.9089877
Unit 1
-Amount
+.9089877
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
+Normal rank
+Similarity Score: 0.9073361Amount 0.9073361
Unit 1
-Amount
+.9073361
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
+Normal rank
+Similarity Score: 0.90662813Amount 0.90662813
Unit 1
-Amount
+.90662813
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A linear time approximation scheme for makespan minimization in an open shop with release dates
+Normal rank
+Similarity Score: 0.90303874Amount 0.90303874
Unit 1
-Amount
+.90303874
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4367460
@@ Property / Recommended article: Q4367460 / rank @@
+Normal rank
@@ Property / Recommended article: Q4367460 / qualifier @@
+Similarity Score: 0.89655215Amount 0.89655215
Unit 1
-Amount
+.89655215
 Unit
@@ Property / Recommended article: Q4367460 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Four decades of research on the open-shop scheduling problem to minimize the makespan
+Normal rank
+Similarity Score: 0.8898996Amount 0.8898996
Unit 1
-Amount
+.8898996
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Polynomial time approximation algorithms for proportionate open‐shop scheduling
+Normal rank
+Similarity Score: 0.8895185Amount 0.8895185
Unit 1
-Amount
+.8895185
 Unit
+Recommender Run: Recommender Run 2