Abstract
We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all column sums as well as all sums of consecutive row entries are less than two.Such roundings can be computed in linear time. This extends and improves previous results on rounding sequences and matrices in several directions. It has particular applications in just-in-time scheduling, where balanced schedules on machines with negligible switch over costs are sought after. Here we extend existing results to multiple machines and non-constant production rates.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Asano, T.: Digital halftoning: Algorithm engineering challenges. IEICE Trans. on Inf. and Syst. E86-D, 159–178 (2003)
Baranyai, Z.: On the factorization of the complete uniform hypergraph. In: Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday). Colloq. Math. Soc. Jánōs Bolyai, vol. I, 10, pp. 91–108. North-Holland, Amsterdam (1975)
Beck, J., Sós, V.T.: Discrepancy theory. In: Graham, R., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, pp. 1405–1446. Elsevier, Amsterdam (1995)
Bentley, J.L.: Algorithm design techniques. Commun. ACM 27, 865–871 (1984)
Brauner, N., Crama, Y.: The maximum deviation just-in-time scheduling problem. Discrete Appl. Math. 134, 25–50 (2004)
Causey, B.D., Cox, L.H., Ernst, L.R.: Applications of transportation theory to statistical problems. Journal of the American Statistical Association
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press, Cambridge (1990)
Cox, L.H., Ernst, L.R.: Controlled rounding. Informes 20(4), 423–432 (1982)
Doerr, B.: Lattice approximation and linear discrepancy of totally unimodular matrices. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 119–125 (2001)
Doerr, B.: Global roundings of sequences. Information Processing Letters 92, 113–116 (2004)
Doerr, B., Srivastav, A.: Multicolour discrepancies. Combinatorics, Probability and Computing 12, 365–399 (2003)
Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
Knuth, D.E.: Two-way rounding. SIAM J. Discrete Math. 8, 281–290 (1995)
Monden, Y.: What makes the Toyota production system really tick? Industrial Eng. 13, 36–46 (1981)
Monden, Y.: Toyota Production System. Industrial Engineering and Management Press, Norcross (1983)
Sadakane, K., Takki-Chebihi, N., Tokuyama, T.: Combinatorics and algorithms on low-discrepancy roundings of a real sequence. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 166–177. Springer, Heidelberg (2001)
Sadakane, K., Takki-Chebihi, N., Tokuyama, T.: Discrepancy-based digital halftoning: Automatic evaluation and optimization. In: Asano, T., Klette, R., Ronse, C. (eds.) Geometry, Morphology, and Computational Imaging. LNCS, vol. 2616, pp. 301–319. Springer, Heidelberg (2003)
Spencer, J.: Ten lectures on the probabilistic method. CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics, vol. 64. SIAM, Philadelphia (1994)
Steiner, G., Yeomans, S.: Level schedules for mixed-model, just-in-time processes. Management Science 39, 728–735 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doerr, B., Friedrich, T., Klein, C., Osbild, R. (2006). Rounding of Sequences and Matrices, with Applications. In: Erlebach, T., Persinao, G. (eds) Approximation and Online Algorithms. WAOA 2005. Lecture Notes in Computer Science, vol 3879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671411_8
Download citation
DOI: https://doi.org/10.1007/11671411_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32207-8
Online ISBN: 978-3-540-32208-5
eBook Packages: Computer ScienceComputer Science (R0)