@phdthesis{Epping2004, author = {Epping, Thomas}, title = {Color sequencing}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-000000572}, school = {BTU Cottbus - Senftenberg}, year = {2004}, abstract = {In this dissertation, we present several solution approaches for the color change minimization problem that arises in the paint shop of an automobile plant. We give NP-completeness results for an abstract formulation of this problem and show that it is APX-hard, even in a restricted form. For this form, we establish a connection to binary matroids. When solving the color change minimization problem with the help of a line storage system, we present dynamic programs that use algorithms from computational biology, among others. Finally, we look into the color change minimization problem within the overall production process of an automobile plant. We describe an algorithm that sequences a daily production and that has been successfully developed with and implemented in the Ford Motor Company (Europe).}, subject = {Karosserie; Spritzlackieren; Farbwechseltechnik; Prozessoptimierung; Reihenfolgeproblem; APX-Hardness; Binary methods; Dynamic programming; Flexible manufacturing systems; Projekt management and scheduling}, language = {en} }