Two models for a family of flowshop sequencing problems (Q1848365): Difference between revisions

@@ Property / cites work @@
+Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
+Normal rank
@@ Property / cites work @@
+Q4658190
@@ Property / cites work: Q4658190 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3876834
@@ Property / cites work: Q3876834 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
+Normal rank
@@ Property / cites work @@
+A MILP model for the<i>n</i>-job,<i>M</i>-stage flowshop with sequence dependent set-up times
+Normal rank
@@ Property / cites work @@
+On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
+Normal rank
@@ Property / cites work @@
+Two MILP models for the N × M SDST flowshop sequencing problem
+Normal rank
@@ Property / cites work @@
+Optimal Elimination Methods in the <i>m</i> × <i>n</i> Flow-Shop Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(01)00320-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2013303203
@@ Property / OpenAlex ID: W2013303203 / rank @@
+Normal rank