2018
DOI: 10.1016/j.asoc.2018.02.002
|View full text |Cite
|
Sign up to set email alerts
|

A multi-agent approach to the integrated production scheduling and distribution problem in multi-factory supply chain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
23
0
1

Year Published

2019
2019
2022
2022

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 68 publications
(24 citation statements)
references
References 31 publications
0
23
0
1
Order By: Relevance
“…Nemati & Alavidoost developed three bi-objective f-MILP models for sales and operational planning to minimize the total SC cost and maximize the customer service level [6]. Jolai & Gharaei proposed a multi-agent scheduling problem with distribution decisions in a multi-factory supply chain by using a multi-objective integer programming model based on decomposition with Bees algorithm (MOEA/D-BA) to achieve the Pareto solution, in order to minimize the tardiness of jobs while minimizing the total cost [7]. Leung et al employed an integrated production and delivery model with single and multiple vehicles by using a multi-objective mathematical model of PD-NSGA-II algorithm to improve the performance of scheduling and evaluating in pull supply chain [8].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Nemati & Alavidoost developed three bi-objective f-MILP models for sales and operational planning to minimize the total SC cost and maximize the customer service level [6]. Jolai & Gharaei proposed a multi-agent scheduling problem with distribution decisions in a multi-factory supply chain by using a multi-objective integer programming model based on decomposition with Bees algorithm (MOEA/D-BA) to achieve the Pareto solution, in order to minimize the tardiness of jobs while minimizing the total cost [7]. Leung et al employed an integrated production and delivery model with single and multiple vehicles by using a multi-objective mathematical model of PD-NSGA-II algorithm to improve the performance of scheduling and evaluating in pull supply chain [8].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Several optimization techniques are used in ISCS problems. Mathematical programming, especially Integer / Mixed Integer Programming has become one of the most commonly applied approach in ISCS problems due to its sensitivity, flexibility and widespread modeling capability (Devapriya, 2008;Ullrich, 2013;Viergutz and Knust, 2014;Pei et al, 2014;Kang et al, 2016;Karaoğlan and Erhan, 2017;Gharaei and Jolai, 2018). The two most important enumerative methods: (i) Dynamic Programming (DP), (ii) Branch and Bound (abbreviated further on as B&B), Branch and Cut (B&C) are commonly used to solve especially small sized ISCS problems.…”
Section: Modeling Methods and Solution Approachesmentioning
confidence: 99%
“…[10] This paper first of all proposes an effective and green hybrid differential evolution set of rules (HDE) based at the differential evolution algorithm (DE) and genetic algorithm (GA) that may clear up this NP-difficult hassle in a strong and unique way. [11] After determining the suitable parameters of the HDE by way of parameters tuning take a look at, the effectiveness and efficiency of the HDE are proven by way of benchmark features and numerical examples. They compare the HDE with the available highquality technique and find that the HDE can constantly acquire the marginally decrease general prices underneath a few situations.…”
Section: Literature Reviewmentioning
confidence: 99%