Minimizing the number of tardy job units under release time constraints

@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}
}
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

From This Paper

Topics from this paper.
22 Citations
7 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

References

Publications referenced by this paper.
Showing 1-7 of 7 references

An algorithm for the detection and construction of Monge sequences

  • N. Alon, S. Cosares, D. Hochbaum, R. Shamir
  • Linear Algebra Appl. 114/l
  • 1989

Monge sequences, antimatroids, and the transportation problem with forbidden arcs, Rept

  • B. L. Dietrich
  • IBM T.J. Watson Research Center
  • 1989

Graphs and Hypergraphs

  • C. Berge
  • (North-Holland, Amsterdam,
  • 1973
2 Excerpts

On simple transportation problems, in: V. Klee, ed., Convexity

  • A. Hoffman
  • Proceedings of Symposia in Pure Mathematics 7…
  • 1963

Similar Papers

Loading similar papers…