An analytical approach to prototype vehicle test scheduling

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.

[1]  Donghe Pei,et al.  Cusps of Bishop Spherical Indicatrixes and Their Visualizations , 2013 .

[2]  Kenneth Chelst,et al.  Rightsizing and Management of Prototype Vehicle Testing at Ford Motor Company , 2001, Interfaces.

[3]  Jürgen Zimmermann,et al.  Scheduling tests in automotive R&D projects , 2009, Eur. J. Oper. Res..

[4]  Chunfeng Liu A Hybrid Genetic Algorithm to Minimize Total Tardiness for Unrelated Parallel Machine Scheduling with Precedence Constraints , 2013 .

[5]  Gerd Finke,et al.  Minimizing the number of machines for minimum length schedules , 2009, Eur. J. Oper. Res..

[6]  Ronald G. Askin,et al.  Heuristic scheduling of parallel machines with sequence-dependent set-up times , 2001 .

[7]  Yang-Kuei Lin,et al.  Unrelated parallel machine scheduling with setup times and ready times , 2014 .

[8]  F. Frank Chen,et al.  Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective , 2003 .

[9]  Malgorzata Sterna,et al.  A survey of scheduling problems with late work criteria , 2011 .

[10]  Jose A. Ventura,et al.  Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times , 2000 .

[11]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[12]  R. Heady,et al.  Minimizing the sum of job earliness and tardiness in a multimachine system , 1998 .

[13]  Dong Cao,et al.  Parallel machine selection and job scheduling to minimize machine cost and job tardiness , 2005, Comput. Oper. Res..

[14]  Guochuan Zhang,et al.  Scheduling with a minimum number of machines , 2009, Oper. Res. Lett..

[15]  Tadeusz Sawik An integer programming approach to scheduling in a contaminated area , 2010 .

[16]  Ghaith Rabadi,et al.  Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times , 2006, J. Intell. Manuf..

[17]  Mariem Gzara,et al.  A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts , 2011, INFORMS J. Comput..

[18]  Frank Werner,et al.  Minimizing the number of machines for scheduling jobs with equal processing times , 2009, Eur. J. Oper. Res..

[19]  Zhonghua Wu,et al.  Mathematical Modeling of Heat and Mass Transfer in Energy Science and Engineering , 2013 .

[20]  Bahram Alidaee,et al.  Parallel Machine Selection and Job Scheduling to Minimize Sum of Machine Holding Cost, Total Machine Time Costs, and Total Tardiness Costs , 2014, IEEE Transactions on Automation Science and Engineering.

[21]  Mark S. Daskin,et al.  Improving fleet utilization for carriers by interval scheduling , 2012, Eur. J. Oper. Res..

[22]  Jeng-Fung Chen,et al.  Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints , 2006 .

[23]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[24]  Funda Sivrikaya-Serifoglu,et al.  Parallel machine scheduling with earliness and tardiness penalties , 1999, Comput. Oper. Res..

[25]  Zhiwei Zhu,et al.  Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach , 2000 .

[26]  Uwe Schwiegelshohn,et al.  Improvements of constraint programming and hybrid methods for scheduling of tests on vehicle prototypes , 2012, Constraints.

[27]  Chris N. Potts,et al.  Fifty years of scheduling: a survey of milestones , 2009, J. Oper. Res. Soc..

[28]  Nagraj Balakrishnan,et al.  Early/tardy scheduling with sequence dependent setups on uniform parallel machines , 1999, Comput. Oper. Res..

[29]  Thomas Erlebach,et al.  Scheduling with Release Times and Deadlines on a Minimum Number of Machines , 2004, IFIP TCS.