High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471): Difference between revisions

@@ Property / cites work @@
+Single machine scheduling with forbidden start times
+Normal rank
@@ Property / cites work @@
+A framework for the complexity of high-multiplicity scheduling problems
+Normal rank
@@ Property / cites work @@
+Operator non-availability periods
@@ Property / cites work: Operator non-availability periods / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with high multiplicity
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+An asymptotically exact algorithm for the high-multiplicity bin packing problem
+Normal rank
@@ Property / cites work @@
+Exact and approximate algorithms for high-multiplicity parallel machine scheduling
+Normal rank
@@ Property / cites work @@
+Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
+Normal rank
@@ Property / cites work @@
+Single machine scheduling with small operator-non-availability periods
+Normal rank