Artificial Immune System algorithm for multi objective flow shop scheduling problem

Similar documents
INTERNATIONAL JOURNAL OF APPLIED ENGINEERING RESEARCH, DINDIGUL Volume 2, No 3, 2011

A New Approach to Solve Multiple Traveling Salesmen Problem by Clonal Selection Algorithm

LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS

Flowshop Scheduling Problem for 10-Jobs, 10-Machines By Heuristics Models Using Makespan Criterion

An Improved Immune Genetic Algorithm for Capacitated Vehicle Routing Problem

GENETIC ALGORITHMS. Narra Priyanka. K.Naga Sowjanya. Vasavi College of Engineering. Ibrahimbahg,Hyderabad.

Optimal Two Stage Open Shop Specially Structured Scheduling To Minimize The Rental Cost

A Viral Systems Algorithm for the Traveling Salesman Problem

SINGLE MACHINE SEQUENCING. ISE480 Sequencing and Scheduling Fall semestre

COMPARISON OF PARETO EFFICIENCY AND WEIGHTED OBJECTIVES METHOD TO SOLVE THE MULTI-CRITERIA VEHICLE ROUTING PROBLEM USING THE ARTIFICIAL IMMUNE SYSTEM

Modeling and optimization of ATM cash replenishment

A Sequencing Heuristic to Minimize Weighted Flowtime in the Open Shop

What is Evolutionary Computation? Genetic Algorithms. Components of Evolutionary Computing. The Argument. When changes occur...

Logistics. Final exam date. Project Presentation. Plan for this week. Evolutionary Algorithms. Crossover and Mutation

INTEGRATING VEHICLE ROUTING WITH CROSS DOCK IN SUPPLY CHAIN

ISE480 Sequencing and Scheduling

Evolutionary Algorithms

AN IMPROVED ALGORITHM FOR MULTIPLE SEQUENCE ALIGNMENT OF PROTEIN SEQUENCES USING GENETIC ALGORITHM

Available online at ScienceDirect. Procedia CIRP 26 (2015 ) th Global Conference on Sustainable Manufacturing

An Introduction to Artificial Immune Systems

ICMIEE-PI Minimization of Makespan in Flow Shop Scheduling Using Heuristics

Evolutionary Algorithms and Simulated Annealing in the Topological Configuration of the Spanning Tree

Genetic Algorithm: A Search of Complex Spaces

A Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests

QoS-based Scheduling for Task Management in Grid Computing

Minimizing Mean Tardiness in a Buffer-Constrained Dynamic Flowshop - A Comparative Study

EXAMINATION OF SCHEDULING METHODS FOR PRODUCTION SYSTEMS. 1. Relationship between logistic and production scheduling

International Journal of Modern Engineering Research (IJMER) Vol.3, Issue.3, May-June pp ISSN:

Sustainable sequencing of N jobs on one machine: a fuzzy approach

Genetic Algorithms in Matrix Representation and Its Application in Synthetic Data

A Study of Crossover Operators for Genetic Algorithms to Solve VRP and its Variants and New Sinusoidal Motion Crossover Operator

TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS. Liviu Lalescu, Costin Badica

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Production and Delivery Batch Scheduling with Multiple Due Dates to Minimize Total Cost

Simulation-Based Analysis and Optimisation of Planning Policies over the Product Life Cycle within the Entire Supply Chain

Optimization of Riser in Casting Using Genetic Algorithm

DEADLOCK AVOIDANCE AND RE-ROUTING OF AUTOMATED GUIDED VEHICLES (AGVS) IN FLEXIBLE MANUFACTURING SYSTEMS (FMS)

A comparative study of ASM and NWCR method in transportation problem

SELECTED HEURISTIC ALGORITHMS FOR SOLVING JOB SHOP AND FLOW SHOP SCHEDULING PROBLEMS

Transactions on the Built Environment vol 33, 1998 WIT Press, ISSN

A Genetic Algorithm on Inventory Routing Problem

ModelingandSchedulingofMultiStageandMultiProcessorFlowShop

Optimal Operator Assignment In An Assembly Line Using Genetic Algorithm

Abstract Number: A Feasibility Study for Joint Services of Vehicle Routing and Patrol

