A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (Q337146): Difference between revisions

@@ Property / author @@
-Xi-wen Lu
@@ Property / author: Xi-wen Lu / rank @@
-Normal rank
@@ Property / author @@
+Xi-wen Lu
@@ Property / author: Xi-wen Lu / 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.1016/j.cor.2014.06.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2063910010
@@ Property / OpenAlex ID: W2063910010 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling of two-machine open shops where jobs arrive over time
+Normal rank
@@ Property / cites work @@
+Approximability of flow shop scheduling
@@ Property / cites work: Approximability of flow shop scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
+Normal rank
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times
+Normal rank
@@ Property / cites work @@
+Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
+Normal rank
@@ Property / cites work @@
+Minimising makespan in the two-machine flow-shop with release times
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:337146