2011
DOI: 10.1016/j.eswa.2010.07.138
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0
1

Year Published

2014
2014
2018
2018

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 37 publications
(22 citation statements)
references
References 40 publications
0
21
0
1
Order By: Relevance
“…One of the most important theories or assumptions in manufacturing programme of this study is considering the machines in a continuous and defect-less mode. Safari and Sajadi (2011) have proposed the present workshop conditions under those maintenances based on the conditions to minimise, as far as possible. They suggested a combinatory algorithm based on the genetic algorithm and simulated annealing.…”
Section: Literature Reviewmentioning
confidence: 99%
“…One of the most important theories or assumptions in manufacturing programme of this study is considering the machines in a continuous and defect-less mode. Safari and Sajadi (2011) have proposed the present workshop conditions under those maintenances based on the conditions to minimise, as far as possible. They suggested a combinatory algorithm based on the genetic algorithm and simulated annealing.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Based on a clonal selection principle and an affinity maturation mechanism of the immune response, they proposed an immune algorithm (IA) and applied the Taguchi parameter design method to analyze the proposed algorithm. Safari and Sadjadi [13] explored flowshop configuration under the assumption of condition-based maintenance to minimize expected makespan and proposed a conditionbased maintenance (CBM) strategy and a hybrid algorithm based on genetic algorithm and simulated annealing. Their simulation results showed its superiority.…”
Section: Introductionmentioning
confidence: 99%
“…Some studies used tailor-made genetic operators to enhance the ability of Genetic Algorithms (as discussed by Amin-Naseri and Afshari [247], Qing-Dao-Er-Ji and Wang [248,249], Qing-Dao-Er-Ji et al [250,251], and Ahmadizar and Farahani [52]); Ahmad et al [252] applied a problemspecific heuristic to improve the quality of initial solution; some other studies hybridized the Genetic Algorithm and some problem-specific local search schemes (as discussed by Do Ngoc et al [253], Tseng and Lin [254], and Vidal et al [135]) or neighborhood search procedures [255][256][257]. The majority of the hybrid methods are the combinations of different metaheuristics, such as the combination of Genetic Algorithm and Tabu Search procedures (as discussed by Zhang et al [258], Meeran and Morshed [259], Li and Gao [260], Yu et al [261], and Noori and Ghannadpour (2012)) and the integration of Genetic Algorithm and Simulated Annealing (as discussed by Safari and Sadjadi [262], Rafiei et al [263], and Bettemir and Sonmez [264]). In recent years, the combination of Genetic Algorithm and Particle Swarm Optimization (PSO) had been widely applied in both scheduling and vehicle routing problems (as discussed by Du et al [265], Yu et al [266], Liu et al [267], and Kumar and Vidyarthi [268]).…”
Section: Hybrid Metaheuristicsmentioning
confidence: 99%