ICTACT Journal on Soft Computing

M. K. Marichelvam ¹, M. Geetha ²

Affiliations
1 Department of Mechanical Engineering, Kamaraj College of Engineering and Technology, IN
2 Department of Mathematics, Kamaraj College of Engineering and Technology, IN

Abstract

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.

Full Text

     

M. K. Marichelvam ¹, T. Prabaharan ²

Affiliations
1 Department of Mechanical Engineering, Kamaraj College of Engineering and Technology, IN
2 Department of Mechanical Engineering, Mepco Schlenk Engineering College, IN

Abstract

This paper addresses the multistage hybrid flow shop (HFS) scheduling problems. The HFS is the special case of flowshop problem. Multiple parallel machines are considered in each stage in the HFS. The HFS scheduling problem is known to be strongly NPhard. Hence, many researchers proposed metaheuristic algorithms for solving the HFS scheduling problems. This paper develops a bat algorithm (BA) to the HFS scheduling problem to minimize makespan and mean flow time. To verify the developed algorithm, computational experiments are conducted and the results are compared with other metaheuristic algorithms from the literature. The computational results show that the proposed BA is an efficient approach in solving the HFS scheduling problems.

Keywords

Scheduling, Hybrid Flowshop, NP-Hard, Bat Algorithm, Makespan, Mean Flow Time.

Full Text