direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications

Articles in Refereed Conference Proceedings

Höhn, W., Mestre, J. and Wiese, A.
How Unsplittable-Flow-Covering helps Scheduling with Job-Dependent Cost Functions.
In Proc. of the 41st International Colloquium on Automata, Languages, and Programming (ICALP), LNCS, Vol. 8572, pp. 625-636, Springer, 2014.  [pdf]


Höhn, W. and Jacobs, T.
An experimental and analytical study of order constraints for single machine scheduling with quadratic cost.
In Proc. of the 14th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 103-117, SIAM, 2012.  [pdf]


Höhn, W. and Jacobs, T.
On the performance of Smith's rule in single-machine scheduling with nonlinear cost.
In Proc. of the 10th Latin American Theoretical Informatics Symposium (LATIN), LNCS, Vol. 7256, pp. 482-493, Springer, 2012.  [pdf]


Journal Articles

Integrated Sequencing and Scheduling in Coil Coating
Citation key HoehnKoenigLuebbecke+2011
Author Höhn, Wiebke and König, Felix G. and Lübbecke, Marco E. and Möhring, Rolf H.
Pages 647–666
Year 2011
DOI 10.1287/mnsc.1100.1302
Journal Management Science
Volume 57
Number 4
Note Finalist for the EURO Excellence in Practice Award 2009
Publisher Informs
Abstract We consider a complex planning problem in integrated steel production. A sequence of coils of sheet metal needs to be color coated in consecutive stages. Different coil geometries and changes of colors necessitate time-consuming setup work. In most coating stages one can choose between two parallel color tanks. This can either reduce the number of setups needed or enable setups concurrent with production. A production plan comprises the sequencing of coils and the scheduling of color tanks and setup work. The aim is to minimize the makespan for a given set of coils. We present an optimization model for this integrated sequencing and scheduling problem. A core component is a graph theoretical model for concurrent setup scheduling. It is instrumental for building a fast heuristic that is embedded into a genetic algorithm to solve the sequencing problem. The quality of our solutions is evaluated via an integer program based on a combinatorial relaxation, showing that our solutions are within 10% of the optimum. Our algorithm is implemented at Salzgitter Flachstahl GmbH, a major German steel producer. This has led to an average reduction in makespan by over 13% and has greatly exceeded expectations.
Link to publication Link to original publication Download Bibtex entry

Copyright notice

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.