Economic Load Dispatch Solution Including Transmission Losses Using MOPSO

CHAPTER 1 INTRODUCTION

An Approach to Analyze and Quantify the Functional Requirements in Software System Engineering

CROSS-DOCKING: SCHEDULING OF INCOMING AND OUTGOING SEMI TRAILERS

CEng 713 Evolutionary Computation, Lecture Notes

A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem

Procedia - Social and Behavioral Sciences 189 ( 2015 ) XVIII Annual International Conference of the Society of Operations Management (SOM-14)

Available online at ScienceDirect. Transportation Research Procedia 14 (2016 )

Optimization of Composite Laminates Stacking Sequence for Buckling using Adaptive Genetic Algorithm

Iterative train scheduling in networks with tree topologies: a case study for the Hunter Valley Coal Chain

Flexible and Reconfigurable Layouts in Complex Manufacturing Systems

Searching for memory in artificial immune system

Reentrant FMS scheduling in loop layout with consideration of multi loading-unloading stations and shortcuts

A neural reinforcement learning approach to learn local dispatching policies in production scheduling

Heuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny

Classical Approach to Solve Economic Load Dispatch Problem of Thermal Generating Unit in MATLAB Programming

HCTL Open Int. J. of Technology Innovations and Research HCTL Open IJTIR, Volume 2, March 2013 e-issn: ISBN (Print):

Genetic Algorithms using Populations based on Multisets

Implementation of Genetic Algorithm for Agriculture System

Dynamic Facility Planning under Production and Material Handling Capacity Constraints

A Decision Support System for Performance Evaluation

Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach

Metaheuristics and Cognitive Models for Autonomous Robot Navigation

A thesis presented to. the faculty of. In partial fulfillment. of the requirements for the degree. Master of Science. Kush Mathur.

Multi-depot Vehicle Routing Problem with Pickup and Delivery Requests

Artificial Immune Algorithm for Solving Fixed Charge Transportation Problem

Gyeongsang National University, Jinju, Korea b Department of MIS, Chungbuk National University, Chungbuk, Korea

Analysis of the job shop system with transport and setup times in deadlock-free operating conditions

Keywords Genetic, pseudorandom numbers, cryptosystems, optimal solution.

Research Article Forecasting Bank Deposits Rate: Application of ARIMA and Artificial Neural Networks

Multiobjective Optimization. Carlos A. Santos Silva

Applying Computational Intelligence in Software Testing

MINIMIZING MEAN COMPLETION TIME IN FLOWSHOPS WITH RANDOM PROCESSING TIMES

Routing Optimization of Fourth Party Logistics with Reliability Constraints based on Messy GA

Procedia - Social and Behavioral Sciences 109 ( 2014 )

SCHEDULING IN MANUFACTURING SYSTEMS

TRANSPORTATION MODEL IN DELIVERY GOODS USING RAILWAY SYSTEMS

SCHEDULING JOBS ON A SINGLE BPM WITH NON-AGREEABLE RELEASE TIME AND DUE DATES TO MINIMIZE MAKESPAN

Stochastic Single Machine Family Scheduling To Minimize the Number of Risky Jobs

Derivative-based Optimization (chapter 6)

A Genetic Algorithm for a Bicriteria Supplier Selection Problem

Viral Systems Implementation for Minimizing Mean Tardiness of Job Shop Scheduling Problem

ARTICLE IN PRESS. Immune programming

OPTIMIZATION OF A THREE-PHASE INDUCTION MACHINE USING GENETIC ALGORITHM

A FRAMEWORK FOR APPLICATION OF GENETIC ALGORITHM IN PRODUCTIVITY OPTIMIZATION OF HIGHWAY EQUIPMENTS USING EVOLVER SOFTWARE

Designing High Thermal Conductive Materials Using Artificial Evolution MICHAEL DAVIES, BASKAR GANAPATHYSUBRAMANIAN, GANESH BALASUBRAMANIAN

Axiomatic Design of Manufacturing Systems

Data Mining for Genetics: A Genetic Algorithm Approach

Business Information Systems. Decision Making and Problem Solving. Figure Chapters 10 & 11

Deterministic Crowding, Recombination And Self-Similarity

