Scheduling of Tests on Vehicle Prototypes Using Constraint and Integer Programming

Kamol Limtanyakul ()
Additional contact information
Kamol Limtanyakul: Dortmund University

A chapter in Operations Research Proceedings 2007, 2008, pp 421-426 from Springer

Abstract: Abstract We address a scheduling problem in the automobile industry where hundreds of tests must be performed on vehicle prototypes. The objective is to minimize the number of required prototypes, while all tests are executed with respect to several kinds of constraints. We apply Constraint Programming (CP) to solve the complete problem. Then to complement CP in finding a good lower bound, we separately solve an Integer Programming (IP) model which is simplified to cope with the large scale of the problems involved. This model is based on two main principles: set covering to select prototypes with suitable components for all tests; and energetic reasoning to determine the number of prototypes definitely required over the time intervals between the distinct values of the release and due dates. Computational results show that CP can achieve good feasible solutions as confirmed by the results obtained from solving the simplified IP model.

Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:oprchp:978-3-540-77903-2_65

Ordering information: This item can be ordered from
http://www.springer.com/9783540779032

DOI: 10.1007/978-3-540-77903-2_65

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().