In this paper, a novel mixed-integer programming model is developed to optimally assign the die sets to candidate plants to minimize the total costs. The total costs include freight shipping stamped parts to assembly plants, die set movement, outsourcing, and utilization. Therefore, the objective function is weighted multi-criteria and it takes into consideration some of the key constraints in the real-world condition including “must-move die sets”. An optimization tool has been developed that takes several inputs and feeds them as the input to the mathematical model and generates the optimal assignments with the directional costs as the output. The tool has been tested for several plants at Ford and has proved its robustness by saving millions of dollars. The developed tool can easily be applied to other manufacturing systems and original equipment manufacturers (OEMs).


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Optimization Model for Die Sets Allocation to Minimize Supply Chain Cost


    Additional title:

    Sae Technical Papers


    Contributors:

    Conference:

    Automotive Technical Papers ; 2022



    Publication date :

    2022-07-08




    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    An online cost allocation model for horizontal supply chains

    Zou, Han / Dessouky, Maged M. / Hu, Shichun | Elsevier | 2020


    A Hybrid Machine Learning and Optimization Model to Minimize the Total Cost of BRT Brake Components

    Saeed Najafi-Zangeneh / Naser Shams Gharneh / Ali Arjomandi-Nezhad et al. | DOAJ | 2021

    Free access



    Supply Chain Management Optimization

    Coppedge, M. / Air Traffic Control Association | British Library Conference Proceedings | 2004