[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-77903-2_65.html
   My bibliography  Save this book chapter

Scheduling of Tests on Vehicle Prototypes Using Constraint and Integer Programming

In: Operations Research Proceedings 2007

Author

Listed:
  • Kamol Limtanyakul

    (Dortmund University)

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.

Suggested Citation

  • Kamol Limtanyakul, 2008. "Scheduling of Tests on Vehicle Prototypes Using Constraint and Integer Programming," Operations Research Proceedings, in: Jörg Kalcsics & Stefan Nickel (ed.), Operations Research Proceedings 2007, pages 421-426, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-77903-2_65
    DOI: 10.1007/978-3-540-77903-2_65
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-540-77903-2_65. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.