IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v67y2017icp168-176.html
   My bibliography  Save this article

An analytical approach to prototype vehicle test scheduling

Author

Listed:
  • Shi, Yuhui
  • Reich, Daniel
  • Epelman, Marina
  • Klampfl, Erica
  • Cohn, Amy

Abstract

The test planning group within Ford׳s Product Development division develops schedules for building prototype vehicles and assigning them to departments in charge of different vehicle components, systems and aspects (e.g., powertrain, electrical, safety). These departments conduct tests at pre-production phases of each vehicle program (e.g., 2015 Ford Fusion, 2016 Ford Escape) to ensure the vehicles meet all requirements by the time they reach the production phase. Each prototype can cost in excess of $200K because many of the parts and the prototypes themselves are hand-made and highly customized. Parts needed often require months of lead time, which constrains when vehicle builds can start. That, combined with inflexible deadlines for completing tests on those prototypes introduces significant time pressure, an unavoidable and challenging reality. One way to alleviate time pressure is to build more prototype vehicles; however, this would greatly increase the cost of each program. A more efficient way is to develop test plans with tight schedules that combine multiple tests on vehicles to fully utilize all available time. There are many challenges that need to be overcome in implementing this approach, including complex compatibility relationships between the tests and destructive nature of, e.g., crash tests. We introduce analytical approaches for obtaining efficient schedules to replace the tedious manual scheduling process engineers undertake for each program. Our models and algorithms save test planners׳ and engineers׳ time, increases their ability to quickly react to program changes, and save resources by ensuring maximal vehicle utilization.

