Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation 2006
DOI: 10.1145/1143997.1144293
|View full text |Cite
|
Sign up to set email alerts
|

Effective genetic approach for optimizing advanced planning and scheduling in flexible manufacturing system

Abstract: In this paper, a novel approach for designing chromosome has been proposed to improve the effectiveness, which called multistage operation-based genetic algorithm (moGA). The objective is to find the optimal resource selection for assignments, operations sequences, and allocation of variable transfer batches, in order to minimize the total makespan, considering the setup time, transportation time, and operations processing time. The plans and schedules are designed considering flexible flows, resources status,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0
1

Year Published

2009
2009
2016
2016

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(15 citation statements)
references
References 15 publications
0
14
0
1
Order By: Relevance
“…As a result, a single optimization problem should be solved. Often this problem is addressed as main (or general) advanced planning and scheduling problem (APSP) (Moon et al, 2004;Moon and Seo, 2005;Zhang and Gen, 2006;Chen and Ji, 2007;Lee et al, 2002).…”
Section: The Concept Of Apsmentioning
confidence: 99%
See 1 more Smart Citation
“…As a result, a single optimization problem should be solved. Often this problem is addressed as main (or general) advanced planning and scheduling problem (APSP) (Moon et al, 2004;Moon and Seo, 2005;Zhang and Gen, 2006;Chen and Ji, 2007;Lee et al, 2002).…”
Section: The Concept Of Apsmentioning
confidence: 99%
“…In multi-plant manufacturing system, it is necessary to consider also the outsourcing (Lee et al, 2002), i.e. situations when "the same order can also be delivered to some other plant for assigning to the resources in different locations" (Zhang and Gen, 2006). In other words, we have some sequential and parallel machining processes structure that can be represented by an AND/OR directed graph (Homem de Mello and Sanderson, 1990).…”
Section: An Ensemble Of Collaborating Algorithmsmentioning
confidence: 99%
“…Bionic evolution will repeat the above step 3 to step 6 for certain times until the final individual string or string group satisfy the requirement function. And bionic evolution will get the optimized objects with best degree of approximation [7][8][9][10][11][12][13][14].…”
Section: Bionic Optimization and Its Application In E-mentioning
confidence: 99%
“…k * ∈ l Z is the private key of message receiver, K kP = is the corresponding public key. ψ is a function that makes the conversion from ( ) q E F to finite field l Z * [14][15][16][17][18][19].…”
Section: B Basic Algorithms On Elliptic Curves Public Key Cryptosystemmentioning
confidence: 99%