RT - Journal Article
T1 - To minimize the total cost of the allocation of delivery, costs related to post, resource allocation and the maximum delay in the supply chain flow shop scheduling problem
JF - khu-jde
YR - 2018
JO - khu-jde
VO - 2
IS - 6
UR - http://jde.khu.ac.ir/article-1-64-en.html
SP - 7
EP - 31
K1 - Supply chain scheduling
K1 - Multi-objective decision making
K1 - Flow shop scheduling
K1 - Epsilon limitation
K1 - NSGAII
AB - In this study an integrated production/distribution problem in flow shop scheduling with tardiness costs، inventory costs and distribution and resource allocation costs is modeled. Imagine a supply chain in which several jobs are to be processed on several machines. Each job has a contracted due date. This paper aims at proposing an efficient model for minimizing total production and distribution costs which include tardiness costs، inventory costs and distribution and resource allocation costs. The mixed integer non-linear programming of the problem is then presented. Considering that these problems fall into the group of NP-hard we utilize a NSGAII algorithm to solve the proposed problem. This problem has been solved with small dimensions and restrictions on the Pareto frontier obtained Epsilon limitation and large-scale NSGAII meta-heuristic algorithm as well as small-scale solved the problem solving methods (Epsilon restrictions and NSGAII) are compared with each other.
LA eng
UL http://jde.khu.ac.ir/article-1-64-en.html
M3 10.52547/jde.2.6.7
ER -