Proposing a lower bound for a nonlinear scheduling problem in supply chain

Document Type : Research Paper


1 Semnan university

2 semnan university


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.