Tabu Search for a Car Sequencing Problem

Nicolas Zufferey, Martin Studer, Edward A. Silver

The goal of this paper is to propose a tabu search heuristic for the car sequencing problem 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.

Subjects: 1.12 Scheduling; 15.2 Constraint Satisfaction

Submitted: Jan 31, 2006


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.