An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint (Q2390265): 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.ipl.2004.03.004
+Normal rank
@@ Property / OpenAlex ID @@
+W1999266123
@@ Property / OpenAlex ID: W1999266123 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-machine flowshop scheduling with consecutive availability constraints
+Normal rank
@@ Property / cites work @@
+An improved heuristic for two-machine flowshop scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Two-machine flow shops with limited machine availability
+Normal rank
@@ Property / cites work @@
+Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
+Normal rank
@@ Property / cites work @@
+Machine scheduling with availability constraints
@@ Property / cites work: Machine scheduling with availability constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with limited machine availability
@@ Property / cites work: Scheduling with limited machine availability / rank @@
+Normal rank