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

Mohamad Ali Beheshtinia, Amir Ghasemi

Research output: Contribution to journalArticleAcademicpeer-review

1 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)1073-1085
JournalInternational Journal of Nonlinear Analysis and Applications
Volume12
Issue number1
DOIs
Publication statusPublished - Feb 2021
Externally publishedYes

Fingerprint

Dive into the research topics of 'Proposing a lower bound for a nonlinear scheduling problem in supply chain'. Together they form a unique fingerprint.

Cite this