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.

No abstract

No abstract

No abstract

Scheduling problems are generally treated as NP -complete combinatorial optimization problems which is a multi-objective and multi constraint one. Repair shop Job sequencing and operator allocation is one such NP -complete problem. For such problems, an efficient technique is required that explores a wide range of solution space. This paper deals with Simulated Annealing Technique, a Meta -heuristic to solve the complex Car Sequencing and Operator Allocation problem in a car repair shop. The algorithm is tested with several constraint settings and the solution quality exceeds the results reported in the literature with high convergence speed and accuracy. This algorithm could be considered as quite effective while other heuristic routine fails.