INTERNATIONAL JOURNAL OF APPLIED ENGINEERING RESEARCH, DINDIGUL Volume 2, No 3, 2011
|
|
- Merilyn Holland
- 6 years ago
- Views:
Transcription
1 Minimization of Total Weighted Tardiness and Makespan for SDST Flow Shop Scheduling using Genetic Algorithm Kumar A. 1 *, Dhingra A. K. 1 1Department of Mechanical Engineering, University Institute of Engineering & Technology, Maharshi Dayanand University, Rohtak Haryana INDIA * Corresponding author. Tel: + (91) , aman.k.ghangas@gmail.com ABSTRACT In the present work, SDST flow shop scheduling with minimizing the weighted sum of total weighted tardiness and makespan have been considered simultaneously. Four modified heuristic have been proposed for preliminary viable sequence. Sequence obtained from the modified heuristics is combined with the initial seed sequence of genetic algorithm and called as Genetic Algorithm (GA). Hence four different GAs named as GA 1, GA 2, GA 3 and GA 4 with further classical GA called as GA 5 have been presented for bi-criteria SDST flow shop scheduling problem for comparative analysis amongst them. Bi-criteria fitness function proposed for scheduling the jobs in SDST flow shop proves to be efficient and flexible for minimizing the due date and completion time related performance measures. From the comparative analysis among different GAs considered, it has been found that the performance of algorithm varies with the size of job and machines. It has also been concluded that GA 3 shows better results over other for all the problems considered upto 200 jobs and 20 machines including sequence dependent set up time. Keywords: Scheduling, Genetic Algorithm, Sequence Dependent Set up Time, Total weighted tardiness, makespan 1. Introduction A schedule is a systematic plan that generally tells when the things are made-up to happen; it shows the plan for the timing of the certain actions. The sequence is adapted which gives optimal results concerned with allocating limited resources to tasks to optimize certain objective functions. For standardization of performance, the level of performance should be a non-decreasing function of job completion times. The scheduling objective is to minimize the performance measures. To quantify the objectives in scheduling, it is very complicated as they are numerous, multifaceted and conflicting. Higher precision and accuracy of a particular work also contributes towards more complexity. Minimizing makespan, total flow time, total tardiness, maximum tardiness and number of tardy jobs are among the most generally measured performance measures. Makespan and total flow time deals with maximizing system deployment and inventory/stock, whereas the remaining measures are associated with the job due dates. Enhanced productivity and highest deployment of resources are directly related to scheduling with makespan criteria. If the industry is not competent in meeting the due dates on times, it will definitely results in the loss of customer and market competitiveness. As today s world, 483
2 deliverance of the goods is an important aspect for customer satisfaction. In modern days, cost of production of a product must be economical so that producer can survive. An optimal solution for tardiness based objectives is also very complex with the introduction of the just in time (JIT). Very efficient heuristics have been developed for the minimum makespan problem (Błazewicz et al., 1996). Many algorithms benefit from a schedule representation known as the disjunctive graph formulation (Adams et al., 1988). Particularly local-search algorithms like Simulated Annealing and Tabu Search have been applied with great success. It turned out that general purpose methods like GAs are only second best choice among the modern heuristics, particularly if applied to large makespan problems. Rajendran (1995) implemented the heuristic for flow shop scheduling for minimizing the multiple objectives of makespan, total flow time and idle time for machines. Sayin and Karabati (1999) considered the scheduling problem in a two machine flow shop environment by minimizing makespan and sum of completion times simultaneously. Gupta et al. (2001) minimized the total flow time and makespan in a two machines flow shop scheduling problems for optimal sequence. Ravindran et al. (2005) optimized the multiple objectives of makespan and total flow time together in a flow shop scheduling. They proposed three heuristics HAMC1, HAMC2 and HAMC3 and concluded that the proposed heuristics yields good results than the Rajendran heuristic CR (1995). Gowrishankar et al. (2001) considered two types of problems, firstly m-machine flow shop scheduling with minimizing variance of completion times of jobs and another with minimizing the sum of squares of deviations of the job completion times from a common due date. Ponnambalam et al. (2004) minimized the weighted sum of multiple objectives (i.e. minimizing makespan, mean flow time and machine idle time) with the proposed TSPGA multi-objective algorithm for flow shop scheduling. Blazewicz et al. (2005) examined different solution procedures for the two machine flow shop scheduling problem with a common due date and weighted latework criterion. Noorul Haq and Radha Ramanan (2006) used Artificial neural network (ANN) for minimizing bicriteria of makespan and total flow time in flow shop scheduling environment They showed that performance of ANN approach is better than constructive or improvement heuristics.rahimi-vahed and Mirghorbani (2007) developed multi objective particle swarm optimization for flow shop scheduling problem for minimizing the weighted mean completion time and weighted mean tardiness simultaneously. They also concluded that the proposed algorithm is effective from Genetic Algorithm for large sized problem. Chakraborty and Laha (2007) modified the NEH algorithm and achieved significant improvement in the quality of the solution while maintaining the same algorithmic complexity. They also showed that the original NEH and proposed NEH's outperform the best-known competitor to date.tamer Eren and Ertan Güner (2009) considered bi-criteria of minimizing a weighted sum of total completion time and total tardiness for m-identical parallel machine scheduling problem with a learning effect. Typical flow shop scheduling problems intends to reduce production time and enhance productivity and resource deployment as primarily focused towards the completion time associated objectives. As customer requirements are to be satisfied in time and simultaneously industry has to present a wide range of different and individual products for the assurance that they have made before. So, Bi-criteria SDST flow shop scheduling with minimization of makespan and total weighted tardiness has been considered in the present work. 484
3 2. Problem Statement Some of the assumptions made in the present work are as follows: a) Machines should never be break downed and should be accessible all through the scheduling period. b) Once a process is ongoing on a machine it must be completed otherwise another operation cannot be start on that machine. c) Each and every machine is frequently accessible for processing, without considerable distribution of the scale into shifts or days and without consideration of momentary unavailability such as breakdown or maintenance. d) Each and every processing time of each job on every machine must be known in advance, whatever may be the sequence of the jobs to be processed (deterministic, finite or independent). e) A job can be processed through each one of the m machines just the once. What's more, a job cannot be available to the next machine if processing on the current machine is going on. f) The first machine is assumed to be ready always; any job is to be processed on it first. g) Machines may be idle or at rest. h) If the next machine on the sequence needed by a job is not available, the job can wait and joins the queue at that machine i.e. in-process inventory is allowed. A number of researchers ignore the bi-criteria nature of SDST flow shop scheduling problem as more than one decision maker is involved in the decision making resulting into conflicting objectives. The accessibility of set of feasible solutions characterizing tradeoff between the different objective functions can be quite valuable, for adjustment of this situation. In many realistic problems, setup times depend on the type of job just completed as well as on the type about to be processed. In those situations, it is not valid to absorb the setup time for a job in its processing time, and explicit modifications must be made. Simultaneously, because of too much unnecessary intricacy in Bi-criteria SDST flow shop scheduling problems, a reduced amount of awareness has been provided to this dilemma. Bi-criteria fitness function considered here is the minimization of sum of makespan and total weighted tardiness which has been described below: The first performance measure for scheduling is makespan (C max ) which has been used for maximum utilization of resources to increase productivity and stated as maximum completion time of last job to exit from the system. C max = Max (C 1,., C n ) The second criterion for scheduling is to minimization of total weighted tardiness. Associated with each job j is a due date d j > 0. Let U j = 1 if due date for job j is smaller than the completion time C j of job j, otherwise U j = 0. The total weighted tardiness (t a ) is defined as Therefore Bi-criteria fitness function is obtained by combining both objectives into single scalar function and has been framed as: Where α and β are the weight values for the considered objective functions having constraints: And and 485
4 3. Proposed Genetic Algorithm Maintaining the seed sequence obtained from the developed heuristic together with a set of (Ps) randomly generated initial population according to population size Ps. As selection of a good set of chromosomes in the initial population results in improvement in the performance of a genetic algorithm. The proposed GA is described in the following: Step 1. Generate the seed sequence. Step 2. The algorithm then creates a sequence of new populations. At each step, the algorithm uses the individuals in the current generation to create the next population. To create the new population, the algorithm performs the following steps: a. Scores each member of the current population by computing fitness i.e. minimizing weighted sum of total weighted tardiness and makespan, simultaneously b. Selects members, called parents, based on their fitness. c. Some of the individuals in the current population that have lesser fitness are chosen as elite. These elite individuals are conceded to the next population. d. Produces offspring from the parents. Offspring s are produced either by combining the vector entries of a pair of parents crossover or by making random changes to a single parent mutation. e. Replaces the current population with the children to form the next generation. Step 3. The algorithm stops when computational time reaches n m 0.5 Seconds. Generation of seed sequence as in step 1 of GA has been obtained from the proposed modified heuristics. Therefore four modified heuristic based GA called as GA 1, GA 2, GA 3, GA 4 and one classical Genetic algorithm in which initial sequences have been generated randomly i.e. GA 5 have been developed for comparative analysis amongst them. 4. Proposed modified heuristic A NEH based heuristic of Nawaz et. al. (1983) for makespan minimization has been modified for Bi-criteria fitness function with minimizing the weighted sum of makespan and total weighted tardiness for SDST flow shop scheduling. The explanation of proposed modified heuristic is as follows: Step 1: Generate the initial sequence. Step 2: Fix k = 2. Select the earliest two jobs from the rearranged jobs list and schedule them in order to minimizing weighted sum of total weighted tardiness and makespan as if there are only two jobs. Set the better one as the current solution. Step 3: Increase k by 1. Create k candidate sequences by putting the first job in the left over job list into each slot of the current solution. Among these candidates, select the best one with the least partial minimization of weighted sum of total weighted tardiness and makespan. Update the selected partial solution as the new current solution. Step 4: If k = n, a schedule (the current solution) has been found and stops. If not, move to step 3. Initial sequence in step 1 of proposed modified heuristic is being generated by the following rules as described below:- 486
5 1. Schedule the jobs initially in descending order of m P i j as in original NEH (Nawaz et. i = 1 al., 1983). 2. Organize the jobs according to the earliest due date of jobs i.e. EDD (Kim, 1993). 3. Initially jobs are arranged according to least value of d j /w j (Parathasarthy and Rajendran, 1997). 4. Initially arrange the jobs according to earliest weighted due date i.e. w j d j. Thus the final sequence has been obtained by considering the initial sequence as above in step 1 of proposed modified heuristic and obtained four different NEH denoted as NEH 1, NEH 2, NEH 3, NEH 4. Thus four different modified heuristics have been developed and final sequence from these heuristic is taken as initial sequence in the GA procedure resulting into four modified heuristics based genetic algorithms (GAs). Table 1.1 Different heuristic for comparative analysis of proposed GA. S. No. Heuristic Description 1 NEH 1 Initial sequence is developed as proposed by Nawaz et al. (1983). 2 NEH 2 Initially jobs are arranged according to earliest due date and then final sequence of jobs is obtained by NEH procedure. 3 NEH 3 Initially jobs are arranged according to least value of d j /w j (Parthasarthi and Rajendran, 1997) and then final sequence is obtained by NEH procedure. 4 NEH 4 Initially jobs are ordered according to least value of w j d j and then final sequence is obtained by NEH procedure. Thus, the parameters defined in the proposed GA as follows:- Table 1.2: Parameters of GA. Parameter Value Weighted value for C max, α 0.5 Weighted value for Ta, β 0.5 Elite count 2 Generations 2000 Population size 50 Stopping criteria (Time limit) n m 0.5 seconds Selection function Roulette wheel Crossover function Order Mutation function Reciprocal Exchange Mutation fraction 0.2 Crossover fraction 0.8 Pareto fraction 0.35 Migration interval
6 5. Results & Discussions In the present work, Genetic A lgorithms (GAs) have been developed for Bi-criteria fitness function including weighted sum of total weighted tardiness & makespan for SDST flow shop scheduling. The analysis of all the algorithms implemented has been carried out using the instances (DD_SDST_125) developed by Taillard (1993) upto 200 jobs and 20 machines under SDST environment with due dates and weights allotted to each job. In the considered instances, SDST varies from 0 to 125. The instances considered has been divided into three categories as 5, 10 and 20 machine problems for analyzing the results with deviation of machines together with increase o f jobs. All the experimental tests are conducted on system configuration of THINKPAD R61i- INTEL CORE 2 DUO CPU RAM 1.99GHz, 3GB. Stopping limit of different GAs has been fixed to computational time limit i.e n m 0.5 seconds. Relative percentage deviation (RPD) (Naderi et. al., 2009) has been used for analyzing the performance which has been calculated as:- Where Mean solution is the solution obtained by Algorithm and Best solution is the best (minimum) solution obtained among all the GAs for particular problem. Best solution can be found out between the results obtained by running a particular algorithm five times for a particular problem and mean solution is the final average solution given by the algorithm for all the five runs. RPD near to zero gives the best results. 110 different Taillard (1993) benchmark problems have been solved for analyzing the results, which comprises different combinations of 20, 50, 100 and 200 jobs being processed on 5, 10 and 20 machines. Each combination of different machines and jobs has 10 different set of problems. After finding the RPD for 10 different set of problems of a particular combination their mean is also calculated called Average Relative Percentage Deviation (). In the present work both the performance measures have been given equal importance in the proposed fitness function. JOB SIZE Figure 5.1 for different GAs for 5 machine problems 488
7 JOB SIZE Figure 5.2 for different GAs for 10 machine problems JOB SIZE Figure 5.3 for different GAs for 20 machine problems 489
8 MACHINE SIZE Figure 5.4 for different GAs for 20 job problems MACHINE SIZE Figure 5.5 for different GAs for 50 job problems 490
9 MACHINE SIZE Figure 5.6 for different GAs for 100 job problems MACHINE SIZE Figure 5.7 for different GAs for 200 job problems Fig. 5.1 to 5.3 shows for 5, 10 and 20 machine problems and it is clear that GA 3 produce better results for different problem size. It can be seen from table 5.1 that for 5 machines, GA 3 presents improved results over other GAs for 20, 50 and 100 job problems with of 15.16%, 5.32% and 5.28% respectively. For 10 machines, GA 2 with of 15.16% shows better results for 20 job problems and GA 4 with of 22.67% shows improved results for 50 job problems. Whether for
10 and 200 job problems, GA 3 with of 2.22% and 10.67% shows improved results over other GAs. Also for 20 machines, GA 3 with of 14.52%, 10.98% and 2.78% shows improved results over others for 20, 50 and 200 job problems respectively. While for 100 job problem GA 1 with of 8.60% shows improved results. Table 1.3: for different GAs for different machine problems. Machines Jobs GA 1 GA 2 GA 3 GA 4 GA Hence, from the analysis it has been concluded that performance of proposed GAs vary with the size of machines and jobs as GA 3 shows better results over other proposed GAs for all the three machine problems viz. 5,10 and 20 machines. Table 1.4: for different GAs for different job problems. Jobs Machines GA 1 GA 2 GA 3 GA 4 GA Fig. 5.4 to 5.7 shows for 20, 50, 100 and 200 job problems and it is clear that GA 3 produce better results over others for different problem size. 492
11 It can be seen from table 5.2 that for 20 jobs, GA 3 presents improved results over other GAs for 5 and 20 machine problems with of 15.16%, and 14.52% respectively. While for 10 machine problem GA 2 with of 15.63% shows better results. For 50 jobs, GA 3 with of 5.32% and 10.98% shows improved results for 5 and 20 machine problems. While for 10 machine problem GA 4 with of 22.67% shows improved results. For 100 jobs, GA 3 with of 5.28% and 2.22% for 5 and 10 machine problems shows improved results over other GAs. As the machine size increased to 20 machines, GA 1 with of 8.60% shows better result. Also for 200 jobs, GA 3 with of 10.67% and 2.78% shows improved results over others for 10 and 20 machine problems respectively. Hence, from the analysis it has been concluded that performance of proposed GAs vary with the size of jobs and machines as GA 3 shows better results over other proposed GAs for all the four job problems viz. 20, 50,100 and 200 jobs. 6. Conclusion & Future Scope of work Bi-criteria fitness function proposed for scheduling the jobs in SDST flow shop proves to be efficient and flexible for minimizing the due date and completion time related performance measures. From the comparative analysis among different GAs considered, it has been found that the performance of algorithm varies with the size of job and machines. Amongst the five different GAs, it has been concluded that GA 3 shows better results over other for all the problems considered upto 200 jobs and 20 machines including sequence dependent set up time. The work has been restricted to Bi-criteria SDST flow shop scheduling only and several other performance measures apart from stated one s also exists, so presented work can be extended by focusing other performance measures also. Also, work has been restricted to flow shop scheduling problems only and the research can also be done with other scheduling environments. Work has been restricted to equal weight values for both the objective function and it may be extended for other weighted values. REFERENCES 1. Blazewicz, J., Lenstra, J.K., and Rinnooy Kan, A.H.G., Scheduling subject to resource constraints: classification and complexity. Discrete Applied Mathematics 5, pp Gowrisankar K., Chandrasekharan, R., and Srinivasan, G., Flow shop scheduling algorithm for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date. Europeon Journal of Operation Research 132, pp Gupta, J.N.D., Venkata, G., Neppalli, R., and Werner, F., Minimizing total flow time in a two-machine flowshop problem with minimum makespan. International Journal of Production Economics 69, pp Kim, Y.D., A new branch and bound algorithm for minimizing mean tardiness in 2- machine flow shops. Computers and Operations Research 20, pp
12 5. Naderi, B., Zandieh, M., Balagh, A. K. G., and Roshanaei, V., An improved simulated annealing for hybrid flow shops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Systems with Application 36, pp Nawaz M., Enscore E., and Ham I., A heuristic algorithm for the m-machine n-job flow shop sequencing problem. Omega 11, Parathasarthy, S. and Rajendran, C., A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flow shop with sequence dependent setup times of jobs-a case study. Production Planning and Control 8, pp Ponnambalam, S G., Jagannathan, H., Kataria M, and Gadicherla, A., A TSP-GA multi-objective algorithm for flow shop scheduling. International Journal of Advance Manufacturing Technology 23, pp Rahimi-Vahed, R., Mirghorbani, S M., A multi-objective particle swarm for a flow shop scheduling problem. Combinatorial Optimisation 13, pp Rajendran, C., Theory and methodology heuristics for scheduling in flow shop with multiple objectives. Europeon Journal of Operation Research 82, pp Ravindran, D., Noorul Haq, A., Selvakuar, S J., and Sivaraman, R., Flow shop scheduling with multiple objective of minimizing makespan and total flow time. International Journal of Advance Manufacturing Technology 25, pp Sayin, S., and Karabati, S., A bicriteria approach to the two-machine flow shop scheduling problem. European Journal of Operation Research 113, pp Taillard, E., Benchmarks of basic scheduling problems. European Journal of Operation Research 64, pp Eren, T., and Guner, E., A bicriteria parallel machine scheduling with a learning effect. International Journal of Advance Manufacturing Technology 40, pp
A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEUDULING
A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEUDULING PROF. SARVADE KISHORI D. Computer Science and Engineering,SVERI S College Of Engineering Pandharpur,Pandharpur,India KALSHETTY Y.R. Assistant Professor
More informationAn Evolutionary Solution to a Multi-objective Scheduling Problem
, June 30 - July 2,, London, U.K. An Evolutionary Solution to a Multi-objective Scheduling Problem Sumeyye Samur, Serol Bulkan Abstract Multi-objective problems have been attractive for most researchers
More informationA Tabu Search for the Permutation Flow Shop Problem with Sequence Dependent Setup Times
A Tabu Search for the Permutation Flow Shop Problem with Sequence Dependent Setup Times Nicolau Santos, nicolau.santos@dcc.fc.up.pt Faculdade de Ciências, Universidade do Porto; INESC Porto João Pedro
More informationMinimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA
, June 30 - July 2, 2010, London, U.K. Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA Imran Ali Chaudhry, Sultan Mahmood and Riaz
More informationCHAPTER 4 PROPOSED HYBRID INTELLIGENT APPROCH FOR MULTIPROCESSOR SCHEDULING
79 CHAPTER 4 PROPOSED HYBRID INTELLIGENT APPROCH FOR MULTIPROCESSOR SCHEDULING The present chapter proposes a hybrid intelligent approach (IPSO-AIS) using Improved Particle Swarm Optimization (IPSO) with
More informationII. PROBLEM FORMULATION
A REVIEW OF HEURISTICS FOR PERMUTATION FLOW SHOPS AND FLOW SHOPS WITH SEQUENCE DEPENDENT SETUP TIMES Anoop A. K. 1, Dr. Rajesh Vanchipura 2 1 M. Tech, Dept. of Mechanical Engineering, Govt. Engineering
More informationSELECTED HEURISTIC ALGORITHMS FOR SOLVING JOB SHOP AND FLOW SHOP SCHEDULING PROBLEMS
SELECTED HEURISTIC ALGORITHMS FOR SOLVING JOB SHOP AND FLOW SHOP SCHEDULING PROBLEMS A THESIS SUBMITTED IN PARTIAL FULFILLMENT FOR THE REQUIREMENT OF THE DEGREE OF BACHELOR OF TECHNOLOGY IN MECHANICAL
More informationCOMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO
COMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO Bathrinath S. 1, Saravanasankar S. 1 and Ponnambalam SG. 2 1 Department of Mechanical Engineering, Kalasalingam
More informationReducibility of Some Multi Criteria Scheduling Problems to Bicriteria Scheduling Problems.
Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 2014 Reducibility of Some Multi Criteria Scheduling Problems to Bicriteria
More informationPARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM
PARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM Dr.V.Selvi Assistant Professor, Department of Computer Science Mother Teresa women s University Kodaikanal. Tamilnadu,India. Abstract -
More informationInternational Journal of Industrial Engineering Computations
International Journal of Industrial Engineering Computations 6 (2015) 173 184 Contents lists available at GrowingScience International Journal of Industrial Engineering Computations homepage: www.growingscience.com/ijiec
More informationHybrid search method for integrated scheduling problem of container-handling systems
Hybrid search method for integrated scheduling problem of container-handling systems Feifei Cui School of Computer Science and Engineering, Southeast University, Nanjing, P. R. China Jatinder N. D. Gupta
More informationICMIEE-PI Minimization of Makespan in Flow Shop Scheduling Using Heuristics
International Conference on Mechanical, Industrial and Energy Engineering 2014 25-26 December, 2014, Khulna, BANGLADESH ICMIEE-PI-14016310 000 Minimization of Makespan in Flow Shop Scheduling Using Heuristics
More informationA new constructive heuristic for the Fm block T
A new constructive heuristic for the Fm block T Companys R 1,Ribas I 2 Abstract This paper deals with the blocking flow shop problem and proposes new constructive procedures for the total tardiness minimization
More informationEvolutionary Computation for Minimizing Makespan on Identical Machines with Mold Constraints
Evolutionary Computation for Minimizing Makespan on Identical Machines with Mold Constraints Tzung-Pei Hong 1, 2, Pei-Chen Sun 3, and Sheng-Shin Jou 3 1 Department of Computer Science and Information Engineering
More informationGenerational and steady state genetic algorithms for generator maintenance scheduling problems
Generational and steady state genetic algorithms for generator maintenance scheduling problems Item Type Conference paper Authors Dahal, Keshav P.; McDonald, J.R. Citation Dahal, K. P. and McDonald, J.
More informationWorkload balancing in identical parallel machine scheduling using a mathematical programming method
International Journal of Computational Intelligence Systems, Vol. 7, Supplement 1 (2014), 58-67 Workload balancing in identical parallel machine scheduling using a mathematical programming method Yassine
More informationA HYBRID ALGORITHM TO MINIMIZE THE NUMBER OF TARDY JOBS IN SINGLE MACHINE SCHEDULING
DAAAM INTERNATIONAL SCIENTIFIC BOOK 2010 pp. 549-558 CHAPTER 48 A HYBRID ALGORITHM TO MINIMIZE THE NUMBER OF TARDY JOBS IN SINGLE MACHINE SCHEDULING BANCILA, D.; BUZATU, C. & FOTA, A. Abstract: Starting
More informationFlowshop Scheduling Problem for 10-Jobs, 10-Machines By Heuristics Models Using Makespan Criterion
Flowshop Scheduling Problem for 10-Jobs, 10-Machines By Heuristics Models Using Makespan Criterion Ajay Kumar Agarwal Assistant Professor, Mechanical Engineering Department RIMT, Chidana, Sonipat, Haryana,
More informationJournal of Global Research in Computer Science PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING PROBLEM
Volume, No. 5, December 00 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING
More informationSolving the Reentrant Permutation Flow-Shop Scheduling Problem with a Hybrid Genetic Algorithm
International Journal of Industrial Engineering, 16(1), 23-31, 2009. Solving the Reentrant Permutation Flow-Shop Scheduling Problem with a Hybrid Genetic Algorithm Jen-Shiang Chen 1, Jason Chao-Hsien Pan
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 informationINTEGRATED PROCESS PLANNING AND SCHEDULING WITH SETUP TIME CONSIDERATION BY ANT COLONY OPTIMIZATION
Proceedings of the 1st International Conference on Computers & Industrial Engineering INTEGRATED PROCESS PLANNING AND SCHEDULING WITH SETUP TIME CONSIDERATION BY ANT COLONY OPTIMIZATION S.Y. Wan, T.N.
More informationSCHEDULING AND CONTROLLING PRODUCTION ACTIVITIES
SCHEDULING AND CONTROLLING PRODUCTION ACTIVITIES Al-Naimi Assistant Professor Industrial Engineering Branch Department of Production Engineering and Metallurgy University of Technology Baghdad - Iraq dr.mahmoudalnaimi@uotechnology.edu.iq
More informationOptimizing Dynamic Flexible Job Shop Scheduling Problem Based on Genetic Algorithm
International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2017 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Optimizing
More informationInternational Journal of Engineering, Business and Enterprise Applications (IJEBEA)
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Engineering, Business and Enterprise
More informationStorage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach
Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach Z.X. Wang, Felix T.S. Chan, and S.H. Chung Abstract Storage allocation and yard trucks scheduling
More informationContents PREFACE 1 INTRODUCTION The Role of Scheduling The Scheduling Function in an Enterprise Outline of the Book 6
Integre Technical Publishing Co., Inc. Pinedo July 9, 2001 4:31 p.m. front page v PREFACE xi 1 INTRODUCTION 1 1.1 The Role of Scheduling 1 1.2 The Scheduling Function in an Enterprise 4 1.3 Outline of
More informationProcessor Scheduling Algorithms in Environment of Genetics
Processor Scheduling Algorithms in Environment of Genetics Randeep Department of Computer Science and Engineering R.N. College of Engg. & Technology Haryana, India randeepravish@gmail.com Abstract The
More informationAnalysis and Modelling of Flexible Manufacturing System
Analysis and Modelling of Flexible Manufacturing System Swetapadma Mishra 1, Biswabihari Rath 2, Aravind Tripathy 3 1,2,3Gandhi Institute For Technology,Bhubaneswar, Odisha, India --------------------------------------------------------------------***----------------------------------------------------------------------
More informationISE480 Sequencing and Scheduling
ISE480 Sequencing and Scheduling INTRODUCTION ISE480 Sequencing and Scheduling 2012 2013 Spring term What is Scheduling About? Planning (deciding what to do) and scheduling (setting an order and time for
More information* Keywords: Single batch-processing machine, Simulated annealing, Sterilization operation, Scheduling.
2016 International Conference on Artificial Intelligence and Computer Science (AICS 2016) ISBN: 978-1-60595-411-0 A Bi-criterion Simulated Annealing Method for a Single Batch-processing Machine Scheduling
More informationModeling and Optimisation of Precedence-Constrained Production Sequencing and Scheduling for Multiple Production Lines Using Genetic Algorithms
Computer Technology and Application 2 (2011) 487-499 Modeling and Optimisation of Precedence-Constrained Production Sequencing and Scheduling for Multiple Production Lines Using Genetic Algorithms Son
More informationMetaheuristics. Approximate. Metaheuristics used for. Math programming LP, IP, NLP, DP. Heuristics
Metaheuristics Meta Greek word for upper level methods Heuristics Greek word heuriskein art of discovering new strategies to solve problems. Exact and Approximate methods Exact Math programming LP, IP,
More informationUse of Genetic Algorithms in Discrete Optimalization Problems
Use of Genetic Algorithms in Discrete Optimalization Problems Alena Rybičková supervisor: Ing. Denisa Mocková PhD Faculty of Transportation Sciences Main goals: design of genetic algorithm for vehicle
More informationMass Customized Large Scale Production System with Learning Curve Consideration
Mass Customized Large Scale Production System with Learning Curve Consideration KuoWei Chen and Richard Lee Storch Industrial & Systems Engineering, University of Washington, Seattle, U.S.A {kwc206,rlstorch}@uw.edu
More informationSimulation approaches for optimization in business and service systems
Simulation approaches for optimization in business and service systems Imed Kacem kacem@univ-metz.fr Professor - Université Paul Verlaine Metz http://kacem.imed.perso.neuf.fr/site/ FUBUTEC 2, Future Business
More informationA HYBRID ALGORITHM FOR MULTIPROCESSOR SCHEDULING
Volume 118 No. 20 2018, 3149-3155 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu A HYBRID ALGORITHM FOR MULTIPROCESSOR SCHEDULING R.Vijay Sai, M.Lavanya, B.Srinivasan School of Computing,
More informationIntegration of Process Planning and Job Shop Scheduling Using Genetic Algorithm
Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization, Lisbon, Portugal, September 22-24, 2006 1 Integration of Process Planning and Job Shop Scheduling Using
More informationJOB SHOP SCHEDULING TO MINIMIZE WORK-IN-PROCESS, EARLINESS AND TARDINESS COSTS ZHU ZHECHENG A THESIS SUBMITTED FOR THE DEGREE OF DOCTOR OF PHILOSOPHY
JOB SHOP SCHEDULING TO MINIMIZE WORK-IN-PROCESS, EARLINESS AND TARDINESS COSTS ZHU ZHECHENG A THESIS SUBMITTED FOR THE DEGREE OF DOCTOR OF PHILOSOPHY DEPARTMENT OF INDUSTRIAL AND SYSTEMS ENGINEERING NATIONAL
More informationLOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS
Advances in Production Engineering & Management 4 (2009) 3, 127-138 ISSN 1854-6250 Scientific paper LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS Ahmad, I. * & Al-aney, K.I.M. ** *Department
More informationA Tabu Genetic algorithm with Search Area Adaptation for the Job-Shop Scheduling Problem
Proceedings of the 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases, Corfu Island, Greece, February 16-19, 2007 76 A Tabu Genetic algorithm with Search Area Adaptation
More informationMachine Learning Approaches for Flow Shop Scheduling Problems with Alternative Resources, Sequence-dependent Setup Times and Blocking
Machine Learning Approaches for Flow Shop Scheduling Problems with Alternative Resources, Sequence-dependent Setup Times and Blocking Frank Benda 1, Roland Braune 2, Karl F. Doerner 2 Richard F. Hartl
More informationIntroduction to Artificial Intelligence. Prof. Inkyu Moon Dept. of Robotics Engineering, DGIST
Introduction to Artificial Intelligence Prof. Inkyu Moon Dept. of Robotics Engineering, DGIST Chapter 9 Evolutionary Computation Introduction Intelligence can be defined as the capability of a system to
More informationIMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM
IMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM TWINKLE GUPTA* Department of Computer Science, Hindu Kanya MahaVidyalya, Jind, India Abstract We are encountered with various optimization
More informationA Simulation-based Multi-level Redundancy Allocation for a Multi-level System
International Journal of Performability Engineering Vol., No. 4, July 205, pp. 357-367. RAMS Consultants Printed in India A Simulation-based Multi-level Redundancy Allocation for a Multi-level System YOUNG
More informationA Discrete Constrained Optimization Using Genetic Algorithms for A Bookstore Layout
International Journal of Computational Intelligence Systems, Vol. 6, No. 2 (March, 2013), 261-278 A Discrete Constrained Optimization Using Genetic Algorithms for A Bookstore Layout Tuncay Ozcan * Department
More informationResearch Article A New Method Based on Multi Agent System and Artificial Immune System for Systematic Maintenance
Research Journal of Applied Sciences, Engineering and Technology 7(9): 4008-407, 204 DOI:0.9026/rjaset.7.762 ISSN: 2040-7459; e-issn: 2040-7467 204 Maxwell Scientific Publication Corp. Submitted: November
More informationLearning Objectives. Scheduling. Learning Objectives
Scheduling 16 Learning Objectives Explain what scheduling involves and the importance of good scheduling. Discuss scheduling needs in high-volume and intermediate-volume systems. Discuss scheduling needs
More informationA Characteristic Study of Exponential Distribution Technique in a Flowshop using Taillard Benchmark Problems
Proceedings of the Pakistan Academy of Sciences 51 (3): 187 192 (2014) Copyright Pakistan Academy of Sciences ISSN: 0377-2969 (print), 2306-1448 (online) Pakistan Academy of Sciences Research Article A
More informationDeveloping a hybrid algorithm for distribution network design problem
Proceedings of the 2011 International Conference on Industrial Engineering and Operations Management Kuala Lumpur, Malaysia, January 22 24, 2011 Developing a hybrid algorithm for distribution network design
More informationGENETIC ALGORITHMS. Narra Priyanka. K.Naga Sowjanya. Vasavi College of Engineering. Ibrahimbahg,Hyderabad.
GENETIC ALGORITHMS Narra Priyanka K.Naga Sowjanya Vasavi College of Engineering. Ibrahimbahg,Hyderabad mynameissowji@yahoo.com priyankanarra@yahoo.com Abstract Genetic algorithms are a part of evolutionary
More informationApplying Bee Colony Optimization Heuristic for Make-Pack Problem in Process Manufacturing
Applying Bee Colony Optimization Heuristic for Make-Pack Problem in Process Manufacturing W. Wongthatsanekorn, B. Phruksaphanrat, and R.Sangkhasuk* Abstract This paper presents an application of Bee Colony
More informationAvailable online at International Journal of Current Research Vol. 9, Issue, 07, pp , July, 2017
z Available online at http://www.journalcra.com International Journal of Current Research Vol. 9, Issue, 07, pp.53529-53533, July, 2017 INTERNATIONAL JOURNAL OF CURRENT RESEARCH ISSN: 0975-833X RESEARCH
More informationASPECT OF SELECTIVE REROUTING IN MULTICRITERIA SCHEDULING OF FLEXIBLE MANUFACTURING
ISSN 1726-4529 Int j simul model 9 (2010) 3, 131-142 Original scientific paper ASPECT OF SELECTIVE REROUTING IN MULTICRITERIA SCHEDULING OF FLEXIBLE MANUFACTURING Singh, A. Gautam Buddha University, Greater
More informationAutomatic Design of Scheduling Policies for Dynamic Multi-objective Job Shop Scheduling via Cooperative Coevolution Genetic Programming
Automatic Design of Scheduling Policies for Dynamic Multi-objective Job Shop Scheduling via Cooperative Coevolution Genetic Programming Su Nguyen 1, Mengjie Zhang 1, Mark Johnston 2, Kay Chen Tan 3 1 Victoria
More informationSingle Machine Scheduling with Interfering Job Sets
Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 009) 0- August 009, Dublin, Ireland MISTA 009 Single Machine Scheduling with Interfering Job Sets Ketan Khowala,
More informationInventory Lot Sizing with Supplier Selection
Inventory Lot Sizing with Supplier Selection Chuda Basnet Department of Management Systems The University of Waikato, Private Bag 315 Hamilton, New Zealand chuda@waikato.ac.nz Janny M.Y. Leung Department
More informationSurekha P 1, S.Sumathi 2
Solving Fuzzy based Job Shop Scheduling Problems using Ga and Aco Surekha P 1, S.Sumathi 2 1 Research Scholar, EEE, PSG College of Technology, Coimbatore 2 Asst. Professor, EEE, PSG College of Technology,
More informationIJSOM November 2015, Volume 2, Issue 3, pp
International Journal of Supply and Operations Management IJSOM November 2015, Volume 2, Issue 3, pp. 871-887 ISSN-Print: 2383-1359 ISSN-Online: 2383-2525 www.ijsom.com A Flexible Job Shop Scheduling Problem
More informationA GENETIC ALGORITHM APPROACH FOR OPTIMIZING CHEMICAL TOWERS CONSTRUCTION PROJECT SCHEDULING WITH DYNAMIC RESOURCES CONSTRAINTS
International Journal of Industrial Engineering, 17(2), 128-141, 2010. A GENETIC ALGORITHM APPROACH FOR OPTIMIZING CHEMICAL TOWERS CONSTRUCTION PROJECT SCHEDULING WITH DYNAMIC RESOURCES CONSTRAINTS Chun-Wei
More informationEvolutionary Algorithms
Evolutionary Algorithms Evolutionary Algorithms What is Evolutionary Algorithms (EAs)? Evolutionary algorithms are iterative and stochastic search methods that mimic the natural biological evolution and/or
More informationA Variable Capacity Parallel Machine Scheduling Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Variable Capacity Parallel Machine Scheduling Problem Emine Akyol
More informationMulti-Period Cell Loading in Cellular Manufacturing Systems
Proceedings of the 202 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 202 Multi-Period Cell Loading in Cellular Manufacturing Systems Gökhan Eğilmez
More informationThe University of Bradford Institutional Repository
The University of Bradford Institutional Repository http://bradscholars.brad.ac.uk This work is made available online in accordance with publisher policies. Please refer to the repository record for this
More informationGenetic Algorithm: An Optimization Technique Concept
Genetic Algorithm: An Optimization Technique Concept 1 Uma Anand, 2 Chain Singh 1 Student M.Tech (3 rd sem) Department of Computer Science Engineering Dronacharya College of Engineering, Gurgaon-123506,
More informationOperations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 24 Sequencing and Scheduling - Assumptions, Objectives and Shop
More informationPart 1: Motivation, Basic Concepts, Algorithms
Part 1: Motivation, Basic Concepts, Algorithms 1 Review of Biological Evolution Evolution is a long time scale process that changes a population of an organism by generating better offspring through reproduction.
More informationModels in Engineering Glossary
Models in Engineering Glossary Anchoring bias is the tendency to use an initial piece of information to make subsequent judgments. Once an anchor is set, there is a bias toward interpreting other information
More informationFlowshop scheduling with respect to transport time, break-time and weight of jobs using Nawaz, Enscor and Ham (NEH) methods
Available online at www.worldscientificnews.com WSN 102 (2018) 180-187 EISSN 2392-2192 SHORT COMMUNICATION Flowshop scheduling with respect to transport time, break-time and weight of jobs using Nawaz,
More informationNEW DISPATCHING RULES FOR SCHEDULING IN A JOB SHOP - AN EXPERIMENTAL STUDY
NEW DISPATCHING RULES FOR SCHEDULING IN A JOB SHOP - AN EXPERIMENTAL STUDY Oliver Holthaus Faculty of Business Administration and Economics Department of Production Management University of Passau Dr.-Hans-Kapfinger
More informationOptimal Operator Assignment In An Assembly Line Using Genetic Algorithm
Optimal Operator Assignment in an Assembly Line using Genetic Algorithm 1 Optimal Operator Assignment In An Assembly Line Using Genetic Algorithm TANZINA ZAMAN, SANJOY KUMAR PAUL* AND ABDULLAHIL AZEEM
More informationMINIMIZING MEAN COMPLETION TIME IN FLOWSHOPS WITH RANDOM PROCESSING TIMES
8 th International Conference of Modeling and Simulation - MOSIM 0 - May 0-, 00 - Hammamet - Tunisia Evaluation and optimization of innovative production systems of goods and services MINIMIZING MEAN COMPLETION
More informationEach copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.
A New Heuristic Method for the Permutation Flow Shop Scheduling Problem Author(s): Joao Vitor Moccellin Source: The Journal of the Operational Research Society, Vol. 46, No. 7 (Jul., 1995), pp. 883-886
More informationON IMPROVING OPERATIONS SCHEDULING IN ELECTRONICS MANUFACTURING
ON IMPROVING OPERATIONS SCHEDULING IN ELECTRONICS MANUFACTURING Daryl L. Santos, Ph.D. Systems Science and Industrial Engineering Department Small Scale Systems Integration and Packaging (S 3 IP) A NYS
More informationIn collaboration with Jean-Yves Lucas (EDF)
In collaboration with Jean-Yves Lucas (EDF) Table of Contents 1. Introduction 2. Related works 3. Mathematical Model 4. Multi-objective Evolutionary Algorithm 5. Input Data & Experimental results 6. Conclusions
More informationCHAPTER 3 RESEARCH METHODOLOGY
72 CHAPTER 3 RESEARCH METHODOLOGY Inventory management is considered to be an important field in Supply chain management. Once the efficient and effective management of inventory is carried out throughout
More informationGlobal Logistics Road Planning: A Genetic Algorithm Approach
The Sixth International Symposium on Operations Research and Its Applications (ISORA 06) Xinjiang, China, August 8 12, 2006 Copyright 2006 ORSC & APORC pp. 75 81 Global Logistics Road Planning: A Genetic
More informationJOB SHOP SCHEDULING WITH EARLINESS, TARDINESS AND INTERMEDIATE INVENTORY HOLDING COSTS
JOB SHOP SCHEDULING WITH EARLINESS, TARDINESS AND INTERMEDIATE INVENTORY HOLDING COSTS Kerem Bulbul Manufacturing Systems and Industrial Engineering, Sabanci University, Istanbul, Turkey bulbul@sabanciuniv.edu
More informationMODELING, OPTIMISATION AND ANALYSIS OF RE-ENTRANT FLOWSHOP JOB SCHEDULING WITH FUZZY PROCESSING TIMES
Nigerian Journal of Technology (NIJOTECH) Vol. 36, No. 3, July 2017, pp. 806 813 Copyright Faculty of Engineering, University of Nigeria, Nsukka, Print ISSN: 0331-8443, Electronic ISSN: 2467-8821 www.nijotech.com
More informationAPPENDIX 1 Processing time (pij) Release date (rj) Due date (dj): Weight (wj)
172 APPENDIX 1 In all the scheduling problems considered the number of jobs and the number of machines are assumed to be finite. The number of jobs is denoted by N and the number of machines by M. usually,
More informationIncluding workers with disabilities in flow shop scheduling
Including workers with disabilities in flow shop scheduling Germano C. Carniel 1 and Alexander J. Benavides 1 and Marcus Ritt 1 and Cristóbal Miralles 2 Abstract Persons with disabilities have severe problems
More informationThe Metaphor. Individuals living in that environment Individual s degree of adaptation to its surrounding environment
Genetic Algorithms Sesi 14 Optimization Techniques Mathematical Programming Network Analysis Branch & Bound Simulated Annealing Tabu Search Classes of Search Techniques Calculus Base Techniqes Fibonacci
More informationStructured System Analysis Methodology for Developing a Production Planning Model
Structured System Analysis Methodology for Developing a Production Planning Model Mootaz M. Ghazy, Khaled S. El-Kilany, and M. Nashaat Fors Abstract Aggregate Production Planning (APP) is a medium term
More informationMulti-objective Evolutionary Optimization of Cloud Service Provider Selection Problems
Multi-objective Evolutionary Optimization of Cloud Service Provider Selection Problems Cheng-Yuan Lin Dept of Computer Science and Information Engineering Chung-Hua University Hsin-Chu, Taiwan m09902021@chu.edu.tw
More informationProcedia - Social and Behavioral Sciences 189 ( 2015 ) XVIII Annual International Conference of the Society of Operations Management (SOM-14)
Available online at www.sciencedirect.com ScienceDirect Procedia - Social and ehavioral Sciences 189 ( 2015 ) 184 192 XVIII Annual International Conference of the Society of Operations Management (SOM-14)
More informationDesigning High Thermal Conductive Materials Using Artificial Evolution MICHAEL DAVIES, BASKAR GANAPATHYSUBRAMANIAN, GANESH BALASUBRAMANIAN
Designing High Thermal Conductive Materials Using Artificial Evolution MICHAEL DAVIES, BASKAR GANAPATHYSUBRAMANIAN, GANESH BALASUBRAMANIAN The Problem Graphene is one of the most thermally conductive materials
More informationVISHVESHWARAIAH TECHNOLOGICAL UNIVERSITY S.D.M COLLEGE OF ENGINEERING AND TECHNOLOGY. A seminar report on GENETIC ALGORITHMS.
VISHVESHWARAIAH TECHNOLOGICAL UNIVERSITY S.D.M COLLEGE OF ENGINEERING AND TECHNOLOGY A seminar report on GENETIC ALGORITHMS Submitted by Pranesh S S 2SD06CS061 8 th semester DEPARTMENT OF COMPUTER SCIENCE
More information10. Lecture Stochastic Optimization
Soft Control (AT 3, RMA) 10. Lecture Stochastic Optimization Genetic Algorithms 10. Structure of the lecture 1. Soft control: the definition and limitations, basics of epert" systems 2. Knowledge representation
More informationCloud Load Balancing Based on ACO Algorithm
Cloud Load Balancing Based on ACO Algorithm Avtar Singh, Kamlesh Dutta, Himanshu Gupta Department of Computer Science, National Institute of Technology,Hamirpur, HP, India Department of Computer Science,
More informationA Hybrid Genetic Algorithm for Parallel Machine Scheduling at Semiconductor Back-End Production
Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018) A Hybrid Genetic Algorithm for Parallel Machine Scheduling at Semiconductor Back-End Production J. Adan, 1,2 A.
More informationGenetic Algorithms and Sensitivity Analysis in Production Planning Optimization
Genetic Algorithms and Sensitivity Analysis in Production Planning Optimization CECÍLIA REIS 1,2, LEONARDO PAIVA 2, JORGE MOUTINHO 2, VIRIATO M. MARQUES 1,3 1 GECAD Knowledge Engineering and Decision Support
More informationGeneral-purpose SPWA with the Class-type Skill by Genetic Algorithm
General-purpose SPWA with the Class-type Skill by Genetic Algorithm Daiki Takano Graduate School of Engineering, Maebashi Institute of Technology Email: futsal_ido_me_jp@yahoo.co.jp Kenichi Ida Graduate
More informationUniversity Question Paper Two Marks
University Question Paper Two Marks 1. List the application of Operations Research in functional areas of management. Answer: Finance, Budgeting and Investment Marketing Physical distribution Purchasing,
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 17: Genetic Algorithms and Evolutionary Computing Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/
More informationTIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS. Liviu Lalescu, Costin Badica
TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS Liviu Lalescu, Costin Badica University of Craiova, Faculty of Control, Computers and Electronics Software Engineering Department, str.tehnicii, 5, Craiova,
More informationNon-Identical Parallel Machine Scheduling with Sequence and Machine Dependent Setup Times Using Meta-Heuristic Algorithms
Industrial Engineering & Management Systems Vol 11, No 1, Mar 2012, pp.114-122 ISSN 1598-7248 EISSN 2234-6473 http://dx.doi.org/10.7232/iems.2012.11.1.114 2012 KIIE Non-Identical Parallel Machine Scheduling
More informationGenetic Algorithm for Supply Planning Optimization under Uncertain Demand
Genetic Algorithm for Supply Planning Optimization under Uncertain Demand Tezuka Masaru and Hiji Masahiro Hitachi Tohoku Software, Ltd. 2-16-10, Honcho, Aoba ward, Sendai City, 980-0014, Japan {tezuka,hiji}@hitachi-to.co.jp
More informationAn Effective Genetic Algorithm for Large-Scale Traveling Salesman Problems
An Effective Genetic Algorithm for Large-Scale Traveling Salesman Problems Son Duy Dao, Kazem Abhary, and Romeo Marian Abstract Traveling salesman problem (TSP) is an important optimization problem in
More informationImplementation of CSP Cross Over in Solving Travelling Salesman Problem Using Genetic Algorithms
Implementation of CSP Cross Over in Solving Travelling Salesman Problem Using Genetic Algorithms Karishma Mendiratta #1, Ankush Goyal *2 #1 M.Tech. Scholar, *2 Assistant Professor, Department of Computer
More information