A MILP model for then-job,M-stage flowshop with sequence dependent set-up times (Q3743087): Difference between revisions

← Older edit

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207548608919815
+Normal rank
@@ Property / OpenAlex ID @@
+W2090902243
@@ Property / OpenAlex ID: W2090902243 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem: A Survey
@@ Property / cites work: The Traveling Salesman Problem: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+The Truck Dispatching Problem
@@ Property / cites work: The Truck Dispatching Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Balancing Workloads and Minimizing Set-up Costs in the Parallel Processing Shop
+Normal rank
@@ Property / cites work @@
+Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/<i>LP</i> Approach
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Traveling Salesman Problem
@@ Property / cites work: An Algorithm for the Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+A Production Scheduling Problem with Sequencing Considerations
+Normal rank
@@ Property / cites work @@
+Computational Experience with an <i>M</i>-Salesman Traveling Salesman Algorithm
+Normal rank
@@ Property / cites work @@
+A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems
+Normal rank
@@ Property / Recommended article @@
+Two MILP models for the N × M SDST flowshop sequencing problem
+Normal rank
+Similarity Score: 0.90991074Amount 0.90991074
Unit 1
-Amount
+.90991074
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+An approximate solution of the flow-shop problem with sequence dependent setup times
+Normal rank
+Similarity Score: 0.87040794Amount 0.87040794
Unit 1
-Amount
+.87040794
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A MILP model for an extended version of the flexible job shop problem
+Normal rank
+Similarity Score: 0.8633134Amount 0.8633134
Unit 1
-Amount
+.8633134
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A bicriteria \(m\)-machine flowshop scheduling with sequence-dependent setup times
+Normal rank
+Similarity Score: 0.8629396Amount 0.8629396
Unit 1
-Amount
+.8629396
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
+Normal rank
+Similarity Score: 0.86285955Amount 0.86285955
Unit 1
-Amount
+.86285955
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A branch and bound method for the job-shop problem with sequence-dependent setup times
+Normal rank
+Similarity Score: 0.86027056Amount 0.86027056
Unit 1
-Amount
+.86027056
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+New MILP models for the permutation flowshop problem
+Normal rank
+Similarity Score: 0.8595057Amount 0.8595057
Unit 1
-Amount
+.8595057
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Scheduling job shop problems with sequence-dependent setup times
+Normal rank
+Similarity Score: 0.8586759Amount 0.8586759
Unit 1
-Amount
+.8586759
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q3806968
@@ Property / Recommended article: Q3806968 / rank @@
+Normal rank
@@ Property / Recommended article: Q3806968 / qualifier @@
+Similarity Score: 0.8549299Amount 0.8549299
Unit 1
-Amount
+.8549299
 Unit
@@ Property / Recommended article: Q3806968 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Solving the flexible job shop scheduling problem with sequence-dependent setup times
+Normal rank
+Similarity Score: 0.8531537Amount 0.8531537
Unit 1
-Amount
+.8531537
 Unit
+Recommender Run: Recommender Run 2