Loading…
An immune algorithm approach to the scheduling of a flexible PCB flow shop
Scheduling is an important task in manufacturing. It involves assigning jobs to machines in a particular order so as to meet the manufacturing target. With the increase in manufacturing complexity, conventional scheduling techniques for generating a reasonable manufacturing schedule have become inef...
Saved in:
Published in: | International journal of advanced manufacturing technology 2003-12, Vol.22 (11-12), p.819-827 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Scheduling is an important task in manufacturing. It involves assigning jobs to machines in a particular order so as to meet the manufacturing target. With the increase in manufacturing complexity, conventional scheduling techniques for generating a reasonable manufacturing schedule have become ineffective. An immune algorithm (IA), which is a new evolutionary algorithm, can be used to tackle complex scheduling problems and produce a reasonable manufacturing schedule within an acceptable time. This paper describes an IA approach to the scheduling of a flexible flow shop for PCB manufacturing. An overview of the flexible flow shop problem and the basic notions of an IA are first presented. Subsequently, the details of an IA approach are described and implemented. A case study of a flexible flow shop for the manufacture of PCBs for communication equipment was then conducted. The results obtained are compared with those computed by genetic algorithms (GAs), which are well-known evolutionary algorithms. From the case study, it was established that IAs outperformed GAs. The details of the case study as well as the comparative study are described. |
---|---|
ISSN: | 0268-3768 1433-3015 |
DOI: | 10.1007/s00170-002-1498-5 |