2005
DOI: 10.1016/j.rcim.2004.12.002
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic scheduling in flexible assembly system based on timed Petri nets model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
21
0

Year Published

2006
2006
2022
2022

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 67 publications
(21 citation statements)
references
References 12 publications
0
21
0
Order By: Relevance
“…There have been a significant number of research works about optimisation of the assembly scheduling for traditional production systems. This class of optimisation problems has been solved by various approaches, such as heuristic (Andrés et al 2008;Kim et al 1996;Al-Anzi and Allahverdi 2007;Allahverdi and Al-Anzi 2009;Sung and Kim 2008;Koulamas and Kyparisis 2001), particle swarm optimisation (Dong et al 2012;Wang and Liu 2010;Hamta et al 2013;Allahverdi and Al-Anzi 2006), mixed integer programming (Ozturk et al 2010;Lin and Liao 2012;Terekhov et al 2012;Sawik 2004), genetic algorithm (Wong et al 2009;Marian et al 2003Marian et al , 2006Yolmeh and Kianfar 2012;Celano et al 1999;Dini et al 1999), Taguchi method (Chen et al 2010), dynamic programming (Jiang et al 1997;Zhang et al 2005;Yee and Ventura 1999), neural networks (Chen et al 2008;Hong and Cho 1995), multi-agent evolutionary algorithm (Zeng et al 2011), simulated annealing (Milner et al 1994), etc. In general, all of the works done so far deal with two main optimisation issues: assembly sequence and assembly resource location.…”
Section: Literature Reviewmentioning
confidence: 99%
“…There have been a significant number of research works about optimisation of the assembly scheduling for traditional production systems. This class of optimisation problems has been solved by various approaches, such as heuristic (Andrés et al 2008;Kim et al 1996;Al-Anzi and Allahverdi 2007;Allahverdi and Al-Anzi 2009;Sung and Kim 2008;Koulamas and Kyparisis 2001), particle swarm optimisation (Dong et al 2012;Wang and Liu 2010;Hamta et al 2013;Allahverdi and Al-Anzi 2006), mixed integer programming (Ozturk et al 2010;Lin and Liao 2012;Terekhov et al 2012;Sawik 2004), genetic algorithm (Wong et al 2009;Marian et al 2003Marian et al , 2006Yolmeh and Kianfar 2012;Celano et al 1999;Dini et al 1999), Taguchi method (Chen et al 2010), dynamic programming (Jiang et al 1997;Zhang et al 2005;Yee and Ventura 1999), neural networks (Chen et al 2008;Hong and Cho 1995), multi-agent evolutionary algorithm (Zeng et al 2011), simulated annealing (Milner et al 1994), etc. In general, all of the works done so far deal with two main optimisation issues: assembly sequence and assembly resource location.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The allocation of resources over time is also a combinatorial problem itself (Zhang, Freiheit, and Yang 2005). It was noted in Zhang, Freiheit, and Yang (2005) that Petri Nets based scheduling is not always satisfactory because it sometimes results in a combinatorial explosion according to the problem size.…”
Section: Purpose / Domainmentioning
confidence: 99%
“…Research in automated assembly sequencing has rapidly increased over the past few decades [1][2][3][4][15][16][17][18][19][20][21]. The problem of finding a valid assembly sequence for general cases that allow complex combination of motions was shown to be impractical, primarily owing to the issue of combinatorial explosion [22,23,57,58].…”
Section: Literature Reviewmentioning
confidence: 99%