TY - GEN
T1 - Enhanced joint pricing and lot-sizing decisions in a serial supply-chain
AU - Duan, Lisha
AU - Venegas, Bárbara B.
AU - Ventura, Jose A.
AU - Kweon, Sang Jin
AU - Hwang, Seong Wook
N1 - Publisher Copyright:
© 2019 IISE Annual Conference and Expo 2019. All rights reserved.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2019
Y1 - 2019
N2 - In this research, we consider a serial supply chain with multiple stages in a centralized control scenario. Within this supply chain, the first stage faces a supplier selection decision for a particular product that experiences a price-sensitive demand. The demand is represented as a logit function, which parameters account for the range and price sensitivity factors. Suppliers are capacitated and offer their individual fixed unit price with a corresponding quality level for the product. The buying stage needs to decide which suppliers to choose and how to allocate orders, determining the optimal inventory policy for all stages and the retail price to offer to end customers, while maximizing the total profit of the supply chain. In this context, we formulate the problem as a mixed integer nonlinear programming model and propose a heuristic approach to overcome the complexity of the model. Computational experiments are carried out to examine the performance of the proposed heuristic.
AB - In this research, we consider a serial supply chain with multiple stages in a centralized control scenario. Within this supply chain, the first stage faces a supplier selection decision for a particular product that experiences a price-sensitive demand. The demand is represented as a logit function, which parameters account for the range and price sensitivity factors. Suppliers are capacitated and offer their individual fixed unit price with a corresponding quality level for the product. The buying stage needs to decide which suppliers to choose and how to allocate orders, determining the optimal inventory policy for all stages and the retail price to offer to end customers, while maximizing the total profit of the supply chain. In this context, we formulate the problem as a mixed integer nonlinear programming model and propose a heuristic approach to overcome the complexity of the model. Computational experiments are carried out to examine the performance of the proposed heuristic.
UR - http://www.scopus.com/inward/record.url?scp=85095444291&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85095444291&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85095444291
T3 - IISE Annual Conference and Expo 2019
BT - IISE Annual Conference and Expo 2019
PB - Institute of Industrial and Systems Engineers, IISE
T2 - 2019 Institute of Industrial and Systems Engineers Annual Conference and Expo, IISE 2019
Y2 - 18 May 2019 through 21 May 2019
ER -