The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan (Q1043332): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2009.07.030
+Normal rank
@@ Property / OpenAlex ID @@
+W2056671020
@@ Property / OpenAlex ID: W2056671020 / rank @@
+Normal rank
@@ Property / cites work @@
+Open shop scheduling with delays
@@ Property / cites work: Open shop scheduling with delays / rank @@
+Normal rank
@@ Property / cites work @@
+Two-machine open shop scheduling with special transportation times
+Normal rank
@@ Property / cites work @@
+A heuristic for the two-machine open-shop scheduling problem with transportation times
+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 @@
+On-line two-machine open shop scheduling with time lags
+Normal rank