Two-machine scheduling with periodic availability constraints to minimize makespan (Q2514681): Difference between revisions

@@ Property / cites work @@
+An improved heuristic for two-machine flowshop scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+Bounds on Multiprocessing Timing Anomalies
@@ Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with periodic maintenance to minimize makespan
+Normal rank
@@ Property / cites work @@
+Makespan minimization for two parallel machines with an availability constraint
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with periodic maintenance and nonresumable jobs.
+Normal rank
@@ Property / cites work @@
+Machine scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+Approximation schemes for scheduling a maintenance and linear deteriorating jobs
+Normal rank
@@ Property / cites work @@
+Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+Makespan minimization for two parallel machines scheduling with a periodic availability constraint
+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