A cyclical search for the two machine flow shop and open shop to minimise finishing time (Q2356124): Difference between revisions

@@ Property / author @@
-Alan J. Soper
@@ Property / author: Alan J. Soper / rank @@
-Normal rank
@@ Property / author @@
+Alan J. Soper
@@ Property / author: Alan J. Soper / 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/s10951-013-0356-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2068762498
@@ Property / OpenAlex ID: W2068762498 / rank @@
+Normal rank
@@ Property / cites work @@
+Open Shop Scheduling to Minimize Finish Time
@@ Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank @@
+Normal rank
@@ Property / cites work @@
+Three is easy, two is hard: Open shop sum-batch scheduling problem refined
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Q3964013
@@ Property / cites work: Q3964013 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2356124