W
Wiebke Höhn
Researcher at Technical University of Berlin
Publications - 12
Citations - 202
Wiebke Höhn is an academic researcher from Technical University of Berlin. The author has contributed to research in topics: Job shop scheduling & Scheduling (computing). The author has an hindex of 8, co-authored 12 publications receiving 187 citations.
Papers
More filters
Book ChapterDOI
On the performance of smith's rule in single-machine scheduling with nonlinear cost
Wiebke Höhn,Tobias Jacobs +1 more
TL;DR: A tight analysis of the approximation factor of Smith's rule under any particular convex or concave cost function is considered, which turns out that the tight approximation ratio can be calculated as the root of a univariate polynomial.
Journal ArticleDOI
On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
Wiebke Höhn,Tobias Jacobs +1 more
TL;DR: It turns out that the tight approximation ratio can be calculated as the root of a univariate polynomial, and it is shown that this approximation ratio is asymptotically equal to k(k − 1)/(k + 1), denoting by k the degree of the cost function.
Journal ArticleDOI
On Eulerian extensions and their application to no-wait flowshop scheduling
TL;DR: A variant of no-wait flowshop scheduling that is motivated by continuous casting in the multistage production process in steel manufacturing is considered, and a very intuitive optimal algorithm for scheduling on two processing stages with one machine in the first stage is given.
Journal ArticleDOI
Integrated Sequencing and Scheduling in Coil Coating
TL;DR: This paper considers a complex planning problem in integrated steel production, where a sequence of coils of sheet metal needs to be color coated in consecutive stages, and presents an optimization model for this integrated sequencing and scheduling problem.
Proceedings Article
An experimental and analytical study of order constraints for single machine scheduling with quadratic cost
Wiebke Höhn,Tobias Jacobs +1 more
TL;DR: This work enhances the map of known order constraints by proving an extended version of a constraint that has been conjectured by Mondal and Sen more than a decade ago by proving the inuence of different kinds order constraints on the performance of exact algorithms is systematically evaluated.