## Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints

- Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
- INFORMS Journal on Computing
- 2017

Highly Influenced

@article{Hochbaum1990MinimizingTN, title={Minimizing the number of tardy job units under release time constraints}, author={Dorit S. Hochbaum and Ron Shamir}, journal={Discrete Applied Mathematics}, year={1990}, volume={28}, pages={45-57} }

- Published 1990 in Discrete Applied Mathematics
DOI:10.1016/0166-218X(90)90093-R

We study two single-machine scheduling problems: Minimizing the weighted and unweighted number of tardy units, when release times are present. Fast strongly polynomial algorithms are given for both problems: For problems with n jobs, we give algorithms which require O(n log n) and O(n2) steps, for the unweighted and weighted problems respectively. Our results also imply an extension of the family of very efficiently solvable transportation problems, as well as these which are greedily solvable… CONTINUE READING

22 Citations

7 References

Similar Papers

Showing 1-7 of 7 references