Minimizing the weighted number of tardy jobs on a two-machine flow shop. (Q1413849): Difference between revisions

@@ Property / cites work @@
+A General Bounding Scheme for the Permutation Flow-Shop Problem
+Normal rank
@@ Property / cites work @@
+An adaptive branching rule for the permutation flow-shop problem
+Normal rank
@@ Property / cites work @@
+A Branch-and-Bound Method for Sequencing Problems with Linear and Exponential Penalty Functions
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Q4055377
@@ Property / cites work: Q4055377 / rank @@
+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 @@
+A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
+Normal rank
@@ Property / cites work @@
+Two-machine flowshop scheduling to minimize the number of tardy jobs
+Normal rank
@@ Property / cites work @@
+Flowshop scheduling with dominant machines
@@ Property / cites work: Flowshop scheduling with dominant machines / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing tardy jobs in a flowshop with common due date
+Normal rank
@@ Property / cites work @@
+Q4040299
@@ Property / cites work: Q4040299 / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n) algorithm for the multiple-choice knapsack linear program
+Normal rank