A large neighborhood search approach for the paint shop scheduling problem

Felix Winter () and Nysret Musliu ()
Additional contact information
Felix Winter: Christian Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling, DBAI, Institute of Logic and Computation
Nysret Musliu: Christian Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling, DBAI, Institute of Logic and Computation

Journal of Scheduling, 2022, vol. 25, issue 4, No 5, 453-475

Abstract: Abstract Minimizing the setup costs caused by color changes is one of the main concerns for paint shop scheduling in the automotive industry. Yet, finding an optimized color sequence is a very challenging task, as a large number of exterior systems for car manufacturing need to be painted in a variety of different colors. Therefore, there is a strong need for efficient automated scheduling solutions in this area. Previously, exact and metaheuristic approaches for creating efficient paint shop schedules in the automotive supply industry have been proposed and evaluated on a publicly available set of real-life benchmark instances. However, optimal solutions are still unknown for many of the benchmark instances, and there is still a potential of reducing color change costs for large instances. In this paper, we propose a novel large neighborhood search approach for the paint shop scheduling problem. We introduce innovative exact and heuristic solution methods that are utilized within the large neighborhood search and show that our approach leads to improved results for large real-life problem instances compared to existing techniques. Furthermore, we provide previously unknown upper bounds for 14 benchmark instances using the proposed method.

Keywords: Paint shop scheduling; Large neighborhood search; Local search (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-021-00713-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:25:y:2022:i:4:d:10.1007_s10951-021-00713-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-021-00713-7

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().