This paper proposes a nonlinear programming model for a scheduling problem in the supply chain. Due to the nonlinear structure of the developed model and its NP-hard structure, a lower bound is developed. Four lemmas and a theorem are presented and proved to determine the lower bound. The proposed problem is inspired from a three stage supply chain commonly used in various industries.
Beheshtinia, M., Ghasemi, A. (2021). Proposing a lower bound for a nonlinear scheduling problem in supply chain. International Journal of Nonlinear Analysis and Applications, 12(1), 1073-1085. doi: 10.22075/ijnaa.2017.1616.1422
MLA
Mohammad Ali Beheshtinia; Amir Ghasemi. "Proposing a lower bound for a nonlinear scheduling problem in supply chain". International Journal of Nonlinear Analysis and Applications, 12, 1, 2021, 1073-1085. doi: 10.22075/ijnaa.2017.1616.1422
HARVARD
Beheshtinia, M., Ghasemi, A. (2021). 'Proposing a lower bound for a nonlinear scheduling problem in supply chain', International Journal of Nonlinear Analysis and Applications, 12(1), pp. 1073-1085. doi: 10.22075/ijnaa.2017.1616.1422
VANCOUVER
Beheshtinia, M., Ghasemi, A. Proposing a lower bound for a nonlinear scheduling problem in supply chain. International Journal of Nonlinear Analysis and Applications, 2021; 12(1): 1073-1085. doi: 10.22075/ijnaa.2017.1616.1422
)