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

A genetic algorithm based heuristic for scheduling of virtual manufacturing cells (VMCs)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 50 publications
(13 citation statements)
references
References 25 publications
0
13
0
Order By: Relevance
“…Gou et al developed a Lagrange relaxation based approach to solve the problem in job shop cells in CMS [25]. Kesen et al proposed a genetic algorithm based heuristic for scheduling of virtual manufacturing cells [26].…”
Section: Et Al Considered Permutation and Non-permutationmentioning
confidence: 99%
“…Gou et al developed a Lagrange relaxation based approach to solve the problem in job shop cells in CMS [25]. Kesen et al proposed a genetic algorithm based heuristic for scheduling of virtual manufacturing cells [26].…”
Section: Et Al Considered Permutation and Non-permutationmentioning
confidence: 99%
“…Kesen et al presented a multi-objective mixed integer programming formulation [16] and a genetic algorithm (GA) based heuristic approach [17] for job scheduling in virtual manufacturing cells to minimize the summation of weighted makespan and weighted total traveling distance. Banaszak et al [18] proposed a heuristic method for process planning and scheduling in virtual manufacturing, which is finding a feasible schedule that satisfies the constraints imposed by the work-order duration, the price, and the time-constrained resource availability.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Wemmerlov and Hyer [11] mentioned that even though the researchers widely focus on CF problem, the cell design would be incomplete if not related to the operational issues like scheduling of the system. Taking into account the above points, a few research works have included scheduling, however in different manner in the CF problems and are: Arkat et al [12] addressed the CF problem with the objectives of minimum transportation cost and minimum makespan; Mak et al [13] considered objectives of minimizing total material travel distance and minimizing the sum of tardiness of all the products in a virtual cellular manufacturing system; Kesen et al [14] proposed scheduling methodology and machine assignment with alternate machine routing for a virtual manufacturing environment with a temporary part grouping and considered a weightbased approach for the objectives of minimizing makespan and total travel distance; Jeon and Leep [15], Egilmez and Süer [16] discussed a two-phase procedure for part-family formation in phase I and scheduling aspects and machine cell formation in phase II. However, Arkat et al [12] and Mak et al [13] have not considered machine duplications, which, if included, can minimize inter-cell moves and minimize makespan under alternate machine routing flexibilities.…”
Section: Introductionmentioning
confidence: 99%
“…However, Arkat et al [12] and Mak et al [13] have not considered machine duplications, which, if included, can minimize inter-cell moves and minimize makespan under alternate machine routing flexibilities. The weight-based multi-objective approach of Kesen et al [14] is often related to the subjective preferences of the designer to the two criteria, makespan and inter-cell move. The two-phase procedure proposed by Jeon and Leep [15] and Egilmez and Süer [16] is a sequential approach and lacks a concurrent approach of CMS issues.…”
Section: Introductionmentioning
confidence: 99%