Single-machine scheduling with periodic maintenance to minimize makespan revisited (Q398924): Difference between revisions

@@ Property / DOI @@
-.1007/s10951-013-0350-0
@@ Property / DOI: 10.1007/s10951-013-0350-0 / rank @@
-Normal rank
@@ Property / cites work @@
+Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
+Normal rank
@@ Property / cites work @@
+Two-machine flowshop scheduling with consecutive availability constraints
+Normal rank
@@ Property / cites work @@
+An improved heuristic for two-machine flowshop scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
+Normal rank
@@ Property / cites work @@
+Scheduling deteriorating jobs subject to job or machine availability constraints
+Normal rank
@@ Property / cites work @@
+Bounds for Certain Multiprocessing Anomalies
@@ Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with periodic maintenance to minimize makespan
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+A 71/60 theorem for bin packing
@@ Property / cites work: A 71/60 theorem for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter bounds of the First Fit algorithm for the bin-packing problem
+Normal rank
@@ Property / cites work @@
+A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan''
+Normal rank
@@ Property / cites work @@
+A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
+Normal rank
@@ Property / cites work @@
+A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
+Normal rank
@@ Property / DOI @@
+.1007/S10951-013-0350-0
@@ Property / DOI: 10.1007/S10951-013-0350-0 / rank @@
+Normal rank