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

	Proposing a lower bound for a nonlinear scheduling problem in supply chain
International Journal of Nonlinear Analysis and Applications
مقاله 85، دوره 12، شماره 1، مرداد 2021، صفحه 1073-1085 اصل مقاله (349.46 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22075/ijnaa.2017.1616.1422
نویسندگان
Mohammad Ali Beheshtinia^* ؛ Amir Ghasemi
Department of Industrial Engineering, Faculty of Materials and Industrial Engineering, Semnan University, Semnan 35195-363, Iran
چکیده
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.
کلیدواژه‌ها
scheduling؛ supply chain؛ lower bound؛ nonlinear programming
مراجع

آمار تعداد مشاهده مقاله: 16,229 تعداد دریافت فایل اصل مقاله: 9,539

پیوندهای مفید

آمار