A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work (Q5024913): Difference between revisions

@@ Property / cites work @@
+Q3680271
@@ Property / cites work: Q3680271 / rank @@
+Normal rank
@@ Property / cites work @@
+Survey of scheduling research involving due date determination decisions
+Normal rank
@@ Property / cites work @@
+Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
+Normal rank
@@ Property / cites work @@
+Scheduling on parallel identical machines with late work criterion: offline and online cases
+Normal rank
@@ Property / cites work @@
+Notes on inverse bin-packing problems
@@ Property / cites work: Notes on inverse bin-packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+A common approximation framework for early work, late work, and resource leveling problems
+Normal rank
@@ Property / cites work @@
+Single Machine Scheduling to Minimize Total Weighted Late Work
+Normal rank
@@ Property / cites work @@
+A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
+Normal rank
@@ Property / cites work @@
+Single Machine Scheduling to Minimize Total Late Work
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
+Normal rank