IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v46y2016i5p409-423.html
   My bibliography  Save this article

Scheduling Crash Tests at Ford Motor Company

Author

Listed:
  • Daniel Reich

    (Research and Advanced Engineering, Ford Motor Company, Dearborn, Michigan 48124)

  • Yuhui Shi

    (Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109)

  • Marina Epelman

    (Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109)

  • Amy Cohn

    (Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109)

  • Ellen Barnes

    (Product Development Safety, Ford Motor Company, Dearborn, Michigan 48124)

  • Kirk Arthurs

    (Product Development Safety, Ford Motor Company, Dearborn, Michigan 48124)

  • Erica Klampfl

    (Research and Advanced Engineering, Ford Motor Company, Dearborn, Michigan 48124)

Abstract

We consider the problem of scheduling crash tests for new vehicle programs at Ford. We describe the development of a comprehensive web-based system that automates time-consuming scheduling analyses through mathematical optimization, while also institutionalizing expert knowledge about the engineering complexities of crash testing. We present a novel integer programming model and a corresponding solution algorithm that quickly generates efficient schedules. The system’s user interface enables engineers to specify key program data and consider multiple scheduling scenarios, while using the underlying optimization model and solution algorithms as a black box.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:orinte:v:46:y:2016:i:5:p:409-423
    DOI: 10.1287/inte.2016.0855
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2016.0855
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2016.0855?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. Zhi-Long Chen & Warren B. Powell, 1999. "Solving Parallel Machine Scheduling Problems by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 78-94, February.
    4. 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.
    5. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    6. 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.
    7. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    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. Shanshan Wang & Jinlin Li & Sanjay Mehrotra, 2021. "Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1661-1677, October.

    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. 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.
    2. Sung, Inkyung & Lee, Taesik, 2016. "Optimal allocation of emergency medical resources in a mass casualty incident: Patient prioritization by column generation," European Journal of Operational Research, Elsevier, vol. 252(2), pages 623-634.
    3. H. Fei & C. Chu & N. Meskens, 2009. "Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria," Annals of Operations Research, Springer, vol. 166(1), pages 91-108, February.
    4. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    5. Pereira Lopes, Manuel J. & de Carvalho, J.M. Valerio, 2007. "A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1508-1527, February.
    6. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    7. 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.
    8. Wang, Haibo & Alidaee, Bahram, 2019. "Effective heuristic for large-scale unrelated parallel machines scheduling problems," Omega, Elsevier, vol. 83(C), pages 261-274.
    9. F. Rodriguez & C. Blum & C. García-Martínez & M. Lozano, 2012. "GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times," Annals of Operations Research, Springer, vol. 201(1), pages 383-401, December.
    10. Artigues, Christian & Lopez, Pierre & Haït, Alain, 2013. "The energy scheduling problem: Industrial case-study and constraint propagation techniques," International Journal of Production Economics, Elsevier, vol. 143(1), pages 13-23.
    11. Hu, Qian & Zhu, Wenbin & Qin, Hu & Lim, Andrew, 2017. "A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function," European Journal of Operational Research, Elsevier, vol. 260(1), pages 70-80.
    12. Yanıkoğlu, İhsan & Yavuz, Tonguc, 2022. "Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 301(3), pages 875-895.
    13. Degraeve, Z. & Jans, R.F., 2003. "A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-010-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    14. Zhang, Guowei & Jia, Ning & Zhu, Ning & Adulyasak, Yossiri & Ma, Shoufeng, 2023. "Robust drone selective routing in humanitarian transportation network assessment," European Journal of Operational Research, Elsevier, vol. 305(1), pages 400-428.
    15. Markus Frey & Rainer Kolisch & Christian Artigues, 2017. "Column Generation for Outbound Baggage Handling at Airports," Transportation Science, INFORMS, vol. 51(4), pages 1226-1241, November.
    16. Zhi‐Long Chen & Warren B. Powell, 2003. "Exact algorithms for scheduling multiple families of jobs on parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 823-840, October.
    17. Hang Xu & Zhi-Long Chen & Srinivas Rajagopal & Sundar Arunapuram, 2003. "Solving a Practical Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 37(3), pages 347-364, August.
    18. Marjan van den Akker & Han Hoogeveen & Steef van de Velde, 2002. "Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem," INFORMS Journal on Computing, INFORMS, vol. 14(1), pages 37-51, February.
    19. Jans, Raf, 2010. "Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 251-254, July.
    20. Kerem Bülbül & Halil Şen, 2017. "An exact extended formulation for the unrelated parallel machine total weighted completion time problem," Journal of Scheduling, Springer, vol. 20(4), pages 373-389, August.

    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:inm:orinte:v:46:y:2016:i:5:p:409-423. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.