Volume 30, Issue 2 (IJIEPR 2019)                   IJIEPR 2019, 30(2): 173-186 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Ebrahimi M, Tavakkoli-Moghaddam R, Jolai F. Benders Decomposition Algorithm for A Build-to-Order Supply Chain Problem Under Uncertainty. IJIEPR 2019; 30 (2) :173-186
URL: http://ijiepr.iust.ac.ir/article-1-791-en.html
1- University of Tehran
2- University of Tehran , tavakoli@ut.ac.ir
Abstract:   (3364 Views)
Customization is increasing so build-to-order systems are given more attention to researchers and practitioners. This paper presents a new build-to-order supply chain model with multiple objectives that minimize the total cost and lead time, and maximize the quality level.  The model is first formulated in a deterministic condition, and then investigated the uncertainty of the cost and quality by the stochastic programming based on the scenario. The return policy and outsourcing are the new issues in a build-to-order supply chain by considering the cost and inventory. A Benders decomposition algorithm is used to solve and validate the model. Finally, the related results are analyzed and compared with the results obtained by CPLEX for deterministic and stochastic models.
Full-Text [PDF 849 kb]   (1535 Downloads)    
Type of Study: Research | Subject: Material Managment
Received: 2017/10/12 | Accepted: 2019/05/8 | Published: 2019/06/22

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.