Permutation flowshop scheduling problems with maximal and minimal time lags (Q2581596): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2004.11.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2077452883
@@ Property / OpenAlex ID: W2077452883 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for flow-shop and open-shop scheduling problems with transportation delays
+Normal rank
@@ Property / cites work @@
+Shop Problems With Two Machines and Time Lags
@@ Property / cites work: Shop Problems With Two Machines and Time Lags / rank @@
+Normal rank
@@ Property / cites work @@
+Q4884350
@@ Property / cites work: Q4884350 / rank @@
+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 @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags
+Normal rank
@@ Property / cites work @@
+Q3995531
@@ Property / cites work: Q3995531 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+General Flowshop Models: Job Dependent Capacities, Job Overlapping and Deterioration
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem
+Normal rank