Please use this identifier to cite or link to this item:
Gunay, Elif Elcin
Kula, Ufuk
Year of Publication: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 14 [Year:] 2018 [Issue:] 4 [Pages:] 655-663
This study considers instant decision-making needs of the automobile manufactures for resequencing vehicles before final assembly (FA). We propose a rule-based two-stage stochastic model to determine the number of spare vehicles that should be kept in the pre-assembly buffer to restore the altered sequence due to paint defects and upstream department constraints. First stage of the model decides the spare vehicle quantities, where the second stage model recovers the scrambled sequence respect to pre-defined rules. The problem is solved by sample average approximation (SAA) algorithm. We conduct a numerical study to compare the solutions of heuristic model with optimal ones and provide following insights: (i) as the mismatch between paint entrance and scheduled sequence decreases, the rule-based heuristic model recovers the scrambled sequence as good as the optimal resequencing model, (ii) the rule-based model is more sensitive to the mismatch between the paint entrance and scheduled sequences for recovering the scrambled sequence, (iii) as the defect rate increases, the difference in recovery effectiveness between rule-based heuristic and optimal solutions increases, (iv) as buffer capacity increases, the recovery effectiveness of the optimization model outperforms heuristic model, (v) as expected the rule-based model holds more inventory than the optimization model.
Mixed-model assembly lines
Car resequencing
Stochastic programming
Persistent Identifier of the first edition: 
Creative Commons License:
Document Type: 
Social Media Mentions:

Files in This Item:

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.