Suggested Citation

  • Shi, Yuhui & Reich, Daniel & Epelman, Marina & Klampfl, Erica & Cohn, Amy, 2017. "An analytical approach to prototype vehicle test scheduling," Omega, Elsevier, vol. 67(C), pages 168-176.
  • Handle: RePEc:eee:jomega:v:67:y:2017:i:c:p:168-176
    DOI: 10.1016/j.omega.2016.05.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048316302080
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.omega.2016.05.003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Samir Elhedhli & Lingzi Li & Mariem Gzara & Joe Naoum-Sawaya, 2011. "A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 404-415, August.
    2. Cheng, T. C. E. & Sin, C. C. S., 1990. "A state-of-the-art review of parallel-machine scheduling research," European Journal of Operational Research, Elsevier, vol. 47(3), pages 271-292, August.
    3. Lee, Soonhui & Turner, Jonathan & Daskin, Mark S. & Homem-de-Mello, Tito & Smilowitz, Karen, 2012. "Improving fleet utilization for carriers by interval scheduling," European Journal of Operational Research, Elsevier, vol. 218(1), pages 261-269.
    4. Chen, Jeng-Fung & Wu, Tai-Hsi, 2006. "Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints," Omega, Elsevier, vol. 34(1), pages 81-89, January.
    5. Finke, Gerd & Lemaire, Pierre & Proth, Jean-Marie & Queyranne, Maurice, 2009. "Minimizing the number of machines for minimum length schedules," European Journal of Operational Research, Elsevier, vol. 199(3), pages 702-705, December.
    6. Bartels, J.-H. & Zimmermann, J., 2009. "Scheduling tests in automotive R&D projects," European Journal of Operational Research, Elsevier, vol. 193(3), pages 805-819, March.
    7. Sawik, Tadeusz, 2010. "An integer programming approach to scheduling in a contaminated area," Omega, Elsevier, vol. 38(3-4), pages 179-191, June.
    8. Kenneth Chelst & John Sidelko & Alex Przebienda & Jeffrey Lockledge & Dimitrios Mihailidis, 2001. "Rightsizing and Management of Prototype Vehicle Testing at Ford Motor Company," Interfaces, INFORMS, vol. 31(1), pages 91-107, February.
    9. Sterna, Malgorzata, 2011. "A survey of scheduling problems with late work criteria," Omega, Elsevier, vol. 39(2), pages 120-129, April.
    10. Kravchenko, Svetlana A. & Werner, Frank, 2009. "Minimizing the number of machines for scheduling jobs with equal processing times," European Journal of Operational Research, Elsevier, vol. 199(2), pages 595-600, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Christian Weckenborg & Karsten Kieckhäfer & Thomas S. Spengler & Patricia Bernstein, 2020. "The Volkswagen Pre-Production Center Applies Operations Research to Optimize Capacity Scheduling," Interfaces, INFORMS, vol. 50(2), pages 119-136, March.
    2. Simone König & Maximilian Reihn & Felipe Gelinski Abujamra & Alexander Novy & Birgit Vogel-Heuser, 2023. "Flexible scheduling of diagnostic tests in automotive manufacturing," Flexible Services and Manufacturing Journal, Springer, vol. 35(2), pages 320-342, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Daniel Reich & Yuhui Shi & Marina Epelman & Amy Cohn & Ellen Barnes & Kirk Arthurs & Erica Klampfl, 2016. "Scheduling Crash Tests at Ford Motor Company," Interfaces, INFORMS, vol. 46(5), pages 409-423, October.
    2. Christian Weckenborg & Karsten Kieckhäfer & Thomas S. Spengler & Patricia Bernstein, 2020. "The Volkswagen Pre-Production Center Applies Operations Research to Optimize Capacity Scheduling," Interfaces, INFORMS, vol. 50(2), pages 119-136, March.
    3. Edis, Emrah B. & Oguz, Ceyda & Ozkarahan, Irem, 2013. "Parallel machine scheduling with additional resources: Notation, classification, models and solution methods," European Journal of Operational Research, Elsevier, vol. 230(3), pages 449-463.
    4. Gerstl, Enrique & Mosheiov, Gur, 2013. "A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines," International Journal of Production Economics, Elsevier, vol. 146(1), pages 161-166.
    5. Karapetyan, Daniel & Mitrovic Minic, Snezana & Malladi, Krishna T. & Punnen, Abraham P., 2015. "Satellite downlink scheduling problem: A case study," Omega, Elsevier, vol. 53(C), pages 115-123.
    6. Yalaoui, F. & Chu, C., 2006. "New exact method to solve the Pm/rj/[summation operator]Cj schedule problem," International Journal of Production Economics, Elsevier, vol. 100(1), pages 168-179, March.
    7. Lin, Hung-Tso & Liao, Ching-Jong, 2003. "A case study in a two-stage hybrid flow shop with setup time and dedicated machines," International Journal of Production Economics, Elsevier, vol. 86(2), pages 133-143, November.
    8. Biber Nurit & Mor Baruch & Schlissel Yitzhak & Shapira Dana, 2023. "Lot scheduling involving completion time problems on identical parallel machines," Operational Research, Springer, vol. 23(1), pages 1-29, March.
    9. Zoltán Varga & Pál Simon, 2014. "Examination Of Scheduling Methods For Production Systems," Advanced Logistic systems, University of Miskolc, Department of Material Handling and Logistics, vol. 8(1), pages 111-120, December.
    10. Nepal, Bimal & Lassan, Gregg & Drow, Baba & Chelst, Kenneth, 2009. "A set-covering model for optimizing selection of portfolio of microcontrollers in an automotive supplier company," European Journal of Operational Research, Elsevier, vol. 193(1), pages 272-281, February.
    11. George L. Vairaktarakis, 2003. "The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem," Management Science, INFORMS, vol. 49(6), pages 718-732, June.
    12. Anurag Agarwal & Varghese S. Jacob & Hasan Pirkul, 2006. "An Improved Augmented Neural-Network Approach for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 119-128, February.
    13. Malgorzata Sterna & Kateryna Czerniachowska, 2017. "Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work," Journal of Optimization Theory and Applications, Springer, vol. 174(3), pages 927-944, September.
    14. Yuan Zhang & Jinjiang Yuan, 2019. "A note on a two-agent scheduling problem related to the total weighted late work," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 989-999, April.
    15. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).
    16. Jose L. Andrade-Pineda & David Canca & Pedro L. Gonzalez-R & M. Calle, 2020. "Scheduling a dual-resource flexible job shop with makespan and due date-related criteria," Annals of Operations Research, Springer, vol. 291(1), pages 5-35, August.
    17. Yunqiang Yin & Jianyou Xu & T. C. E. Cheng & Chin‐Chia Wu & Du‐Juan Wang, 2016. "Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(2), pages 172-183, March.
    18. Hesham K. Alfares, 2022. "Plant shutdown maintenance workforce team assignment and job scheduling," Journal of Scheduling, Springer, vol. 25(3), pages 321-338, June.
    19. Andrea Bettinelli & Valentina Cacchiani & Enrico Malaguti, 2017. "A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 457-473, August.
    20. Hosni, Hadi & Naoum-Sawaya, Joe & Artail, Hassan, 2014. "The shared-taxi problem: Formulation and solution methods," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 303-318.

    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:eee:jomega:v:67:y:2017:i:c:p:168-176. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.