Job-shop scheduling with limited capacity buffers (Q850665): Difference between revisions

@@ Property / author @@
-Peter Brucker
@@ Property / author: Peter Brucker / rank @@
-Normal rank
@@ Property / author @@
-Q627110
@@ Property / author: Q627110 / rank @@
-Normal rank
@@ Property / author @@
+Peter Brucker
@@ Property / author: Peter Brucker / rank @@
+Normal rank
@@ Property / author @@
+Johann L. Hurink
@@ Property / author: Johann L. Hurink / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00291-005-0008-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2052934732
@@ Property / OpenAlex ID: W2052934732 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4826104
@@ Property / cites work: Q4826104 / rank @@
+Normal rank
@@ Property / cites work @@
+Flow-shop problems with intermediate buffers
@@ Property / cites work: Flow-shop problems with intermediate buffers / rank @@
+Normal rank
@@ Property / cites work @@
+Flowshop sequencing problems with limited buffer storage
+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 @@
+A two-machine permutation flow shop scheduling problem with buffers
+Normal rank