Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements (Q5915911): Difference between revisions

@@ 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.1016/j.jda.2018.11.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2900789887
@@ Property / OpenAlex ID: W2900789887 / rank @@
+Normal rank
@@ Property / cites work @@
+Permutation schedules for a two-machine flow shop with storage
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications
+Normal rank
@@ Property / cites work @@
+The variable neighborhood search for the two machine flow shop problem with a passive prefetch
+Normal rank
@@ Property / cites work @@
+A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
+Normal rank
@@ Property / cites work @@
+Simple heuristics for scheduling with limited intermediate storage
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5915911