.png){kind=icon}
.png){kind=icon}
Return
A stochastic programming model for resequencing buffer content optimisation in mixed-model assembly lines
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2016.1227101.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In mixed-model assembly lines, smooth operation of the assembly line depends on adherence to the scheduled sequence. However, during production process, this sequence is altered both intentionally and uninstentionally. A major source of unintentional sequence alteration in automobile plants is the paint defects. A post-paint resequencing buffer, located before the final assembly is used to restore the altered sequence. Restoring the altered sequence back to the scheduled sequence requires three distinct operations in this buffer: Changing the positions (i.e. resequencing) of vehicles, inserting spare vehicles in between difficult models and replacing spare vehicles with paint defective vehicles. We develop a two-stage stochastic model to determine the optimal number of spare vehicles from each model-colour type to be placed into the Automated Storage and Retrieval System resequencing buffer that maximises the scheduled sequence achievement ratio (SSAR). The model contributes to the literature by explicitly considering above three distinct operations and random nature of paint defect occurrences. We use sample average approximation algorithm to solve the model. We provide managerial insights on how paint entrance sequence, defect rate and buffer size affect the SSAR. A value of stochastic solution shows that the model significantly outperforms its deterministic counterpart.
Keywords:
mixed-model sequencing
car resequencing
sample average approximation
stochastic programming
value of stochastic solution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W