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

نویسندگان

1 Department of Industrial Engineering, Faculty of Materials and Industrial Engineering, Semnan University, Semnan 35195-363, Iran

2 Department of Industrial Engineering, Faculty of Materials and Industrial Engineering, Semnan University, Semnan 35195-363, Iran

doi
10.22075/ijnaa.2017.1616.1422
چکیده

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.