scispace - formally typeset
Search or ask a question

Showing papers by "Rolf H. Möhring published in 2016"


Book ChapterDOI
01 Jan 2016
TL;DR: A generic algorithmic framework which aims at separating the side constraints from the general sequencing decisions, and which was the basis for achieving a makespan reduction of over \(13\%\) on average for the coil coating line of the authors' industrial partner.
Abstract: A huge number of problems in production planning ask for a somewhat good processing sequence. While all those problems share the common sequencing aspect, the underlying side constraints, and hence, the related scheduling decisions, are highly problem-specific. We propose a generic algorithmic framework which aims at separating the side constraints from the general sequencing decisions. This allows us to only focus on the optimization problem that remains when the processing sequence is already decided—in many cases yet another NP-hard problem. Compared to the overall problem, this subproblem is far more manageable. In cooperation with industry, our approach has been applied to problems of planning (sheet metal) coil coating lines and dairy filling lines, respectively. For the subproblem of the coil coating problem, we could observe a close relation to the maximum weight independent set problem on a special class of multiple-interval graphs. Thorough insights into this problem were finally the basis for achieving a makespan reduction of over \(13\%\) on average for the coil coating line of our industrial partner. For the less complex dairy problem, our solutions were on par with the manual production plans in use at the production site of our project partner. We could show that this solution is almost optimal, i.e., within a factor of 1.02 times a lower bound.