Tabu Search for a Car Sequencing Problem

The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was proposed by the automobile manufacturer Renault. The first objective of the car industry is to assign a production day to each customer-ordered car and the second one consists of scheduling the order of cars to be put on the line for each production day, while satisfying as many requirements as possible of the plant shops: paint shop and assembly line.

• Type: Conference
• Year: 2006
• Where: FLAIRS
• Authors: Nicolas Zufferey, Martin Studer, Edward A. Silver
• Keywords: Artificial Intelligence, Automobile Manufacturer Renault, Car Sequencing Problem, FLAIRS 2006, NP-hard Problem