A hybrid genetic algorithm approach to mixed-model assembly line balancing
|
|
- Darcy Russell
- 7 years ago
- Views:
Transcription
1 Int J Adv Manuf Technol (2006) 28: DOI /s O R I G I N A L A R T I C L E A. Noorul Haq J. Jayaprakash K. Rengarajan A hybrid genetic algorithm approach to mixed-model assembly line balancing Received: 4 May 2004 / Accepted: 9 August 2004 / Published online: 20 April 2005 Springer-Verlag London Limited 2005 Abstract Assembly line balancing has been a focus of interest to academics in operation management for the last four decades. Mass production has saved huge costs for manufacturers in various industries for some time. With the growing trend of greater product variability and shorter life cycles, traditional mass production is being replaced in assembly lines. The current market is intensely competitive and consumer-centric. Mixed-model assembly lines are increasing in many industrial environments. This study deals with mixed-model assembly line balancing for n models, and uses a classical genetic algorithm approach to minimize the number of workstations. We also incorporated a hybrid genetic algorithm approach that used the solution from the modified ranked positional method for the initial solution to reduce the search space within the global space, thereby reducing search time. Several examples illustrate the approach. The software used for programming is C++ language. Keywords Genetic algorithm Hybrid algorithm Mixedmodel assembly line balancing 1 Introduction An assembly line is a set of sequential workstations linked by a material handling system. In each workstation, a set of tasks are performed using a predefined assembly process in which the following issues are defined: (a) task time, the time required to perform each task; and (b) a set of precedence relationships, which determines the sequence of the tasks. The A. Noorul Haq ( ) K. Rengarajan Department of Production Engineering, National Institute of Technology, Tiruchirapalli , India anhaq@nitt.edu J. Jayaprakash Department of Mechanical Engineering, Pachari Sri Nallathankal Amman (PSNA) College of Engineering and Technology, Dindigul , India current market is intensely competitive and consumer-centric. For example, in the automobile industry, most of the models have a number of features, and the customer can choose a model based on their desires and financial capability Different features mean that different, additional parts must be added on the basic model. Due to high cost to build and maintain an assembly line, the manufacturers produce one model with different features or several models on a single assembly line. Under these circumstances, the mixed-model assembly line balancing problem arises to smooth the production and decrease the cost. Since the demands for different models and for features vary on a daily basis, the problem should be solved everyday in industry. Formally, a mixed-model assembly line balancing problem can be stated as follows: given n models, the set of tasks associated with each model, the performance times of the tasks, and the set of precedence relations which specify the permissible orderings of the tasks for each model, the problem is to assign the tasks to an ordered sequence of stations such that precedence relations of each model are satisfied and some performance measures are optimized. Unlike the case of a single model line, different models of a product are assembled on a mixed-model assembly line. The models are launched to the line one after another. Two types of assembly line balancing problems are: 1. Type-I problems, where the required production rate (i.e. cycle time), assembly tasks, tasks times, and precedence requirements will be given and the objective is to minimize the number of workstations; and 2. Type-II problems, where the number of workstations or production employees is fixed and the objective is to minimize the cycle time and maximize the production rate. These types of balancing problems are generally occur when the organization wants to produce the optimum number of items using a fixed number of workstations without purchasing new machines or expanding its facilities. This study is mainly focused on the Type-I problem, which aims to minimize the number of workstations.
2 338 2 Literature review The mixed-model with deterministic assembly line balancing model is very applicable in just in time manufacturing environments because attempts have been made to find sequences resulting in minimal WIP levels. Helgeson and Birnie [1] solved the assembly line balancing problem using a ranked positional weight technique. Kabir and Tabucanon [2] solved the batchmodel assembly line (two or more products) problem using a multi-attribute-based approach. Monden [3] was concerned with the sequencing of assembly lines such that the stability of parts usage rates would be addressed. Miltenburg [4] presented a heuristic approach to both measure the stability of parts usage rates and to minimize the lumpiness of raw material usage. Erel and Gokcen [5] used shortest-route formulation to minimize the task time for different models while also considering precedence constraints. Erel and Gokcen [6] developed a binary integer formulation for the mixed-model assembly line balancing problem. In another work, Erel and Gocken developed a goal programming approach [7] in which they used a combined precedence diagram, which had been previously developed by Thomopoulos [8]. A two-stage heuristic method for balancing mixed-model assembly lines was developed by Vilarinho and Simaria [9]. The application of genetic algorithms (GA) for assembly line balancing has been widely studied so for. Anderson and Ferris [10] proposed a genetic algorithm for Type-II problems, and Leu, Matheson and Rees [11] presented a GA-based approach to solve Type-I problems with multiple objectives. A genetic algorithm for work load smoothing was presented by Kim, Kim and Kim [12]. Chen, Lu and Yu [13] developed a hybrid genetic algorithm approach to the assembly line planning problem. All these studies are different from this work not only in terms of the problem considered, but also in terms of the hybrid approach. This study presents a hybrid GA approach to solve the mixed model assembly line balancing problem. Initially, a wellknown heuristic method is used to generate a feasible solution. This solution is then included into the randomly-derived population of an evolving pool of GA. The goal of including a heuristics solution in this population is to reduce the search space from the size of the global space, thereby reducing the search time. 3. No WIP inventory buffer is allowed between stations. 4. Parallel stations are not allowed. 5. Common tasks exist between models, which must be assigned to the same stations. The concept of a combined precedence diagram is to transform different models into an equivalent single model. The combined diagram is constructed by taking the union of the nodes and the precedence relations of the diagrams of all the models. The construction of the combined diagram is straightforward with precedence matrices. A simple example is given in Fig. 1 to illustrate the process of constructing a combined diagram. The 3 Model description The mixed-model assembly line balancing approach utilizes the concept of combined precedence diagrams to join the precedence relations of different models in a single diagram. Typically, there are several tasks common to the various models manufactured on a mixed model assembly line, with similar precedence relations among these tasks. Thus, the similarity between the precedence relations of different models has been utilized. The assumptions of the model are listed below: 1. Task time of each models are known constants. 2. Precedence diagram for each models are known. Fig. 1a c. Precedence diagrams of a model A b model B c combined precedence diagram
3 339 numbers within the circles represent tasks, and the arrows connecting the circles specify the precedence relations. The objective function of the problem is Min where k k=1 A k k = Number of stations, A k = Total number of stations. = 1 if station k is utilized by any one model. 4 Hybrid Approach Gentic algorithm have been proven effective in many combinatorial optimization problems, and it seems natural to apply the approach to a mixed-model assembly line balancing. To improve the capability of searching for a good solution, we introduce a hybrid genetic algorithm with the modified ranked positional weight method (MRPW). First, a classical GA method is used to test the problem and then solved by the modified ranked positional weight method. Finally, the solution generated by the heuristic method is introduced randomly into initial pools and proceed by the GA method. 4.1 Genetic Algorithm Genetic algorithms are stochastic search methods that mimic the metaphor of natural biological evolution. Genetic algorithms operate on a population of potential solutions applying the principle of survival of the fittest to produce increasingly better approximations to a solution. At each generation, a new set of approximations is created by the process of selecting individuals according to their level of fitness in the problem domain, and breeding them together using operators borrowed from natural genetics. This process leads to the evolution of better suited populations. The three most important aspects of using genetic algorithms are: 1. definition of the objective function; 2. definition and implementation of the genetic representation; and 3. definition and implementation of the genetic operators. At the beginning of the computation a number of individuals (the population) are randomly initialised. cycle time. Now, we multiply the respective task times of the models by corresponding production shares and add up the task time for all the models to get average task time. Next, we determine the positional weight (PW) for each task using the average task time. The positional weight of a task in a mixed-model assembly line is the cumulative average task time associated with itself and its successors. Then we rank the work elements based on the PW and proceed to assign work elements to the workstations, where elements of the highest PW and rank are assigned first. If at any workstation additional time remains after the assignment of an operation, we assign the next succeeding ranked operation to the workstation, as long as the operation does not violate the precedence relationships and cycle time. 4.3 Hybrid genetic algorithm In the proposed hybrid genetic algorithm, the initial solution is obtained from the modified ranked positional weight method and included in the initial population of the genetic algorithm. This approach reduces the search space from the size of the global space, thereby reducing the search time. 5 Experiments and analysis We applied two similar models to a mixed-model assembly line balancing problem. The precedence diagrams of the two models and their tasks times are given in Table 1. Note that as shown in Fig. 1, the combined diagram has 11 tasks, where as the first and second models have seven and nine tasks, respectively. Cycle time is 10 min for each model. 5.1 Genetic algorithm The experiment is first solved by genetic algorithm for various models. The inputs for the genetic algorithm procedure such as population size, crossover probability, mutation probability is 50, 0.8 and Also, the task time of the models and precedence Table 1. Task time for two models No of tasks Models Model A Model B Modified ranked positional weight method (MRPW) The modified ranked positional weight method was introduced by Helgeson and Birnie [1] for a Type-I single model line balancing problem. Here, we apply this method in mixed model balancing. First, we determine the number of models and the production share of each model, and then we calculate the production share of each model in terms of the percentage having a fixed Table 2. Optimal station assignment of the illustrative example: GA No of Task at Model A Station time Model B Station time work station each station (s) (s) 1. 1,4,5,8,9 1,8,9 8 1,4,5, ,6,2 3,2 9 3, ,7,11 7, ,7,11 10
4 340 diagrams of the two models are given as input. The optimal station assignment of the illustrative example for classical GA is given in Table 2. The execution time for this example is 391 s. 5.2 Modified ranked positional weight method The demand for each of the models are equal and the weighted task times are given for calculating the positional weights. The positional weights and the ranking of the tasks for the illustrative example are given in Table 3. The optimal station assignment of the illustrative example for the modified ranked positional weight method is given in Table 4. A comparison of the results for various models is given in Table 5. It reveals that the classical GA method offers superior solutions, compared to the modified ranked position weight method. The graphical representation of the results is shown in Fig Hybrid genetic algorithm The experiment is also tested by a hybrid genetic algorithm for various models. The inputs for the hybrid genetic algorithm procedure such as population size, crossover probability, mutation Table 5. Comparison of GA and MRPW No of No of Total task Number of workstations observation models in combined MRPW Genetic taken diagram algorithm Table 6. Comparison of pure GA and hybrid GA No of No of Total no of Processing time (s) observation models tasks in Classical GA Hybrid GA taken combined diagram Table 3. Positional weight of the tasks No of tasks Models Model A Model B Average task time Positional weight Rank Table 4. Optimal station assignment of the illustrative example: MRPW Work Task at Station time stations each station (s) 1 1,4, , , , ,11 5 Fig. 3. Comparison of GA and hybrid GA probability are 50, 0.8 and Also, the task time of the models and precedence diagrams of the two models are given as input. The solutions from the MRPW are randomly inserted into the initial pools and retested. The execution time of the hybrid genetic algorithm is found to be less than that of the classical GA. The execution time for this illustrative example is 110 s. A comparison of the results for the various models is given in Table 6. It reveals that the hybrid GA method is superior to the classical GA in terms of execution time. The graphical representation of the results is shown in Fig Conclusion Fig. 2. Comparison of GA and MRPW In this study, we have presented a hybrid genetic algorithm approach to solve the mixed-model assembly line balancing prob-
5 341 lem. The genetic algorithm approach is shown to produce better results than the modified rank position weight in the minimization of workstations. Next, we combined the solution of the MRPW approach with that produced by a genetic algorithm and make a hybrid genetic algorithm. This approach results in better performance than a classical genetic algorithm. References 1. Helgeson WB, Birninie DP (1961) Assembly line balancing using the ranked postitional weight techniques. Int J Prod Econ 48: Kabir A, Tabucanon MT (1995) Batch-model assembly line balancing: a multi attribute decision making approach. Int J Prod Econ 41: Monden Y (1993) Toyota production system, second edition. Industrial Engineering and Management Press, Institute of Industrial Engineers, Norcross, GA 4. Miltenburg GJ (1989) Level schedules for mixed-model assembly lines in just-in-time production systems. Manage Sci 35: Erel E, Gokcen H (1999) Shortest-route formulation of mixed-model assembly line balancing problem. Eu J Oper Res 116: Erel E, Gokcen H (1998) Binary integer formulation for mixed-model assembly line balancing problem. Comput Ind Eng 23: Erel E, Gokcen H (1997) A goal programming approach to mixedmodel assembly line balancing problem. Int J Prod Econ 48: Thomopoulos NT (1967) Line balancing-sequencing for mixed model assembly. Manage Sci 4(2):B59 B75 9. Vilarinho PM, Simaria AS (2002) A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations. Int J Prod Res 40: Anderson EJ, Ferris MC (1994) Genetic algorithms for combinatorial optimization: Assembly line balancing problem. ORSA J Comput 6: Leu YY, Matheson LA, Rees LP (1994) Assembly line balancing using genetic algorithm with heuristic-generated initial population and multible evalution criteria. Dec Sci 25: Kim YK, Kim YJ, Kim Y (1996) Genetic algorithms for assembly line balancing with various objectives. Comput Ind Eng 30: Ruey-Shun C, Kun-yung L, Shien-chang Y (2002) A hybrid genetic algorithm approach on assembly line planning problem. Eng Appl Artif Intell 15:
6
7
A Hybrid Tabu Search Method for Assembly Line Balancing
Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization, Beijing, China, September 15-17, 2007 443 A Hybrid Tabu Search Method for Assembly Line Balancing SUPAPORN
More informationAssembly line balancing to minimize balancing loss and system loss. D. Roy 1 ; D. Khan 2
J. Ind. Eng. Int., 6 (11), 1-, Spring 2010 ISSN: 173-702 IAU, South Tehran Branch Assembly line balancing to minimize balancing loss and system loss D. Roy 1 ; D. han 2 1 Professor, Dep. of Business Administration,
More informationOn heijunka design of assembly load balancing problem: Genetic algorithm & ameliorative procedure-combined approach
International Journal of Intelligent Information Systems 2015; 4(2-1): 49-58 Published online February 10, 2015 (http://www.sciencepublishinggroup.com/j/ijiis) doi: 10.11648/j.ijiis.s.2015040201.17 ISSN:
More informationA Tabu Search Algorithm for the Parallel Assembly Line Balancing Problem
G.U. Journal o Science (): 33-33 (9) IN PRESS www.gujs.org A Tabu Search Algorithm or the Parallel Assembly Line Balancing Problem Uğur ÖZCAN, Hakan ÇERÇĐOĞLU, Hadi GÖKÇEN, Bilal TOKLU Selçuk University,
More informationInternational Journal of Industrial Engineering Computations
International Journal of Industrial Engineering Computations 2 (2011) 329 336 Contents lists available at GrowingScience International Journal of Industrial Engineering Computations homepage: www.growingscience.com/ijiec
More informationAssembly Line Balancing in a Clothing Company
S. H.Eryuruk, F. Kalaoglu, *M. Baskak Textile Engineering Department, *Industrial Engineering Department, Istanbul Technical University Instanbul, Turkiye Assembly Line Balancing in a Clothing Company
More informationInternational Journal of Advances in Science and Technology (IJAST)
Determination of Economic Production Quantity with Regard to Machine Failure Mohammadali Pirayesh 1, Mahsa Yavari 2 1,2 Department of Industrial Engineering, Faculty of Engineering, Ferdowsi University
More informationMemory Allocation Technique for Segregated Free List Based on Genetic Algorithm
Journal of Al-Nahrain University Vol.15 (2), June, 2012, pp.161-168 Science Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Manal F. Younis Computer Department, College
More informationA Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical
More informationAssembly Line Balancing A Review
Assembly Line Balancing A Review Vrittika Pachghare 1, R. S. Dalu 2 1 M.Tech. Student, Production Engineering, Govt. College of Engineering, Amravati, Maharashtra, India 2 Associate Professor, Mechanical
More informationHigh-Mix Low-Volume Flow Shop Manufacturing System Scheduling
Proceedings of the 14th IAC Symposium on Information Control Problems in Manufacturing, May 23-25, 2012 High-Mix Low-Volume low Shop Manufacturing System Scheduling Juraj Svancara, Zdenka Kralova Institute
More informationResearch on a Heuristic GA-Based Decision Support System for Rice in Heilongjiang Province
Research on a Heuristic GA-Based Decision Support System for Rice in Heilongjiang Province Ran Cao 1,1, Yushu Yang 1, Wei Guo 1, 1 Engineering college of Northeast Agricultural University, Haerbin, China
More informationHighway Maintenance Scheduling Using Genetic Algorithm with Microscopic Traffic Simulation
Wang, Cheu and Fwa 1 Word Count: 6955 Highway Maintenance Scheduling Using Genetic Algorithm with Microscopic Traffic Simulation Ying Wang Research Scholar Department of Civil Engineering National University
More informationAbstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling
Abstract number: 015-0551 Abstract Title: Planned Preemption for Flexible Resource Constrained Project Scheduling Karuna Jain and Kanchan Joshi Shailesh J. Mehta School of Management, Indian Institute
More informationOnline publication date: 23 April 2010
This article was downloaded by: [Gokcen, Hadi][TÜBİTAK EKUAL] On: 26 April 2010 Access details: Access Details: [subscription number 786636116] Publisher Taylor & Francis Informa Ltd Registered in England
More informationAvailable online at www.sciencedirect.com. ScienceDirect. Procedia CIRP 40 (2016 ) 390 395
Available online at www.sciencedirect.com ScienceDirect Procedia CIRP 40 (2016 ) 390 395 13th Global Conference on Sustainable Manufacturing - Decoupling Growth from Resource Use A Heuristic Approach to
More informationMIXED MODEL ASSEMBLY LINE BALANCING PROBLEM WITH FUZZY OPERATION TIMES AND DRIFTING OPERATIONS. Weida Xu Tianyuan Xiao
Proceedings of the 28 Winter Simulation Conference S J Mason, R R Hill, L Mönch, O Rose, T Jefferson, J W Fowler eds MIXED MODEL ASSEMBLY LINE BALANCING PROBLEM WITH FUZZY OPERATION TIMES AND DRIFTING
More informationA Hybrid Heuristic Rule for Constrained Resource Allocation in PERT Type Networks
World Applied Sciences Journal 7 (10): 1324-1330, 2009 ISSN 1818-4952 IDOSI Publications, 2009 A Hybrid Heuristic Rule for Constrained Resource Allocation in PERT Type Networks Siamak Baradaran and S.M.T.
More informationGeneric Single Channel Multi Phase Waiting Line Model applied to Production Line for Productivity Improvement
IOSR Journal of Mechanical and Civil Engineering (IOSR-JMCE) e-issn: 2278-1684,p-ISSN: 2320-334X, Volume 12, Issue 3 Ver. I (May. - Jun. 2015), PP 90-100 www.iosrjournals.org Generic Single Channel Multi
More informationSOFTWARE TESTING STRATEGY APPROACH ON SOURCE CODE APPLYING CONDITIONAL COVERAGE METHOD
SOFTWARE TESTING STRATEGY APPROACH ON SOURCE CODE APPLYING CONDITIONAL COVERAGE METHOD Jaya Srivastaval 1 and Twinkle Dwivedi 2 1 Department of Computer Science & Engineering, Shri Ramswaroop Memorial
More informationFormulation of simple workforce skill constraints in assembly line balancing models
Ŕ periodica polytechnica Social and Management Sciences 19/1 (2011) 43 50 doi: 10.3311/pp.so.2011-1.06 web: http:// www.pp.bme.hu/ so c Periodica Polytechnica 2011 Formulation of simple workforce skill
More informationResearch RESOURCE SCHEDULING OF CONSTRUCTION PROJECTS USING GENETIC ALGORITHM Devikamalam. J 1, Jane Helena. H 2. Address for Correspondence
Devikamalam, et al., International Journal of Advanced Engineering Technology Research Paper RESOURCE SCHEDULING OF CONSTRUCTION PROJECTS USING GENETIC ALGORITHM Devikamalam. J 1, Jane Helena. H 2 Address
More informationA Robust Method for Solving Transcendental Equations
www.ijcsi.org 413 A Robust Method for Solving Transcendental Equations Md. Golam Moazzam, Amita Chakraborty and Md. Al-Amin Bhuiyan Department of Computer Science and Engineering, Jahangirnagar University,
More informationOptimization of Preventive Maintenance Scheduling in Processing Plants
18 th European Symposium on Computer Aided Process Engineering ESCAPE 18 Bertrand Braunschweig and Xavier Joulia (Editors) 2008 Elsevier B.V./Ltd. All rights reserved. Optimization of Preventive Maintenance
More informationIndex Terms- Batch Scheduling, Evolutionary Algorithms, Multiobjective Optimization, NSGA-II.
Batch Scheduling By Evolutionary Algorithms for Multiobjective Optimization Charmi B. Desai, Narendra M. Patel L.D. College of Engineering, Ahmedabad Abstract - Multi-objective optimization problems are
More informationHeuristic Approach for Assembly Line Balancing Problems 1. INTRODUCTION
International Journal of Advanced Manufacturing Systems Volume 2 G Number 1 G January-June 2011 G pp. 67-71 International Science Press I J A M S Heuristic Approach for Assembly Line Balancing Problems
More informationA Shift Sequence for Nurse Scheduling Using Linear Programming Problem
IOSR Journal of Nursing and Health Science (IOSR-JNHS) e-issn: 2320 1959.p- ISSN: 2320 1940 Volume 3, Issue 6 Ver. I (Nov.-Dec. 2014), PP 24-28 A Shift Sequence for Nurse Scheduling Using Linear Programming
More informationOptimal Scheduling for Dependent Details Processing Using MS Excel Solver
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 8, No 2 Sofia 2008 Optimal Scheduling for Dependent Details Processing Using MS Excel Solver Daniela Borissova Institute of
More informationResearch Article Service Composition Optimization Using Differential Evolution and Opposition-based Learning
Research Journal of Applied Sciences, Engineering and Technology 11(2): 229-234, 2015 ISSN: 2040-7459; e-issn: 2040-7467 2015 Maxwell Scientific Publication Corp. Submitted: May 20, 2015 Accepted: June
More informationGA as a Data Optimization Tool for Predictive Analytics
GA as a Data Optimization Tool for Predictive Analytics Chandra.J 1, Dr.Nachamai.M 2,Dr.Anitha.S.Pillai 3 1Assistant Professor, Department of computer Science, Christ University, Bangalore,India, chandra.j@christunivesity.in
More informationA Tool for Generating Partition Schedules of Multiprocessor Systems
A Tool for Generating Partition Schedules of Multiprocessor Systems Hans-Joachim Goltz and Norbert Pieth Fraunhofer FIRST, Berlin, Germany {hans-joachim.goltz,nobert.pieth}@first.fraunhofer.de Abstract.
More informationResource grouping selection to minimize the maximum over capacity planning
2012 International Conference on Industrial and Intelligent Information (ICIII 2012) IPCSIT vol.31 (2012) (2012) IACSIT Press, Singapore Resource grouping selection to minimize the maximum over capacity
More informationBiopharmaceutical Portfolio Management Optimization under Uncertainty
Ian David Lockhart Bogle and Michael Fairweather (Editors), Proceedings of the 22nd European Symposium on Computer Aided Process Engineering, 17-20 June 2012, London. 2012 Elsevier B.V. All rights reserved
More informationPredictive Analytics using Genetic Algorithm for Efficient Supply Chain Inventory Optimization
182 IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.3, March 2010 Predictive Analytics using Genetic Algorithm for Efficient Supply Chain Inventory Optimization P.Radhakrishnan
More informationPriori ty ... ... ...
.Maintenance Scheduling Maintenance scheduling is the process by which jobs are matched with resources (crafts) and sequenced to be executed at certain points in time. The maintenance schedule can be prepared
More informationA genetic algorithm for resource allocation in construction projects
Creative Construction Conference 2015 A genetic algorithm for resource allocation in construction projects Sofia Kaiafa, Athanasios P. Chassiakos* Sofia Kaiafa, Dept. of Civil Engineering, University of
More informationSTUDY ON APPLICATION OF GENETIC ALGORITHM IN CONSTRUCTION RESOURCE LEVELLING
STUDY ON APPLICATION OF GENETIC ALGORITHM IN CONSTRUCTION RESOURCE LEVELLING N.Satheesh Kumar 1,R.Raj Kumar 2 PG Student, Department of Civil Engineering, Kongu Engineering College, Perundurai, Tamilnadu,India
More informationNonlinear Model Predictive Control of Hammerstein and Wiener Models Using Genetic Algorithms
Nonlinear Model Predictive Control of Hammerstein and Wiener Models Using Genetic Algorithms Al-Duwaish H. and Naeem, Wasif Electrical Engineering Department/King Fahd University of Petroleum and Minerals
More informationHYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE
HYBRID GENETIC ALGORITHMS FOR SCHEDULING ADVERTISEMENTS ON A WEB PAGE Subodha Kumar University of Washington subodha@u.washington.edu Varghese S. Jacob University of Texas at Dallas vjacob@utdallas.edu
More informationOptimizing Machine Allocation in Semiconductor Manufacturing Capacity Planning using. Bio-Inspired Approaches
Optimizing Machine Allocation in Semiconductor Manufacturing Capacity Planning using Umi Kalsom Yusof School of Computer Sciences Universiti Sains Malaysia 11800 USM, Penang, Malaysia umiyusof@cs.usm.my
More informationA Method of Cloud Resource Load Balancing Scheduling Based on Improved Adaptive Genetic Algorithm
Journal of Information & Computational Science 9: 16 (2012) 4801 4809 Available at http://www.joics.com A Method of Cloud Resource Load Balancing Scheduling Based on Improved Adaptive Genetic Algorithm
More informationComparison of algorithms for automated university scheduling
Comparison of algorithms for automated university scheduling Hugo Sandelius Simon Forssell Degree Project in Computer Science, DD143X Supervisor: Pawel Herman Examiner: Örjan Ekeberg CSC, KTH April 29,
More informationThe Application of Bayesian Optimization and Classifier Systems in Nurse Scheduling
The Application of Bayesian Optimization and Classifier Systems in Nurse Scheduling Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN VIII), LNCS 3242, pp 581-590,
More informationRevenue Management for Transportation Problems
Revenue Management for Transportation Problems Francesca Guerriero Giovanna Miglionico Filomena Olivito Department of Electronic Informatics and Systems, University of Calabria Via P. Bucci, 87036 Rende
More informationDetermining Inventory Levels in a CONWIP Controlled Job Shop
Determining Inventory Levels in a CONWIP Controlled Job Shop Sarah M. Ryan* Senior Member, IIE Department of Industrial and Management Systems Engineering University of Nebraska-Lincoln Lincoln, NE 68588-0518
More informationA Service Revenue-oriented Task Scheduling Model of Cloud Computing
Journal of Information & Computational Science 10:10 (2013) 3153 3161 July 1, 2013 Available at http://www.joics.com A Service Revenue-oriented Task Scheduling Model of Cloud Computing Jianguang Deng a,b,,
More informationPerformance Optimization of I-4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT
Performance Optimization of I-4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT Sean Li, DaimlerChrysler (sl60@dcx dcx.com) Charles Yuan, Engineous Software, Inc (yuan@engineous.com) Background!
More informationProject Time Management
Project Time Management Study Notes PMI, PMP, CAPM, PMBOK, PM Network and the PMI Registered Education Provider logo are registered marks of the Project Management Institute, Inc. Points to Note Please
More informationThe Multi-Item Capacitated Lot-Sizing Problem With Safety Stocks In Closed-Loop Supply Chain
International Journal of Mining Metallurgy & Mechanical Engineering (IJMMME) Volume 1 Issue 5 (2013) ISSN 2320-4052; EISSN 2320-4060 The Multi-Item Capacated Lot-Sizing Problem Wh Safety Stocks In Closed-Loop
More informationA SURVEY ON GENETIC ALGORITHM FOR INTRUSION DETECTION SYSTEM
A SURVEY ON GENETIC ALGORITHM FOR INTRUSION DETECTION SYSTEM MS. DIMPI K PATEL Department of Computer Science and Engineering, Hasmukh Goswami college of Engineering, Ahmedabad, Gujarat ABSTRACT The Internet
More informationMINIMUM FLOW TIME SCHEDULE GENETIC ALGORITHM FOR MASS CUSTOMIZATION MANUFACTURING USING MINICELLS
University of Kentucky UKnowledge University of Kentucky Master's Theses Graduate School 2006 MINIMUM FLOW TIME SCHEDULE GENETIC ALGORITHM FOR MASS CUSTOMIZATION MANUFACTURING USING MINICELLS Phanindra
More informationOPTIMIZATION MODEL OF EXTERNAL RESOURCE ALLOCATION FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEMS
OPTIMIZATION MODEL OF EXTERNAL RESOURCE ALLOCATION FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEMS Kuo-Chuan Shih Shu-Shun Liu Ph.D. Student, Graduate School of Engineering Science Assistant Professor,
More informationAlpha Cut based Novel Selection for Genetic Algorithm
Alpha Cut based Novel for Genetic Algorithm Rakesh Kumar Professor Girdhar Gopal Research Scholar Rajesh Kumar Assistant Professor ABSTRACT Genetic algorithm (GA) has several genetic operators that can
More informationHeuristic Procedure for the Assembly Line Balancing Problem With Postural Load Smoothness
International Journal of Occupational Safety and Ergomics (JOSE) 203, Vol. 9, No. 4, 53 54 Heuristic Procedure for the Assembly Line Balancing Problem With Postural Load Smoothness Chorkaew Jaturanda Department
More informationA GENETIC ALGORITHM FOR RESOURCE LEVELING OF CONSTRUCTION PROJECTS
A GENETIC ALGORITHM FOR RESOURCE LEVELING OF CONSTRUCTION PROJECTS Mahdi Abbasi Iranagh 1 and Rifat Sonmez 2 Dept. of Civil Engrg, Middle East Technical University, Ankara, 06800, Turkey Critical path
More informationIntelligent Software Project Scheduling and Team Staffing with Genetic Algorithms
Intelligent Software Project Scheduling and Team Staffing with Genetic Algorithms Constantinos Stylianou 1 and Andreas S. Andreou 2 1 Department of Computer Science, University of Cyprus, 75 Kallipoleos
More informationKeywords revenue management, yield management, genetic algorithm, airline reservation
Volume 4, Issue 1, January 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Revenue Management
More informationINTEGRATED OPTIMIZATION OF SAFETY STOCK
INTEGRATED OPTIMIZATION OF SAFETY STOCK AND TRANSPORTATION CAPACITY Horst Tempelmeier Department of Production Management University of Cologne Albertus-Magnus-Platz D-50932 Koeln, Germany http://www.spw.uni-koeln.de/
More informationA SURVEY ON WORKFLOW SCHEDULING IN CLOUD USING ANT COLONY OPTIMIZATION
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 2, February 2014,
More informationIntroduction To Genetic Algorithms
1 Introduction To Genetic Algorithms Dr. Rajib Kumar Bhattacharjya Department of Civil Engineering IIT Guwahati Email: rkbc@iitg.ernet.in References 2 D. E. Goldberg, Genetic Algorithm In Search, Optimization
More informationA Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number
A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number 1 Tomohiro KAMIMURA, 2 Akinori KANASUGI 1 Department of Electronics, Tokyo Denki University, 07ee055@ms.dendai.ac.jp
More informationA STUDY OF TASK SCHEDULING IN MULTIPROCESSOR ENVIROMENT Ranjit Rajak 1, C.P.Katti 2, Nidhi Rajak 3
A STUDY OF TASK SCHEDULING IN MULTIPROCESSOR ENVIROMENT Ranjit Rajak 1, C.P.Katti, Nidhi Rajak 1 Department of Computer Science & Applications, Dr.H.S.Gour Central University, Sagar, India, ranjit.jnu@gmail.com
More informationInternational Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering
DOI: 10.15662/ijareeie.2014.0307061 Economic Dispatch of Power System Optimization with Power Generation Schedule Using Evolutionary Technique Girish Kumar 1, Rameshwar singh 2 PG Student [Control system],
More informationOptimal Tuning of PID Controller Using Meta Heuristic Approach
International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 2 (2014), pp. 171-176 International Research Publication House http://www.irphouse.com Optimal Tuning of
More informationMarket Stock Decisions Based on Morphological Filtering
Market Stock Decisions Based on Morphological Filtering Pere Marti-Puig, R. Reig-Bolaño, J. Bajo, and S. Rodriguez * Abstract. In this paper we use a nonlinear processing technique based on mathematical
More informationFast Sequential Summation Algorithms Using Augmented Data Structures
Fast Sequential Summation Algorithms Using Augmented Data Structures Vadim Stadnik vadim.stadnik@gmail.com Abstract This paper provides an introduction to the design of augmented data structures that offer
More informationCONSTRUCTION PROJECT BUFFER MANAGEMENT IN SCHEDULING PLANNING AND CONTROL
CONSTRUCTION PROJECT BUFFER MANAGEMENT IN SCHEDULING PLANNING AND CONTROL Jan, Shu-Hui Ph.D. Student Construction Engineering & Management Program Department of Civil Engineering National Taiwan University
More informationA MILP Scheduling Model for Multi-stage Batch Plants
A MILP Scheduling Model for Multi-stage Batch Plants Georgios M. Kopanos, Luis Puigjaner Universitat Politècnica de Catalunya - ETSEIB, Diagonal, 647, E-08028, Barcelona, Spain, E-mail: luis.puigjaner@upc.edu
More informationImproved Multiprocessor Task Scheduling Using Genetic Algorithms
From: Proceedings of the Twelfth International FLAIRS Conference. Copyright 999, AAAI (www.aaai.org). All rights reserved. Improved Multiprocessor Task Scheduling Using Genetic Algorithms Michael Bohler
More information8. KNOWLEDGE BASED SYSTEMS IN MANUFACTURING SIMULATION
- 1-8. KNOWLEDGE BASED SYSTEMS IN MANUFACTURING SIMULATION 8.1 Introduction 8.1.1 Summary introduction The first part of this section gives a brief overview of some of the different uses of expert systems
More informationA Review And Evaluations Of Shortest Path Algorithms
A Review And Evaluations Of Shortest Path Algorithms Kairanbay Magzhan, Hajar Mat Jani Abstract: Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing
More informationDemand Forecasting Optimization in Supply Chain
2011 International Conference on Information Management and Engineering (ICIME 2011) IPCSIT vol. 52 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V52.12 Demand Forecasting Optimization
More informationProcess Modelling from Insurance Event Log
Process Modelling from Insurance Event Log P.V. Kumaraguru Research scholar, Dr.M.G.R Educational and Research Institute University Chennai- 600 095 India Dr. S.P. Rajagopalan Professor Emeritus, Dr. M.G.R
More informationAN INDUSTRIAL APPLICATION OF THE SMED METHODOLOGY AND OTHER LEAN PRODUCTION TOOLS
Integrity, Reliability and Failure of Mechanical Systems Paper Ref: 3927 AN INDUSTRIAL APPLICATION OF THE SMED METHODOLOGY AND OTHER LEAN PRODUCTION TOOLS Eric Costa 1(*), Rui Sousa 1, Sara Bragança 1,
More informationGenetic Algorithm for Scheduling of Laboratory Personnel
Clinical Chemistry 47:1 118 123 (2001) Laboratory Management Genetic Algorithm for Scheduling of Laboratory Personnel James C. Boyd * and John Savory Background: Staffing core laboratories with appropriate
More informationCHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING
60 CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING 3.1 INTRODUCTION Optimal short-term hydrothermal scheduling of power systems aims at determining optimal hydro and thermal generations
More informationA DECISION SUPPORT SYSTEM FOR THE LEVEL OF REPAIR ANALYSIS PROBLEM. Carlos M. Ituarte-Villarreal and Jose F. Espiritu
A DECISION SUPPORT SYSTEM FOR THE LEVEL OF REPAIR ANALYSIS PROBLEM Carlos M. Ituarte-Villarreal and Jose F. Espiritu Department of Industrial, Manufacturing & Systems Engineering. The University of Texas
More informationINVENTORY CONTROL BY TOYOTA PRODUCTION SYSTEM KANBAN METHODOLOGY A CASE STUDY
Int. J. Mech. Eng. & Rob. Res. 2013 V M Nistane and Srinivas Viswanath V, 2013 Research Paper ISSN 2278 0149 www.ijmerr.com Vol. 2, No. 1, January 2013 2013 IJMERR. All Rights Reserved INVENTORY CONTROL
More informationCLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM
CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM *Shabnam Ghasemi 1 and Mohammad Kalantari 2 1 Deparment of Computer Engineering, Islamic Azad University,
More informationAnalysis Of Shoe Manufacturing Factory By Simulation Of Production Processes
Analysis Of Shoe Manufacturing Factory By Simulation Of Production Processes Muhammed Selman ERYILMAZ a Ali Osman KUŞAKCI b Haris GAVRANOVIC c Fehim FINDIK d a Graduate of Department of Industrial Engineering,
More informationRe-balancing of Generalized Assembly Lines Searching Optimal Solutions for SALBP
Proceedings of the 2010 International Conference on Industrial Engineering and Operations Management Dhaka, Bangladesh, January 9 10, 2010 Re-balancing of Generalized Assembly Lines Searching Optimal Solutions
More informationD A T A M I N I N G C L A S S I F I C A T I O N
D A T A M I N I N G C L A S S I F I C A T I O N FABRICIO VOZNIKA LEO NARDO VIA NA INTRODUCTION Nowadays there is huge amount of data being collected and stored in databases everywhere across the globe.
More informationSmart Graphics: Methoden 3 Suche, Constraints
Smart Graphics: Methoden 3 Suche, Constraints Vorlesung Smart Graphics LMU München Medieninformatik Butz/Boring Smart Graphics SS2007 Methoden: Suche 2 Folie 1 Themen heute Suchverfahren Hillclimbing Simulated
More informationTime-line based model for software project scheduling
Time-line based model for software project scheduling with genetic algorithms Carl K. Chang, Hsin-yi Jiang, Yu Di, Dan Zhu, Yujia Ge Information and Software Technology(IST), 2008 2010. 3. 9 Presented
More informationMulti Objective Simultaneous Assembly Line Balancing and Buffer Sizing
Multi Obective Simultaneous Assembly Line Balancing and Buffer Sizing Saif Ullah, Guan Zailin, Xu Xianhao, He Zongdong, Wang Baoxi Abstract Assembly line balancing problem is aimed to divide the tasks
More informationDiscovering Sequential Rental Patterns by Fleet Tracking
Discovering Sequential Rental Patterns by Fleet Tracking Xinxin Jiang (B), Xueping Peng, and Guodong Long Quantum Computation and Intelligent Systems, University of Technology Sydney, Ultimo, Australia
More informationEfficient and Robust Allocation Algorithms in Clouds under Memory Constraints
Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints Olivier Beaumont,, Paul Renaud-Goud Inria & University of Bordeaux Bordeaux, France 9th Scheduling for Large Scale Systems
More informationProject Scheduling to Maximize Fuzzy Net Present Value
, July 6-8, 2011, London, U.K. Project Scheduling to Maximize Fuzzy Net Present Value İrem UÇAL and Dorota KUCHTA Abstract In this paper a fuzzy version of a procedure for project scheduling is proposed
More informationA Continuous-Time Formulation for Scheduling Multi- Stage Multi-product Batch Plants with Non-identical Parallel Units
European Symposium on Computer Arded Aided Process Engineering 15 L. Puigjaner and A. Espuña (Editors) 2005 Elsevier Science B.V. All rights reserved. A Continuous-Time Formulation for Scheduling Multi-
More informationISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013
Transistor Level Fault Finding in VLSI Circuits using Genetic Algorithm Lalit A. Patel, Sarman K. Hadia CSPIT, CHARUSAT, Changa., CSPIT, CHARUSAT, Changa Abstract This paper presents, genetic based algorithm
More informationCollege of information technology Department of software
University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/2011-2012 ***************************************************************************
More informationProject Scheduling in Software Development
Project Scheduling in Software Development Eric Newby, Raymond Phillips, Dario Fanucchi, Byron Jacobs, Asha Tailor, Lady Kokela, Jesal Kika, Nadine Padiyachi University of the Witwatersrand January 13,
More informationNumerical Research on Distributed Genetic Algorithm with Redundant
Numerical Research on Distributed Genetic Algorithm with Redundant Binary Number 1 Sayori Seto, 2 Akinori Kanasugi 1,2 Graduate School of Engineering, Tokyo Denki University, Japan 10kme41@ms.dendai.ac.jp,
More informationA New Approach for Efficient Rescheduling of Multiproduct Batch Plants
4228 Ind. Eng. Chem. Res. 2000, 39, 4228-4238 A New Approach for Efficient Rescheduling of Multiproduct Batch Plants Jeetmanyu P. Vin and Marianthi G. Ierapetritou* Department of Chemical and Biochemical
More informationUWE has obtained warranties from all depositors as to their title in the material deposited and as to their right to deposit such material.
Simons, C. and Parmee, I. (2006) A comparison of genetic algorithms and evolutionary programming in conceptual software design. In: Proceedings of the Seventh International Conference of Adaptive Computing
More information2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering
2014-2015 The Master s Degree with Thesis Course Descriptions in Industrial Engineering Compulsory Courses IENG540 Optimization Models and Algorithms In the course important deterministic optimization
More informationWeb based Multi Product Inventory Optimization using Genetic Algorithm
Web based Multi Product Inventory Optimization using Genetic Algorithm Priya P Research Scholar, Dept of computer science, Bharathiar University, Coimbatore Dr.K.Iyakutti Senior Professor, Madurai Kamarajar
More informationA Binary Model on the Basis of Imperialist Competitive Algorithm in Order to Solve the Problem of Knapsack 1-0
212 International Conference on System Engineering and Modeling (ICSEM 212) IPCSIT vol. 34 (212) (212) IACSIT Press, Singapore A Binary Model on the Basis of Imperialist Competitive Algorithm in Order
More informationAn ACO-based Approach for Scheduling Task Graphs with Communication Costs
An ACO-based Approach for Scheduling Task Graphs with Communication Costs Markus Bank Udo Hönig Wolfram Schiffmann FernUniversität Hagen Lehrgebiet Rechnerarchitektur 58084 Hagen, Germany {Markus.Bank,
More informationA Strategic Capacity Planning Model: A Genetic Algorithm Approach
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 12 Dec,2013 Page No. 3455-3464 A Strategic Capacity Planning Model: A Genetic Algorithm Approach N.
More information