2010
DOI: 10.1016/j.cie.2010.07.014
|View full text |Cite
|
Sign up to set email alerts
|

An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
90
0
3

Year Published

2011
2011
2021
2021

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 215 publications
(93 citation statements)
references
References 23 publications
0
90
0
3
Order By: Relevance
“…The solution of the problem is represented with two vectors [19]: the machine assignment vector and the operation scheduling vector. The first part places the assigned machine number for each operation at the corresponding position, while the second part puts the same number symbol for each operation of a job and interpret them according to the occurrence in the operation scheduling vector.…”
Section: Solution Representationmentioning
confidence: 99%
“…The solution of the problem is represented with two vectors [19]: the machine assignment vector and the operation scheduling vector. The first part places the assigned machine number for each operation at the corresponding position, while the second part puts the same number symbol for each operation of a job and interpret them according to the occurrence in the operation scheduling vector.…”
Section: Solution Representationmentioning
confidence: 99%
“…Rahmati et al [67] developed non-dominated sorting of EA and non dominated ranking EA for multi-objective PFOSP and he proposed new multi-objective Pareto-based modules and a new measure for the multi-objective evaluation. [42] 2002 FOSP EA + AL Baykasoglu et al [7] 2004 FOSP TS + PDR Xia and Wu [79] 2005 FOSP PSO + SA Gao et al [26] 2006 FOSP EA Gao et al [27] 2007 FOSP EA + BSP Zribi et al [89] 2007 FOSP EA + BBA + LS Gao et al [28] 2008 FOSP EA + VNS Tay and Ho [75] 2008 FOSP EA + PDR Wang et al [76] 2008 FOSP FBS + PDR Zhang et al [87] 2009 FOSP PSO + TS Li et al [50] 2010 FOSP EA + VNS Frutos et al [25] 2010 FOSP EA + SA Wang et al [77] 2010 FOSP EA + AIS Gao et al [30] 2010 FOSP EA + AIS Grobler et al [35] 2010 FOSP PSO + PDR Li et al [48] 2010 FOSP TS + VNS Moradi et al [58] 2011 FOSP EA + PDR Moslehi and Mahnam [59] 2011 FOSP PSO + LS Li et al [49] 2011 FOSP PSO Li et al [47] 2011 FOSP PSO Rajkumar et al [68] 2011 FOSP GRASP Chiang and Lin [17] 2013 FOSP EA Rahmati et al [67] 2013 FOSP Gas Shao et al [72] 2013 FOSP PSO + SA Gao et al [29] 2014 FOSP HSA + LS Jia and Hu [41] 2014 FOSP TS Karthikeyan et al [45] 2014 FOSP DFA + LS Li et al [51] 2014 FOSP PSO + TS Rohaninejad et al [69] 2015 FOSP EA Yuan and Xu [84] 2015 FOSP EA + LS Rohaninejad et al [69] proposed a nonlinear IP model and also the hybridized EA with meta-heuristic, which is a multi-attribute decision making method, for multi-objective PFOSP with machines capacity constraints. The computational results are obtained by well-known multi objective algorithms from the literature showed that the proposed algorithm to obtain throughout better performance, especially in the closeness of the solutions result to the Pareto optimal front.…”
Section: Literature Reviewmentioning
confidence: 99%
“…It is inferred that the exact algorithms can be used on both of the modules to obtain an optimal solution. Li et al [48] was a hybrid algorithm with the two modules to handle the multi-objective PFOSP. In the machine assignment module, a tabu search algorithm was used to generate neighboring solutions while a variable neighborhood search algorithm is applied to the local search in the operation scheduling module.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In order to solve the flexible job shop scheduling problem, many algorithms have been proposed, such as tabu search algorithm [8], genetic algorithm [9], ant colony algorithm [10], particle swarm optimization algorithm [11] and so on. Genetic algorithm shows great applicability in solving similar problems, so this paper uses the genetic algorithm to solve the problem [12][13][14].…”
Section: Genetic Algorithmmentioning
confidence: 99%