@inproceedings{f17f5726495f49a7abc2f812c134f0e3,
title = "Rounding of sequences and matrices, with applications",
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.",
author = "Benjamin Doerr and Tobias Friedrich and Christian Klein and Ralf Osbild",
year = "2006",
month = jul,
day = "11",
doi = "10.1007/11671411\_8",
language = "English",
isbn = "3540322078",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "96--109",
booktitle = "Approximation and Online Algorithms - Third International Workshop, WAOA 2005, Revised Selected Papers",
note = "3rd International Workshop on Approximation and Online Algorithms, WAOA 2005 ; Conference date: 06-10-2005 Through 07-10-2005",
}