Formulating a scheduling problem with almost identical jobs by using positional completion times (Q5101423): Difference between revisions

@@ Property / cites work @@
+Batching and Scheduling Jobs on Batch and Discrete Processors
+Normal rank
@@ Property / cites work @@
+Minimizing total completion time in a two-machine flowshop: Analysis of special cases
+Normal rank
@@ Property / cites work @@
+New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
+Normal rank
@@ Property / cites work @@
+Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
+Normal rank
@@ Property / cites work @@
+A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
+Normal rank
@@ Property / cites work @@
+Single-Machine Scheduling Polyhedra with Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Dual decomposition of a single-machine scheduling problem
+Normal rank
@@ Property / cites work @@
+Q3998797
@@ Property / cites work: Q3998797 / rank @@
+Normal rank