Complexity of flowshop scheduling problems with a new blocking constraint (Q2572855): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2004.08.046
+Normal rank
@@ Property / OpenAlex ID @@
+W2043849912
@@ Property / OpenAlex ID: W2043849912 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
+Normal rank
@@ Property / cites work @@
+Job-shop scheduling with blocking and no-wait constraints
+Normal rank
@@ Property / cites work @@
+The permutation flow shop with buffers: A tabu search approach
+Normal rank
@@ Property / cites work @@
+Flowshop scheduling with limited temporary storage
+Normal rank
@@ Property / cites work @@
+On the Flow-Shop Sequencing Problem with No Wait in Process<sup>†</sup>
+Normal rank