AIS-SFHM APPROACH FOR OPTIMIZATION OF MULTI OBJECTIVE JOB SHOP PROBLEMS

Authors

  • Chandrasekaran Manoharan

DOI:

https://doi.org/10.24297/jac.v13i7.5633

Abstract

The n-job, m-machine Job shop scheduling (JSP) problem is one of the general production scheduling problems. The JSP problem is a scheduling problem, where a set of ‘n’ jobs must be processed or assembled on a set of ‘m’ dedicated machines. Each job consists of a specific set of operations, which have to be processed according to a given technical precedence order. Job shop scheduling problem is a NP-hard combinatorial optimization problem.  In this paper, optimization of three practical performance measures mean job flow time, mean job tardiness and makespan are considered. The hybrid approach of Sheep Flocks Heredity Model Algorithm (SFHM) is used for finding optimal makespan, mean flow time, mean tardiness. The hybrid SFHM approach is tested with multi objective job shop scheduling problems. Initial sequences are generated with Artificial Immune System (AIS) algorithm and results are refined using SFHM algorithm. The results show that the hybrid SFHM algorithm is an efficient and effective algorithm that gives better results than SFHM Algorithm, Genetic Algorithm (GA). The proposed hybrid SFHM algorithm is a good problem-solving technique for job shop scheduling problem with multi criteria.

Downloads

Download data is not yet available.

Downloads

Published

2017-02-13

How to Cite

Manoharan, C. (2017). AIS-SFHM APPROACH FOR OPTIMIZATION OF MULTI OBJECTIVE JOB SHOP PROBLEMS. JOURNAL OF ADVANCES IN CHEMISTRY, 13(7), 6363–6368. https://doi.org/10.24297/jac.v13i7.5633

Issue

Section

Articles