2007
DOI: 10.1007/s00170-007-1069-x
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of flexible process planning by genetic programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 42 publications
(18 citation statements)
references
References 18 publications
0
17
0
Order By: Relevance
“…New representations and genetic operators were proposed to cope with specific scheduling problems [38]. Experiments to compare different GP methods were also conducted [59,73]. Since 2010, there have been a dramatic growth in the number of studies on this topic.…”
Section: Genetic Programming For Production Schedulingmentioning
confidence: 99%
See 2 more Smart Citations
“…New representations and genetic operators were proposed to cope with specific scheduling problems [38]. Experiments to compare different GP methods were also conducted [59,73]. Since 2010, there have been a dramatic growth in the number of studies on this topic.…”
Section: Genetic Programming For Production Schedulingmentioning
confidence: 99%
“…For example, Tay and Ho [135] applied GP to evolve dispatching [73] rules for flexible job shop scheduling and use the least waiting time assignment [49] to find a suitable machine to process an operation. Similarly, Pickardt et al [117] evolved dispatching rules for semiconductor manufacturing and used two existing heuristics, i.e.…”
Section: Component(s) To Be Evolvedmentioning
confidence: 99%
See 1 more Smart Citation
“…The IPPS problem will be subjected to the following assumptions [13]  All parts are independent of each other and each machine can handle only one part at a time.  Multiple operations of the same part cannot be performed simultaneously, even on the same machine.…”
Section: A Problem Statementmentioning
confidence: 99%
“…[4][5][6][7] Process planning could be treated as traveling salesman problem (TSP). It is also a NP-hard problem [8][9][10] . In recent years, heuristic algorithms have shown their advantages in solving this kind of combinatorial optimization problems, and many approaches had been proposed for the optimization of process planning.…”
Section: Introductionmentioning
confidence: 99%