@techreport{AuerDosaDulaietal.2019, author = {Auer, Peter and D{\´o}sa, Gy{\"o}rgy and Dulai, Tibor and F{\"u}genschuh, Armin and N{\"a}ser, Peggy and Ortner, Ronald and Werner-Stark, {\´A}gnes}, title = {A new heuristic and an exact approach for a production planning problem}, editor = {F{\"u}genschuh, Armin}, issn = {2627-6100}, doi = {10.26127/BTUOpen-4827}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-48278}, year = {2019}, abstract = {We deal with a very complex and hard scheduling problem. Several types of products are processed by a heterogeneous resource set, where resources have different operating capabilities and setup times are considered. The processing of the products follows different workflows, allowing also assembly lines. The goal is to process all products in minimum time, i.e., the makespan is to be minimized. Because of the complexity of the problem an exact solver would require too much running time. We propose a compound method where a heuristic is combined with an exact solver. Our proposed heuristic is composed of several phases applying different smart strategies. In order to reduce the computational complexity of the exact approach, we exploit the makespan determined by the heuristic as an upper bound for the time horizon, which has a direct in uence on the instance size used in the exact approach. We demonstrate the efficiency of our combined method on multiple problem classes. With the help of the heuristic the exact solver is able to obtain an optimal solution in a much shorter amount of time.}, subject = {Production planning; Mixed-integer programming; Heuristics; Simulation; Fertigungsprogrammplanung; Heuristik; Optimierung}, language = {en} }