Operation sequencing using modified particle swarm optimization
Planning and scheduling (PS) problems in advanced manufacturing systems, such as flexible manufacturing systems, are composed of a set of interrelated problems, such as operation sequencing, machine selection. routing, and online scheduling. Operation sequencing deals with the problem of determining...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/10109/ http://eprints.utm.my/10109/1/ZalmiyahZakaria2007_OperationSequencingUsingModifiedParticle.pdf |
| Summary: | Planning and scheduling (PS) problems in advanced manufacturing systems, such as flexible manufacturing systems, are composed of a set of interrelated problems, such as operation sequencing, machine selection. routing, and online scheduling. Operation sequencing deals with the problem of determining in what order to perform a set of selected operations such that the resulting sequence satisfies the precedence constraints as well as alternative operation constraints established by both the parts and operations. In this paper, modified particle swarm optimization (MPSO) has been used to generate a feasible operation sequence for a real world manufacturing problem. In addition, the directed mutation is used to accelerate the individuals move toward the optimal solutions. The quality of the result and its numerical performance is discussed in comparison with a standard genetic algorithm (SGA). After to runs, the result from SGA show that the possibilities for the solution to fall in the near optimal solution is about 30% compared with the result from MPSO which always force the constraints to befully satis.fied. |
|---|