2012
DOI: 10.1016/j.engappai.2011.12.004
|View full text |Cite
|
Sign up to set email alerts
|

Study of stochastic sequence-dependent flexible flow shop via developing a dispatching rule and a hybrid GA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0
6

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 39 publications
(17 citation statements)
references
References 32 publications
0
11
0
6
Order By: Relevance
“…The outcome of this study reveals that the proposed approach leads to better scheduling of machinery and equipment comparing to other optimisation approaches. Kianfar et al (2012) studied a production system in which the operation time is dynamic and the sequence of operations is dependent on the start time of operations. This study is aimed to schedule operations so that the minimum delay in operations is achieved.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The outcome of this study reveals that the proposed approach leads to better scheduling of machinery and equipment comparing to other optimisation approaches. Kianfar et al (2012) studied a production system in which the operation time is dynamic and the sequence of operations is dependent on the start time of operations. This study is aimed to schedule operations so that the minimum delay in operations is achieved.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Kianfar, Fatemi Ghomi, and Karimi (2009) introduced four dispatching rules for the minimization of the sum of tardiness and rejection costs. Kianfar, Fatemi Ghomi, and Oroojlooy Jadid (2012) also presented a new dispatching rule for the FFS system in a dynamic non-deterministic environment.…”
Section: Introductionmentioning
confidence: 98%
“…When the main objective is to improve the system's balance, typical problem formulations include: maximization of line utilization, minimization of number of stations given the cycle time, minimization of the cycle time given the number of stations, a compromise between the number of stations and cycle time [2,3]. When the optimization objective is more focused on performance then makespan [4][5][6][7][8][9][10][11][12][13], minimization of tardiness [11,14,15], throughput [16,17], energy efficiency [18], work in progress [12], activity based costing [19], etc., are commonly used to characterize the performance of the scheduling algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…The conventional approaches are based in enumerative or heuristic algorithms and are normally able to produce near optimal solutions. Known techniques and algorithms include: genetic algorithms [6,14], ant colony optimization [8,10], particle swarm optimization [9,13,15], fuzzy control [12,13] and neural networks [7].…”
Section: Introductionmentioning
confidence: 99%