A LONG - TERM CONTRACTS PORTFOLIO MANAGEMENT CONFERENCE THE EUROPEAN ELECTRICITY MARKET SEPTEMBER 20-22, 2004, LODZ, POLAND

New Results for Lazy Bureaucrat Scheduling Problem. fa Sharif University of Technology. Oct. 10, 2001.

Available online at ScienceDirect. Procedia CIRP 62 (2017 )

CHAPTER 2 PROBLEM STATEMENT

The Efficient Allocation of Individuals to Positions

International Journal of Scientific & Engineering Research, Volume 7, Issue 12, December ISSN

Transcription:

ISSN (Online) : 2319-8753 ISSN (Print) : 2347 6710 International Journal of Innovative Research in Science, Engineering and Technology Volume 3, Special Issue 3, March 2014 2014 International Conference on Innovations in Engineering and Technology (ICIET 14) On 21 st & 22 nd March Organized by K.L.N. College of Engineering and Technology, Madurai, Tamil Nadu, India Artificial Immune System algorithm for multi objective flow shop scheduling problem M.Vairamuthu, S.Porselvi, DR.A.N.Balaji, J.Rajesh Babu ME (CAD/CAM), K.L.N college of Engineering, Tamilnadu, India Assistant professor of mechanical engg, K.L.N college of Engineering., Tamilnadu, India Professor of mechanical engg, K.L.N college of Engineering, Tamilnadu, India Associate professor of automobile engg K.L.N college of Engineering, Tamilnadu, India ABSTRACT The n-job, m-machine flow shop scheduling problem is one of the most general job scheduling problems. This study deals with the multi objective optimization with the criteria of makespan minimization and minimization of total weighted flow time for the flow shop scheduling problem. The n-job m- machine problem is known to be NP hard problem, several meta heuristics have been applied so far in the literature. Artificial Immune Systems (AIS) are new intelligent problem solving techniques that are being used in scheduling problems. AIS can be defined as computational systems inspired by theoretical immunology, observed immune functions, principles and mechanisms in order to solve problems. In this research, a computational method based on clonal selection principle and affinity maturation mechanisms of the immune response is used. Matlab code was generated to use the algorithm for finding the optimal solution. KEYWORDS Artificial Immune Systems, flow shop scheduling problem. I. INTRODUCTION In the quick changing market the production scheduling plays a key role in manufacturing systems of an enterprise wanting to maintain competitive position. Due to that competition, developing effective and efficient advanced scheduling technologies is extremely important. The so-called flow shop scheduling problem represents a class of widely studied cases based on ideas derived from production engineering, which currently modeled a lot of manufacturing systems, assembly lines, information service facilities. [1]Ventura et.al, presents linear programming formulations to find optimal starting and completion times for all the jobs in a given sequence considering various types of buffers and sub lots. Copyright to IJIRSET www.ijirset.com 1391 Heuristic algorithms that blend linear programming with several pair wise interchange strategies are proposed to find near-optimal solutions for multiple-job, multiple machine lot-streaming flow shop scheduling problems. [2]Buthainah.et.al, Concluded that the Flow Shop problem is tackled using Genetic Algorithm based solution for Traveling Salesman Problem (GATSP) in order to obtain optimal machine sequencing schedule. It must be noted that critical path must always pass through machine with large processing times for all jobs. The proposed algorithm targeted the maximization of the total efficiency of the shop given only the job/machine processing time matrix for machine scheduling, with ease and flexibility of data handling and manipulation. [3]Mostafa.et.al, proposed a parallel genetic algorithm to solve the flow shop Scheduling Problem with regard to being NP-hard, the method of parallel genetic algorithm with the use of MATLAB 7.0 software has been developed and then the quality of the results with their time of calculation is compared with the results obtained from GA(Genetic Algorithm). [4]Pempera.et.al, gives that the flow shop scheduling problem with minimizing two criteria simultaneously: the total completion time (makespan) and the sum of tardiness of jobs. The problem is strongly NP-hard, since for each separate criterion the problem is strongly NP-hard. There is a number of heuristic algorithms to solve the flow shop problem with various single objectives, but usage of those heuristics to multi-criteria flow shop problems is rather limited. They are propose a new idea of the use of simulated annealing method to solve certain multi-criteria problem. Especially, define a new acceptance rules and the mechanism of moving the search in different regions of solution space by using so called drift. [5]Jolai.et.al, proposed a bi-objective no-wait two-stage flexible flow shop is considered. The objectives of minimizing makespan and maximum tardiness of jobs are taken into account. The aim is finding the best approximate of

