Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling

DOI

10.1080/18756891.2015.1017383How to use a DOI?

Keywords

Scheduling, Sorting, Immune Simulated Annealing Technique, Flexible Job Shop, Multi-objective Optimization, Make span

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.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - N. Shivasankaran
AU  - P. Senthil Kumar
AU  - K. Venkatesh Raja
PY  - 2015
DA  - 2015/06/01
TI  - Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling
JO  - International Journal of Computational Intelligence Systems
SP  - 455
EP  - 466
VL  - 8
IS  - 3
SN  - 1875-6883
UR  - https://doi.org/10.1080/18756891.2015.1017383
DO  - 10.1080/18756891.2015.1017383
ID  - Shivasankaran2015
ER  -