No-wait or no-idle permutation flowshop scheduling with dominating machines (Q1767400): Difference between revisions

@@ Property / cites work @@
+Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
+Normal rank
@@ Property / cites work @@
+Nonpreemptive flowshop scheduling with machine dominance
+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 @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Flowshop scheduling with dominant machines
@@ Property / cites work: Flowshop scheduling with dominant machines / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+A concise survey of efficiently solvable special cases of the permutation flow-shop problem
+Normal rank
@@ Property / cites work @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank
@@ Property / cites work @@
+Flow-shops with a dominant machine
@@ Property / cites work: Flow-shops with a dominant machine / rank @@
+Normal rank
@@ Property / cites work @@
+Some new results in flow shop scheduling
@@ Property / cites work: Some new results in flow shop scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+The Three-Machine No-Wait Flow Shop is NP-Complete
+Normal rank