Refine your search
Collections
Co-Authors
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Marichelvam, M. K.
- Solving Flowshop Scheduling Problems Using a Discrete African Wild Dog Algorithm
Abstract Views :171 |
PDF Views:0
Authors
Affiliations
1 Department of Mechanical Engineering, Kamaraj College of Engineering and Technology, IN
2 Department of Mathematics, Kamaraj College of Engineering and Technology, IN
1 Department of Mechanical Engineering, Kamaraj College of Engineering and Technology, IN
2 Department of Mathematics, Kamaraj College of Engineering and Technology, IN
Source
ICTACT Journal on Soft Computing, Vol 3, No 3 (2013), Pagination: 555-558Abstract
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 were addressed by the researchers. In this paper, a discrete African wild dog algorithm is applied for solving the flowshop scheduling problems. Computational results using benchmark problems show that the proposed algorithm outperforms many other algorithms addressed in the literature.Keywords
Scheduling, Flowshop, NP-Hard, Discrete African Wild Dog Algorithm, Makespan.- A Bat Algorithm for Realistic Hybrid Flowshop Scheduling Problems to Minimize Makespan and Mean Flow Time
Abstract Views :376 |
PDF Views:0
Authors
Affiliations
1 Department of Mechanical Engineering, Kamaraj College of Engineering and Technology, IN
2 Department of Mechanical Engineering, Mepco Schlenk Engineering College, IN
1 Department of Mechanical Engineering, Kamaraj College of Engineering and Technology, IN
2 Department of Mechanical Engineering, Mepco Schlenk Engineering College, IN