Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling

46Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Abstract: Hybrid sorting immune simulated annealing technique (HSISAT), a Meta - heuristic is proposed for solving the multi objective flexible job-shop scheduling problem (FJSP). The major objectives are distributing the time of machines among the set of operations and scheduling them to minimize the criterion (makespan, total workload and maximum workload). The processing time is sorted for isolating the critical machines and immune simulated annealing (ISA) is applied to increase the convergence speed. Several case studies have been taken from the literature to demonstrate the convergence speed of the proposed algorithm. The computational results have proved that the proposed hybrid algorithm is an effective approach to solve the multi-objective FJSP.

Cite

CITATION STYLE

APA

Shivasankaran, N., Senthil Kumar, P., & Venkatesh Raja, K. (2015). Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling. International Journal of Computational Intelligence Systems, 8(3), 455–466. https://doi.org/10.1080/18756891.2015.1017383

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free