Polynomial time algorithms for the UET permutation flowshop problem with time delays (Q2384903): 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.cor.2006.03.018
+Normal rank
@@ Property / OpenAlex ID @@
+W2161560287
@@ Property / OpenAlex ID: W2161560287 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3525910
@@ Property / cites work: Q3525910 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Flowshop and Jobshop Schedules: Complexity and Approximation
+Normal rank
@@ Property / cites work @@
+Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags
+Normal rank
@@ Property / cites work @@
+Permutation flowshop scheduling problems with maximal and minimal time lags
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
+Normal rank
@@ Property / cites work @@
+Q4884350
@@ Property / cites work: Q4884350 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2384903