Complexity results for flow-shop problems with a single server (Q1772843): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2004.04.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2170926441
@@ Property / OpenAlex ID: W2170926441 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
+Normal rank
@@ Property / cites work @@
+Scheduling equal-length jobs on identical parallel machines
+Normal rank
@@ Property / cites work @@
+Complexity results for parallel machine problems with a single server
+Normal rank
@@ Property / cites work @@
+One-operator-two-machine flowshop scheduling with setup and dismounting times
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling for parallel dedicated machines with a single server
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with a common server
@@ Property / cites work: Parallel machine scheduling with a common server / rank @@
+Normal rank
@@ Property / cites work @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling problems with a single server
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for parallel machine scheduling with a common server
+Normal rank