1997
DOI: 10.1109/4235.687888
|View full text |Cite
|
Sign up to set email alerts
|

Using genetic algorithms in process planning for job shop machining

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
69
0

Year Published

2006
2006
2017
2017

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 146 publications
(82 citation statements)
references
References 17 publications
0
69
0
Order By: Relevance
“…In order to reduce the dissimilarity among the process plans selection they first generated alternative optimal process plan for each part type and later merged the plans. A genetic algorithm approach to solve the process planning problem for a job shop was attempted by Zhang et al (1997). Kolisch and Hess (2000) solved these types of problems using three approaches; a biased random sampling method and rest of the two approaches are Tabu-search based large-step optimization techniques.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In order to reduce the dissimilarity among the process plans selection they first generated alternative optimal process plan for each part type and later merged the plans. A genetic algorithm approach to solve the process planning problem for a job shop was attempted by Zhang et al (1997). Kolisch and Hess (2000) solved these types of problems using three approaches; a biased random sampling method and rest of the two approaches are Tabu-search based large-step optimization techniques.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Research studies on process planning include object-oriented approaches [105], [132], GA-based approaches [70], [131], neural-network-based approaches [21], [69], Petri net-based approaches [53], feature recognition or feature-driven approaches [114], [119], and knowledge-based approaches [108], [118]. These approaches and their combinations have been applied to some specific problem domains, such as tool selection [24], [56], tool path planning [7], [45], machining parameters selection [3], [37], process sequencing [129], and setup planning [75], [125].…”
Section: A Traditional Approachesmentioning
confidence: 99%
“…[13] produced an integrated process planning and scheduling model for a manufacturing unit by applying Simulated Annealing (SA) based random search optimization technique. [14] attempted the genetic algorithm approach to solve the process planning problem in a job shop. [15] utilized the advantages of Ant Colony Optimization (ACO) approach to resolve the issues related to job shop scheduling problem.…”
Section: Literature Reviewmentioning
confidence: 99%