Pareto optimal solutions. Three meta-heuristic Paretobased multi-objective algorithms, called Classic weighted simulated annealing (CWSA), Normalized weighted simulated annealing (NWSA) and Fuzzy simulated annealing (FSA), were proposed. In order to evaluate the performance of these algorithms, 18 problems in different sizes were solved. Any scheduling problem essentially depends upon three important factors namely, job transportation time which includes moving time and idle time, relative importance of a job over another job and breakdown machine time (non-time due any reason). These three factors were separately studied by many researchers. Miyazaki and Nishiyama (1980) had carried out an analysis for minimizing weighted mean flow time in flowshop scheduling. [6]Chandramouli proposed a heuristic approach for n-job, 3-machine flow-shop scheduling problem involving transportation time, breakdown time and weights of jobs. [7]Pandian and Rajendran improved and simplified the procedure for a constrained flow-shop problem for 3-jobs. [8]Baskar and Anthony gives that new procedure is proposed to obtain a scheduling sequence having optimal or near optimal makespan for a flowshop scheduling problems involving known break down time. II. PROBLEM DESCRIPTION Multi-objective optimization is defined as the problem of finding a vector of decision variables that satisfies all constraints and simultaneously optimizes a vector function whose elements represent the objective functions. Mathematically, the multi-objective optimization problem can be formulized as follows: Min f (x) = {f1(x), f2(x)... fm(x)} xexnx s.t. g(x) 0, h(x) = 0, The processing of each job has to be continuous. That is, once a job is started on the first machine, it must be processed through all machines without any pre- emption and interruption. Each machine can handle no more than one job at a time. Each job has to visit each machine exactly once. The release time of all jobs is zero. It means all jobs can be processed at time 0. The first objective considered is to minimize the maximum completion time or makespan (Cmax). The corresponding fitness function is calculated as follows: min z 2 = w f A mixed integer programming model is given using the following notation. n Number of jobs to be scheduled i Number of stages (i = 1, 2) m Number of machines to be processed K Number of machines in stage i O (i, j) Available time for job j in stage i on machine k xjl 1 if job j locates in position l of the job sequence. 0 otherwise yijk 1 if job i is processed on machine k. 0 otherwise Bij start time of job j in stage i Cij completion time of job j in stage i Objective functions: Min z = (z1, z2) z1 = max(c2j) z2 = max(w f ) Weighted method: Min Z = w1 f1(x) + w2 f2(x), w1 + w2 = 1, w1, w2 0. III. PROPOSED METHOD This section discusses the implementation of an artificial immune system (AIS) algorithm to solve the flow shop problem. 3.1 Introduction to AIS AIS is an adaptive system inspired by theoretical immunology and observed immune functions, principles, and models, which are applied to complex problem domains [11]. The principle of clonal selection and affinity maturation of the immune response system leads to the develop-ment of powerful computational tools to solve combinatorial optimization problems. The human immune system protects our body from the attack of foreign organisms, such as viruses and bacteria. These foreign organisms are called antigens. The molecules, called antibodies, that recognize the presence of an antigen will increase rapidly by cloning. This process is called the clonal selection principle [12]. Cj = Completion time of job j Makespan = Cmax = max(cj) min z 1 = Cmax. Another objective considered in this paper is to minimize mean weighted flow time. This objective is calculated as follows: Copyright to IJIRSET www.ijirset.com 1392

