The permutation flow shop with buffers: A tabu search approach (Q1610144): Difference between revisions

@@ Property / cites work @@
+A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
+Normal rank
@@ Property / cites work @@
+Flowshop sequencing problems with limited buffer storage
+Normal rank
@@ Property / cites work @@
+A two-machine permutation flow shop scheduling problem with buffers
+Normal rank
@@ Property / cites work @@
+On two-machine scheduling with release and due dates to minimize maximum lateness
+Normal rank
@@ Property / cites work @@
+On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
+Normal rank
@@ Property / cites work @@
+A fast tabu search algorithm for the permutation flow-shop problem
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part I
@@ Property / cites work: Tabu Search—Part I / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Taboo Search Algorithm for the Job Shop Problem
+Normal rank
@@ Property / cites work @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(98)00017-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2114736096
@@ Property / OpenAlex ID: W2114736096 / rank @@
+Normal rank