Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (Q2448211): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-013-0671-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1964627392
@@ Property / OpenAlex ID: W1964627392 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling incompatible tasks on two machines
@@ Property / cites work: Scheduling incompatible tasks on two machines / rank @@
+Normal rank
@@ Property / cites work @@
+Unknown Input Observers Designed by Eigenstructure Assignment
+Normal rank
@@ Property / cites work @@
+A note on the two-stage hybrid flow shop problem with dedicated machines
+Normal rank
@@ Property / cites work @@
+Maximization problems in single machine scheduling
+Normal rank
@@ Property / cites work @@
+State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
+Normal rank
@@ Property / cites work @@
+A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
+Normal rank