data mining, robotics, scheduling, clustering, and classification. 3.2 The AIS algorithm steps The general AIS algorithm consists of the following steps: 1. Initialization: Create a random population of individuals p. 2. Affinity evaluation: Measure the affinity of each individual in the population. 3. Clonal selection: Select the n best individuals of the population based on the affinity measure. 4. Clonal expansion: Clone the n best individuals of the population proportional to the rate of cloning. The clone is an identical copy of the original string. (The clone size is an increasing function of the affinity measure.) 5. Affinity maturation: Mutate each clone to generate a matured antibody of the population. Preserve the improved individuals for the next generation. 6. Metadynamics: Replace R individuals with low affinity value with randomly generated new ones. The lower affinity cells have higher probabilities of being replaced. This process introduces diversity into the population. Fig. 1: Flow chart of the proposed artificial immune system (AIS) algorithm The new cloned cells undergo mutations in order to improve the affinity of the antibodies, which results in antigen neutralization and elimination. These mutations experienced by the clones are proportional to their affinity to the antigen [13]. As a subsequent process to mutation, some percentage of the worst cells is eliminated and the same percentage of new antibodies is introduced into the system. This process is called receptor editing. This process is used to explore new search regions and also to escape from local optima [9]. The recognition and learning capabilities of the natural immune system provides properties such as robustness, dynamism, and adaptability to AIS-based algorithms [14]. These properties of the immune system attract researchers to apply it to other functional areas of engineering. The application of AIS is found in areas such as biological modeling, computer network security and virus detection, 7. Cycle: Repeat step 2 to step 6 until a certain stopping criteria is met. 3.3 Numerical illustration The AIS approach has three user-defined parameters, namely, population size (P), the number of iterations (n), and the amount of low-affinity antibodies to be replaced (R). The algorithm has been tested for the following ranges of parameters: P=20, 40, and 50 n=500, 1,000, 1,500, and 2,000 R=0, 10, and 20 After running the algorithm, better solutions were obtained using the following parameters: Population size: 50 No. of iterations: 2,000 Amount of low-affinity antibodies to be replaced: 10 Copyright to IJIRSET www.ijirset.com 1393

The working of the AIS algorithm is explained through the following numerical illustration: Step 1 Initialize a random population of strings up to the specified population (P). A string represents a possible solution. For example, the string 6 1 5 9 7 2 3 4 8 10 represents a layout sequence which is to be placed around the loop. Step 2 Compute the objective function value (OFV) and affinity value for all solutions in the current population. The affinity value is calculated from the following equation: Affinity =1/OFV From the above equation, it is clear that lower the OFV, higher the affinity value. Step 3 The selection of strings for cloning is done directly proportionally according to their affinity value. Step 4 The rate of cloning is calculated by using the following relation: Rate of cloning = Affinity value of a solution * population size --------------------------------------------------------------------- Total of the affinity values of solutions in the population The above procedure gives more clones of strings that have lower OFVs than those with higher OFVs. This also gives rise to a temporary population of clones(c). Step 5 Each clone inverse and pairwise mutation is carried out as follows: Step 5a Inverse mutation Generate a random number between (1, N), where N is the number of machines. Let 1 and 6 be the randomly selected positions in the string. The inverse mutation in the original string is performed by inversing the sequence of machines between locations 1 and 6, as shown below: After performing the inverse mutation, if the OFV of the mutated string is less than the original string, then the original string is replaced by the mutated string; else, pairwise mutation is carried out on the original string. After performing pairwise mutation, if the OFV of the mutated sequence is less than the original sequence, then the original sequence is replaced by the mutated sequence; otherwise, the original sequence is retained. After the cloning and mutation processes, reselect the improved strings from the temporary population C so as to maintain the original population size P. Now, the original population P is composed of improved strings. Step 6 Then, R% of the solutions which has the highest OFV in the population is replaced with the same R % of randomly generated solutions. Step 7 Repeat step 2 to step 6 for the required number of iterations. IV. RESULTS AND DISCUSSION The effectiveness of the proposed algorithm is demonstrated and a comparative analysis is presented in result and discussion section. The validity of the proposed model is tested for the problems taken from literature review. It shows the number of parts and the required machine sequence for each part for the test problems. The proposed algorithm is coded in the MATLAB R2009b. All tests were executed on a Intel core i3 processor under a Microsoft Windows 7 (32-bit) operating system. The artificial immune system (AIS) with the best sequence among the minimization of objective function value for the 10 type of problem is shown in table as follows: Problem no. No. of jobs, No. Of machines Optimal sequence OFV 1 4,3 4-3-2-1 38.4 2 4,4 3-4-2-1 53.9 3 5,3 3-5-2-4-1 45.6 4 5,4 3-2-4-5-1 64.6 5 5,5 2-5-4-3-1 84.5 6 6,3 4-1-6-3-5-2 61.5 7 6,4 3-2-6-4-1-5 73.6 8 6,5 4-1-5-6-2-3 92.8 9 6,6 6-3-2-1-5-4 117.6 10 10,10 2-8-10-1-5-3- 7-4-6-9 V. CONCLUSION AND FUTURE WORK Step 5b Pairwise mutation The major contribution of this work has been the implementation of a best sequence depends upon Generate a random number between (1, N). minimization of the objective values of the flow shop Let 1 and 6 be the randomly selected positions in the scheduling problems. The artificial immune system string. The pairwise mutation in the original string is (AIS)-based algorithm is implemented to solve the loop performed by interchanging the locations of machines 1 flexible flow shop problem and corresponding sequence and 6 in the original string, as shown below: are introduced. The performance of the proposed algorithm has been validated with the results available in Copyright to IJIRSET www.ijirset.com 1394 175.2

the literature. The obtained results are found to be better than the results of the literature, which proved that AIS is a robust tool for solving flow shop problems. Also, AIS has been shown to provide significant improvements in the results for large sized problems. In future, the proposed procedure can be integrated with simulation software in order to study the operational difficulties and performance measures of the flexible flow shop scheduling problems. REFERENCES [1] Suk-Hun Yoon, Jose A. Ventura, Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling, Computers & Operations Research,29, (2002) 1301-1315 [2] Buthainah F Al-Dulaimi and Hamza A.Ali, A Novel Genetic Algorithm Approach for Solving Flow Shop Problem, IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.9, September 2008. [3] Mostafa Akhshabi, Javad Haddadnia, Mohammad Akhshabi, Solving flow shop scheduling problem using a parallel genetic Algorithm, Procedia Technology 1 ( 2012 ) 351 355. [4] Pempera Jarosław, Smutnicki Czesław, Zelazny Dominik, Optimizing bicriteria flow shop scheduling problem by simulated annealing algorithm, Procedia Computer Science 18 ( 2013 ) 936 945. [5] F. Jolai, H. Asefi, M. Rabiee, P. Ramezani, Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem Scientia Iranica E (2013) 20 (3), 861 872. [6] A. B. Chandramouli, Heuristic approach for n-job, 3-machine flow shop scheduling problem involving transportation time, break down time and weights of jobs Mathematical and Computational Applications, Vol. 10, No. 2, pp. 301-305, 2005. [7] P. Pandian and P. Rajendran, Solving Constrained Flow-Shop Scheduling Problems with Three Machines Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 19, 921-929 [8] Baskar A, Dr.Anthony Xavier M, A simple model to optimize general flow-shop scheduling problems with known breakdown time and weights of jobs procedia engineering, 38, 2012, 191-196. [9] Orhan Engin, Alper Doyen, A new approach to solve hybrid flow shop scheduling problems by artificial immune system Future Generation Computer Systems 20 (2004) 1083 1095 [10] J. Timmis, A. Hone, T. Stibor, E. Clark, Theoretical advances in artificial immune systems Theoretical Computer Science 403 (2008) 11 32 [11] R. M. Satheesh Kumar & P. Asokan & S. Kumanan, Artificial immune system-based algorithm for the unidirectional loop layout problem in a flexible manufacturing system Int J Adv Manuf Technol (2009) 40:553 565. [12] Waiel F. Abd El-Wahed, Elsayed M. Zaki, Adel M. El-Refaey Artificial immune system based neural networks for solving multi-objective programming problems Egyptian Informatics Journal (2010) 11, 59 65. [13] Mahmoud Moustafa El-Sherbiny, Alternate mutation based artificial immune algorithm for step fixed charge transportation problem Egyptian Informatics Journal (2012) 13, 123 134. [14] Tsui-Ping Chunga, Ching-Jong Liao, An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem Applied Soft Computing 13 (2013) 3729 3736.E Std. 802.11, 1997. Copyright to IJIRSET www.ijirset.com 1395