SOLVING FLOWSHOP SCHEDULING PROBLEMS USING A DISCRETE AFRICAN WILD DOG ALGORITHM
The problem of m-machine permutation flowshop scheduling is considered in this paper. The objective is to minimize the makespan. The flowshop scheduling problem is a typical combinatorial optimization problem and has been proved to be strongly NP-hard. Hence, several heuristics and meta-heuristics w...
| Autores principales: | , |
|---|---|
| Formato: | Artículo |
| Lenguaje: | English |
| Publicado: |
ICT Academy of Tamil Nadu
2013-04-01
|
| Colección: | ICTACT Journal on Soft Computing |
| Materias: | |
| Acceso en línea: | http://ictactjournals.in/paper/IJSC_Vol3_Iss3_P7_555_558.pdf |