article

Scheduling Crash Tests at Ford Motor Company

Authors:

Erica KlampflAuthors Info & Claims

Interfaces, Volume 46, Issue 5

Pages 409 - 423

https://doi.org/10.1287/inte.2016.0855

Published: 01 October 2016 Publication History

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.

References

[1]

Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316-329.

Digital Library

Google Scholar

[2]

Bartels J-H, Zimmermann J (2009) Scheduling tests in automotive R&D projects. Eur. J. Oper. Res. 193(3):805-819.

Crossref

Google Scholar

[3]

Chelst K, Sidelko J, Przebienda A, Lockledge J, Mihailidis D (2001) Rightsizing and management of prototype vehicle testing at Ford Motor Company. Interfaces 31(1):91-107.

Digital Library

Google Scholar

[4]

Chen Z-L, Powell WB (1999) Solving parallel machine scheduling problems by column generation. INFORMS J. Comput. 11(1): 78-94.

Crossref

Google Scholar

[5]

Cheng TCE, Sin CCS (1990) A state-of-the-art review of parallel-machine scheduling research. Eur. J. Oper. Res. 47(3):271-292.

Crossref

Google Scholar

[6]

Coffman EG Jr, Garey MR, Johnson DS (1996) Approximation algorithms for bin packing: A survey. Hochbaum DS, ed. Approximation Algorithms for NP-Hard Problems (PWS Publishing Co., Boston), 46-93.

Crossref

Google Scholar

[7]

Elhedhli S, Li L, Gzara M, Naoum-Sawaya J (2011) A branch-andprice algorithm for the bin packing problem with conflicts. INFORMS J. Comput. 23(3):404-415.

Digital Library

Google Scholar

[8]

Limtanyakul K, Schwiegelshohn U (2012) Improvements of constraint programming and hybrid methods for scheduling of tests on vehicle prototypes. Constraints 17(2):172-203.

Digital Library

Google Scholar

[9]

Pinto JM, Grossmann IE (1995) A continuous time mixed integer linear programming model for short term scheduling of multistage batch plants. Indust. Engrg. Chemistry Res. 34(9): 3037-3051.

Crossref

Google Scholar

[10]

Potts CN, Strusevich VA (2009) Fifty years of scheduling: A survey of milestones. J. Oper. Res. Soc. 60(1):S41-S68.

Crossref

Google Scholar

[11]

Shi Y, Reich D, Epelman M, Klampfl E, Cohn A (2016) An analytical approach to prototype vehicle test scheduling. Omega, ePub ahead of print May 18,

Google Scholar

[12]

Zhu Z, Heady RB (2000) Minimizing the sum of earliness/tardiness in multi-machine scheduling: A mixed integer programming approach. Comput. Indust. Engrg. 38(2):297-305.

Digital Library

Google Scholar

Cited By

View all

Wang SLi JMehrotra S(2021)Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room PlanningINFORMS Journal on Computing10.1287/ijoc.2020.101033:4(1661-1677)Online publication date: 9-Mar-2021
https://dl.acm.org/doi/10.1287/ijoc.2020.1010
Weckenborg CKieckhäfer KSpengler TBernstein P(2020)The Volkswagen Pre-Production Center Applies Operations Research to Optimize Capacity SchedulingInterfaces10.1287/inte.2020.102950:2(119-136)Online publication date: 11-Mar-2020
https://dl.acm.org/doi/10.1287/inte.2020.1029

Scheduling Crash Tests at Ford Motor Company

Recommendations

Mixed binary integer programming formulations for the reentrant job shop scheduling problem

This paper describes the development of mixed binary integer programming (BIP) formulations for the reentrant job shop scheduling problem. Based on an earlier classical job shop model developed by Manne and improved by Liao and You, this paper presents ...
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

In this article, we consider a single-machine scheduling problem with one unavailability period, with the aim of minimizing the weighted sum of the completion times. We propose three exact methods for solving such a problem: a branch-and-bound method ...
A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem

We examine bilevel mixed-integer programs whose constraints and objective functions depend on both upper-and lower-level variables. The class of problems we consider allows for nonlinear terms to appear in both the constraints and the objective ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Interfaces Volume 46, Issue 5

October 2016

99 pages

ISSN:0092-2102

EISSN:1526-551X

Issue’s Table of Contents

Publisher

INFORMS

Linthicum, MD, United States

Publication History

Published: 01 October 2016

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang SLi JMehrotra S(2021)Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room PlanningINFORMS Journal on Computing10.1287/ijoc.2020.101033:4(1661-1677)Online publication date: 9-Mar-2021
https://dl.acm.org/doi/10.1287/ijoc.2020.1010
Weckenborg CKieckhäfer KSpengler TBernstein P(2020)The Volkswagen Pre-Production Center Applies Operations Research to Optimize Capacity SchedulingInterfaces10.1287/inte.2020.102950:2(119-136)Online publication date: 11-Mar-2020
https://dl.acm.org/doi/10.1287/inte.2020.1029

Abstract

References

Cited By

Recommendations

Mixed binary integer programming formulations for the reentrant job shop scheduling problem

Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations