Multi Objective Project Scheduling Under Resource Constraints Using Algorithm of Firefly
|
|
- Alannah Bennett
- 8 years ago
- Views:
Transcription
1 Jurnal UMP Social Sciences and Technology Management Vol. 3, Issue. 1,2015 Multi Objective Project Scheduling Under Resource Constraints Using Algorithm of Firefly Saeed Yaghoubi, School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran Meisam Jafari Eskandari, Department of Industrial Engineering, Payame Noor University, Tehran, Iran Meysam Farahmand Nazar Department of Industrial Engineering, Payame Noor University, Tehran, Iran Corresponding Author Abstract Products or services of any organization are developed in terms of project or operation way. For example, automotive companies produce as operative method and construction companies work in project method. Half a century has passed since emergence and development of project management techniques, and in that time, a large part of efforts for promoting the concepts of project management is done for project schedule models development. In this paper, project scheduling problem is solved with limited resources (RCPSP) modeling and meta-heuristic algorithm of Firefly worm and the results were compared with NSGA-II algorithm, the results show strong performance of this algorithm in solving proposed problems of RCPSP and multiobjective RCPSP. Key words: project scheduling, resource constraints, the algorithm of Firefly, NSGA II algorithm Introduction Products or services of any organization are developed in terms of project or operation way. For example, automotive companies produce as operative method and construction companies work in project method. Today's competitive world features cause that even organizations that reach their products (services) in operation method, also need to do numerous projects in their organizations. This is due to the competitive needs for defining new projects in the field of designing new products, cost reduction initiatives, and plans to change production lines and more. Half a century has passed since emergence and development of project management techniques, and in that time, a large part of efforts for promoting the concepts of project management is done for project schedule models development. Purpose of timing a project is to determine the time of doing different activities of the project during its implementation and it is related to decision-making process in which one or more targets are optimized. In this paper, project scheduling problem is solved with limited resources (RCPSP) modeling and with meta-heuristic algorithm of Firefly. Statement of the problem and literature Resource constrained project scheduling problem (RCPSP) consists of activities that should be taking into account the limitations of resources and also limitation of timing transposition, as project completion time will be minimal. This problem in concept of project scheduling is considered a standard concept that has attracted many researchers attention. So this problem is considered a fairly basic issue that for many practical applications can be used with restrictions, and, on the other side, the problem of RCPSP has been developed from various angles. In this study, we have tried to review some of these efforts in the field of modeling and also generalizations made in certain areas in this issue and main issues of them are described. On the issue of project scheduling it is tried that an optimized timing of activities provided, for this reason, considering target functions the modeling is done. Also a prerequisite relationship among activities is one of the main limitations of this issue. Project scheduling problem is generally based on three factors are divided into activities, resources and objective function. From the perspective of activities, project scheduling problem with different scenarios are based on prerequisite activities of one or multiple performance states. RCPSP is a particular combination optimization problem that is defined by multiple (V, 347
2 Multi Objective Project Scheduling p, E, R, B, b), where V is a set of activities, p is a vector of time, E is a set of transposition relationships, R is a set of available resources, B is a vector of the access to resources and b is a matrix of demands. While project completion time minimization is almost most well-known objections, there are other targets depended on different time. Goals based on delay time, delay and early time is very important. Delay time of Lj is activity j, deviation and completion time difference Cj from due time of dj, so Lj = Cj-dj. Lateness is similar to delay time, with the difference that it cannot be negative E m a x { 0, d C } T m a x { 0, C d } j j j. Early time Ej is in contrast to the previous definition, and we have. Koolish [1], Natasemboon and Randhava [2] and Vyana and Pynho [3] have considered weighted lateness minimization.natasmboon and Randhava [1] have suggested completion time minimization of all works, while Ram and colleagues [4] have considered minimizing of total weighted completion time. Similarly, Nazareh and colleagues [5] studied time average minimization duration. Note that total completion time minimization and completion time average minimization are equivalent of each other. Custer and colleagues [6], in their article, reviewed rescheduling of difference. Ranjbar and colleagues [7] considered objective function that in which we follow resources weighted lateness fine cost. In this model it is assumed that reviewed recycled resources, machinery and equipment s are very expensive that are used in some projects and consequently they are not fully available over time of project. In addition, objectives based on NPV for multimode RCPSP (Varma and colleagues [11], Valigora [12], Seifi and colleagues [13]) resource investment problem (Najafi and Niaki [14]), RCPSP with minimum and maximum interval time (Neumann and Zimmerman [15]) have also been investigated. Iysmily and Ram [18] used objective function NPV in a problem with continuous activity times and resource capacities based on time.khosh Jahan et al. Considered their model goal to minimize net current value of lateness- earliness penalty charges. These researchers imagine a specific delivery date for any activity. The approach presented in this article could be applicable in on-time production problems, where an activity after or even before determined date of that will include fine. Model developed in this study have two important criterions in project management, these two criteria are project completion time minimization and resulted benefits maximization using NPV formula. The model developed is resolved by meta-heuristic approach. This approach is used for solving multi-objective problems. Proposed problem RCPSP This model consists of two objective functions. An objective function is used to decrease beginning time of last activity and objective function is to seek to maximize revenues from project, this revenue is calculated as net present value. The variables used in this study are as follows: is zero and one variable. If ith activity at tth time with mth method will be finished value is one otherwise the value is zero T is index related to the beginning of an activity that has two states the earliest time of activity end and the latest time of activity end T` time period when the dual source is charged at the beginning of that period i Index related to an activity M States of doing activities that each state has its own time and resources dim Time of ith activity with mth method lth unrecyclable source, total number of sources are l lth unrecyclable source required for ith activity that is done with mth method ith operating cash flow α Discount rate DD Representing project deadline that is twice the critical path Above variables represent indices and variables used in the model. The model is shown as below. ) 1( j j j ) 2( ( ) 843
3 Jurnal UMP Social Sciences and Technology Management Vol. 3, Issue.1,2015 ) 3( ) 4( S.t ( ) ) 5( ) 6( ) 7( { } Next the model is defined. This model is a two-objective question. In above model, first objective function (1) is to seek minimization of end activity start time, the more this value is minimized, and the more total end project is minimized. The second objective function (2) is to maximize the present value of cash flows. Each project has cash flow over its life time, this cash flow included inputs and outputs. Inputs are revenues and outputs are costs that will be shown by negative mark. In a project in some of the activities that deliverable goods are existed, revenue is resulted and in most activities a cost will be spent for work. In this objective function it is tried to maximize present value of these cash flows.limitation (3) states that any activity should be implemented; this activity is done in earliest or the latest time and by one existed method.limitation (4) is related to transposition restrictions, time of beginning one activity plus its run time must be smaller than the start time after that.limitation (5) is related to non-renewable resources. The consumer resources to carry out activities are used in different ways and should be less than the total amount of the resource. Once the non-renewable source is assigned to entire project, then duration of project, this amount will not be resupplied.limitation (6) ensures that the project is completed before the deadline.last limitation is related to decision variable.as mentioned, this model cannot be solved with conventional methods because of a NP-Hard problem; therefore, the meta-heuristic method is proposed to solve that. In the next section in connection with solving method used in this research and how to set parameters will be discussed and numerical results obtained by solving this problem are offered. Solving proposed model As stated earlier, due to being NP-Hard, these classes of issues are used from meta-heuristic algorithms that in this study Firefly algorithm used that is not used so far in the literature to solve these problems and it is another innovations for this study. To facilitate, in Firefly algorithm following three rules are considered: All fireflies are intersexes and attracted to each other regardless of their gender. Absorption intensity is proportional to the brightness of the fireflies. Thus, for two fireflies the one that have less intensity light is moving toward the one with greater brightness. If none are brighter than the other, they move randomly toward each other. The objective function is determined by the brightness of firefly in destination. Based on these three rules, basic steps of Firefly algorithm can be summarized in next page pseudo code. Light intensity and charm There are two important issues in the algorithm of Firefly, changing intensity of light and formulation of charm. For simplicity, we can always assume that the attractiveness of a firefly is determined with the light that shone.in the simplest case the light intensity is proportional to second power of inverse rule. In this equation is the intensity of the light source. Also, if we assume the intensity of light absorbed by the environment ᵧ, light intensity can be calculated with the opposite relationship: 843
4 Multi Objective Project Scheduling Figure 1. Pseudo-code of Firefly algorithms In this equation is the intensity of the light source. To avoid the problem of oneness 5 at r = 0 in expression combination impact of second power of inverse rule and environmental absorption can be estimated by Gaussian formula: ( ) Since attractiveness of the Fireflies is perceived proportional to the light intensity by adjacent Firefly, the attractiveness of a firefly is defined by the following equation: In this equation this formula: ( ) ( ) is the intensity of light in r = 0. Also, distance between the two Fireflies is determined by Finally, J firefly movement toward more attractive firefly is determined by the following formula: ( ) In this equation second expression is attractiveness and the third expression is a random motion that parameter α in which is a random number in the range of 0 to 1 and parameter is uniform distribution. Also we consider parameter b equal to 1.In this study, we offer an example in the context of a network and then provide model data using meta-heuristic methods to solve problems and theirs results are compared with each other. To evaluate the performance of Firefly algorithms results of different problems solving are compared with results of solving sorting genetic algorithm. Statistical analysis is used for this comparison. Desired example to solve As noted in this study the problem is solved by evaluating the effectiveness of the model and choosing the right solution. In this study, some issues as test problems are in operations that are used to solve and evaluate effectiveness of different solution methods. In this study, one problem is selected from these sets in order to evaluate model effectiveness. Sample problems in this site are generated based on PSPLIB software. Sample questions on this site are generated based on software RanGen. This information is shown in the following table: 853
5 Jurnal UMP Social Sciences and Technology Management Vol. 3, Issue.1,2015 Post- requirement Table 1 - prerequisite relationships of sample issues-an example is a prerequisite Sample problem pre requisite Number of postrequirement Number of doing states Activity number Procedure and the resources required for each method is as following table. In this study, problem sample 8 is used to evaluate the performance of fireflies algorithm. Below problem is number one that is in the context for example, other problems are in the annex. 853
6 Multi Objective Project Scheduling Table 2. - Sample issues Activity METHOD Time R N Cash Flow
7 Jurnal UMP Social Sciences and Technology Management Vol. 3, Issue.1,2015 Other information issues are presented in the appendix. In this study, 8 problem cases were solved and its results were analyzed. Genetic algorithm parameter setting and results of solution Here you have to set entering parameters for algorithm NSGAII. Test designing and Taguchi method are used to set the parameters. Parameters of this algorithm are as follows: npop: the initial population size - Pc: probability of intersection -Pm: probability of mutation occurrence - Maxit: maximum number of frequencies Factors table is as follows: Table 3 Genetic algorithm factors Parameter Symbol Levels npop A Pc B Pm C Maxit D For factor 4 in three levels Taguchi table is as follows: At this stage, to help each of the 9 tests of Taguchi with specified settings solving will be done for any level of test, MID index value is calculated This indicator is defined as follows: The average distance ideal from the ideal point (MID): Using this indicator, near distance between Pareto solutions and the ideal point of those responses are calculated. The relationship is as follows: ( ) ( ) In the above expression and are ideal points of objective function. N is the number of Pareto solutions, and and are first and second objective function per reply i. The less MID index is, the algorithm has higher priority because of generating responses with lower distance from ideal point. Using software MINITAB following conclusions can be made: N / S rate values are as following table from software MINITAB: S/N rate table for levels Also average values of MINITAB software according to different levels is as follows: Levels average table Above values graph is as follows: 858
8 Multi Objective Project Scheduling Figure 2 average factors graph Figure 3 S/N rate graph for different factors In the above diagram any level that has a greater S/N is selected, in this case values used in meta-heuristic algorithm in this study are as follows: Table 4 Optimized factor levels Optimum factor value Symbol Factor 80 A npop 0.99 B Pc 0.2 C Pm 50 D Maxit Now using these values that are set in the algorithm we solve the model. The method for answering a vector is values of zero and one. Representing response in this study is a vector of numbers zero and one. This vector is the case, for example, has become one of the components of the vector. This process can be represented as follows: The operators used in this algorithm: In this study two operators of the composition and mutation are used as follows. In composition operator, two single-point and multi-point methods are used whose description is stated in chapter two. For mutation operator, simple mutation or flip & flop mutation are used. In this operator, randomly a number between 1 and nvar is selected then related element in the reply vector is reviewed that if its value is zero then it will turn into one, and if the value is zero then it turns into one. Initial reply production: Initial reply production in this study is random. randi function is used for this that if range is defined for it as [0, 1], in this case, the numbers produced are zero and one. The number of generated nvar numbers is the number of decision variables. Selection: The roulette wheel is used for selection in this algorithm whose description is shown in chapter two.the number of iterations, the number of initial population, crossover rate and mutation rate are also determined using parameter setting that is expressed as follows. Results are expressed as follows using MATLAB software. Pareto frontier is displayed in the chart below for two objective functions as it is shown the increase of one cause to decrease the other: 854
9 Jurnal UMP Social Sciences and Technology Management Vol. 3, Issue.1,2015 Figure 4 - Pareto frontier diagram Changes in the net present value at each iteration as follows: Figure 5 - The NPV for any iteration Firefly algorithm Procedure of this algorithm is fully described in section 3. In this study we are to evaluate the performance of the algorithm.the results of solving model are shown in the following charts: Figure 6 - NPV changes chart for each iteration of the Fireflies Pareto frontier using Firefly approach is as follows: Figure 7 - Pareto frontier in Firefly approach Analysis and comparison of two algorithms results In this section, we review and analyze the output results of the algorithm. The statistical analysis is used for this and indeed we examine the issue that the results of which one of algorithms has produced better values. Two-sided t-test is used for this, but before doing we need to ensure normality of results distribution function: NSGAII results in a significant level of 0.95 have normal distribution. Kolomograph- Smirnov test is used for this. The results of MINITAB software is as follows: 855
10 Multi Objective Project Scheduling Figure 8 - Normality test results of NSGAII data Results for Firefly algorithm outputs as follows: Figure 9 - The results of Fireflies data normality The significance level is more than 0.05 in both of them; therefore output results of both algorithms follow a normal distribution. Now we express the hypothesis. Here it is assumed that the average current value resulted from algorithm solution NSGAII is equal to Firefly algorithm. Mutual t test hypothesis is used for this. In fact, hypothesis test is as follows: The results of this test are as follows: Difference = mu (NSGAII) - mu (FA) Estimate for difference: % lower bound for difference: T-Test of difference = 0 (vs >): T-Value = 6.13 P-Value = DF = 73 The results of this test is lead to reject the null hypothesis, meaning that the average NPV resulted from NSGAII is greater than these values in the FA that reflects the efficiency of the algorithm in this problem. Hypothesis test in connection with the completion of the project as second objective function is as follows. It is expected that the average point time on the efficient frontier in algorithm NSGAII will be a smaller algorithm of FA. The results are as follows: Difference = mu (NSGAII) - mu (FA) Estimate for difference: % upper bound for difference: 0.79 T-Test of difference = 0 (vs <): T-Value = P-Value = DF = 96 Using data of a problem, we cannot conclude that algorithms are reviewed for various problems and their results are in the table below. Next, the results of this study are presented for problem 8: 853
11 Jurnal UMP Social Sciences and Technology Management Vol. 3, Issue.1,2015 P. n Average time of Pareto answer (ti me objective function) using an algorithm NSGAII Average NP V Pareto replies using algorithm NSGAII Table 5. Results of samples problems solving Average Average NP Runtime Run time of V Pareto - Pareto replies NSGA tim replies(tim using II e FA e objective algorithm function) FA using an algorithm F A Statistic al test P- Valu e Top algorith m NSGAII NSGAII FA FA NSGAII NSGAII NSGAII NSGAII Conclusion In most researches in this context that was expressed in detail in previous section, focus is on one special kind of resources, but in this study in addition to resources considered. Activities are considered multi states that doing them is possible in several methods. And also problem is considered as multi-objective. Therefore, we can find difference of this study with other ones, also in this study, two new multi-objective meta-initiative NSGAII and fireflies are used to select better algorithm in order to solve them that in chapter four, NSGAII superiority is shown. In this study, data are assumed determined that is it was supposed that time of activities is resources consumption as determined numbers. The first proposal that is offered in this study is to use modeling approaches under non-determined conditions. Using optimization approach based on modeling RCPSP problem Using the approach of random planning in RCPSP problem modeling References 1. KOLISCH, R Integrated scheduling, assembly area-and part-assignment for large-scale, make-to-order assemblies. International Journal of Production Economics, 64, NUDTASOMBOON, N. & RANDHAWA, S. U Resource-constrained project scheduling with renewable and non-renewable resources and time-resource tradeoffs. Computers & Industrial Engineering, 32, VIANA, A. & PINHO DE SOUSA, J Using metaheuristics in multiobjective resource constrained project scheduling. European Journal of Operational Research, 120, ROM, W. O., TUKEL, O. I. & MUSCATELLO, J. R MRP in a job shop environment using a resource constrained project scheduling model. Omega, 30, NAZARETH, T., VERMA, S., BHATTACHARYA, S. & BAGCHI, A The multiple resource constrained project scheduling problem: A breadth-first approach. European Journal of Operational Research, 112, KUSTER, J., JANNACH, D. & FRIEDRICH, G Applying local rescheduling in response to schedule disruptions. Annals of Operations Research, 180, RANJBAR, M., KHALILZADEH, M., KIANFAR, F. & ETMINANI, K An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem. Computers & Industrial Engineering, 62, MIKA, M., WALIGORA, G. & WĘGLARZ, J Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times. European Journal of Operational Research, 187, PADMAN, R. & ZHU, D Knowledge integration using problem spaces: A study in resource-constrained project scheduling. Journal of Scheduling, 9, BRUCKER, P., DREXL, A., MÖHRING, R., NEUMANN, K. & PESCH, E Resource-constrained project scheduling: Notation, classification, models, and methods. European journal of operational research, 112, VARMA, V. A., UZSOY, R., PEKNY, J. & BLAU, G Lagrangian heuristics for scheduling new product development projects in the pharmaceutical industry. Journal of Heuristics, 13, WALIGÓRA, G Discrete continuous project scheduling with discounted cash flows A tabu search approach. Computers & Operations Research, 35, F " Using genetic algorithmsand simulated refrigeration to solve the scheduling problem with limited resources in a few fashion projects and cash flow were Tnzy ( Technical Report.")International Journalof Industrial Engineering and Production Management, 19 )4(. Winter 853
12 Multi Objective Project Scheduling NAJAFI, A. A. & NIAKI, S. T. A A genetic algorithm for resource investment problem with discounted cash flows. Applied Mathematics and Computation, 183, NEUMANN, K. & ZIMMERMANN, J Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints. European Journal of Operational Research, 127, ICMELI-TUKEL, O. & ROM, W. O Ensuring quality in resource constrained project scheduling. European Journal of Operational Research, 103, RANJBAR, M An Optimal NPV Project Scheduling with Fixed Work Content and Payment on Milestones. International Journal of Industrial Engineering, 22, KHOSHJAHAN, Y., NAJAFI, A. A. & AFSHAR-NADJAFI, B Resource constrained project scheduling problem with discounted earliness tardiness penalties: Mathematical modeling and solving procedure. Computers & Industrial Engineering, 66,
Abstract 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 informationSCHEDULING RESOURCE CONSTRAINED PROJECT PORTFOLIOS WITH THE PRINCIPLES OF THE THEORY OF CONSTRAINTS 1
Krzysztof Targiel Department of Operations Research University of Economics in Katowice SCHEDULING RESOURCE CONSTRAINED PROJECT PORTFOLIOS WITH THE PRINCIPLES OF THE THEORY OF CONSTRAINTS 1 Introduction
More informationAn Optimal Project Scheduling Model with Lump-Sum Payment
Rev Integr Bus Econ Res Vol 2(1) 399 An Optimal Project Scheduling Model with Lump-Sum Payment Shangyao Yan Department of Civil Engineering, National Central University, Chungli 32001, Taiwan t320002@ccncuedutw
More informationHYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM. Jin-Lee KIM 1, M. ASCE
1560 HYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM Jin-Lee KIM 1, M. ASCE 1 Assistant Professor, Department of Civil Engineering and Construction
More informationCLIENT-CONTRACTOR BARGAINING ON NET PRESENT VALUE IN PROJECT SCHEDULING WITH LIMITED RESOURCES
CLIENT-CONTRACTOR BARGAINING ON NET PRESENT VALUE IN PROJECT SCHEDULING WITH LIMITED RESOURCES Nursel Kavlak 1, Gündüz Ulusoy 1 Funda Sivrikaya Şerifoğlu 2, Ş. Đlker Birbil 1 1 Sabancı University, Orhanlı,
More informationImprove Net Present Value using cash flow weight
2011 2 nd International Conference on Construction and Project Management IPEDR vol.15 (2011) (2011) IACSIT Press, Singapore Improve Net Present Value using cash flow weight Vacharee Tantisuvanichkul 1
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 informationOn The Multi-Mode, Multi-Skill Resource Constrained Project Scheduling Problem A Software Application
On The Multi-Mode, Multi-Skill Resource Constrained Project Scheduling Problem A Software Application Mónica A. Santos 1, Anabela P. Tereso 2 Abstract We consider an extension of the Resource-Constrained
More informationA Computer Application for Scheduling in MS Project
Comput. Sci. Appl. Volume 1, Number 5, 2014, pp. 309-318 Received: July 18, 2014; Published: November 25, 2014 Computer Science and Applications www.ethanpublishing.com Anabela Tereso, André Guedes and
More informationTwo-Sample T-Tests Assuming Equal Variance (Enter Means)
Chapter 4 Two-Sample T-Tests Assuming Equal Variance (Enter Means) Introduction This procedure provides sample size and power calculations for one- or two-sided two-sample t-tests when the variances of
More informationA Jumper Based Ant Colony Optimization for Software Project Scheduling and Staffing with an Event-Based Scheduler
A Jumper Based Ant Colony Optimization for Software Project Scheduling and Staffing with an Event-Based Scheduler Nithya.G 1, Dhivya priya R 2, Harini S 3, Menakapriya S 4 1,2,3,4 Sri Krishna College of
More informationA Multi-objective Scheduling Model for Solving the Resource-constrained Project Scheduling and Resource Leveling Problems. Jia Hu 1 and Ian Flood 2
A Multi-objective Scheduling Model for Solving the Resource-constrained Project Scheduling and Resource Leveling Problems Jia Hu 1 and Ian Flood 2 1 Ph.D. student, Rinker School of Building Construction,
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 informationTwo-Sample T-Tests Allowing Unequal Variance (Enter Difference)
Chapter 45 Two-Sample T-Tests Allowing Unequal Variance (Enter Difference) Introduction This procedure provides sample size and power calculations for one- or two-sided two-sample t-tests when no assumption
More informationResource-constrained Scheduling of a Real Project from the Construction Industry: A Comparison of Software Packages for Project Management
Resource-constrained Scheduling of a Real Project from the Construction Industry: A Comparison of Software Packages for Project Management N. Trautmann, P. Baumann Department of Business Administration,
More informationInteger Programming: Algorithms - 3
Week 9 Integer Programming: Algorithms - 3 OPR 992 Applied Mathematical Programming OPR 992 - Applied Mathematical Programming - p. 1/12 Dantzig-Wolfe Reformulation Example Strength of the Linear Programming
More informationAn Improved Ant Colony Optimization Algorithm for Software Project Planning and Scheduling
An Improved Ant Colony Optimization Algorithm for Software Project Planning and Scheduling Avinash Mahadik Department Of Computer Engineering Alard College Of Engineering And Management,Marunje, Pune Email-avinash.mahadik5@gmail.com
More informationSTUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1
STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1 Prajakta Joglekar, 2 Pallavi Jaiswal, 3 Vandana Jagtap Maharashtra Institute of Technology, Pune Email: 1 somanprajakta@gmail.com,
More informationCHAPTER 1. Basic Concepts on Planning and Scheduling
CHAPTER 1 Basic Concepts on Planning and Scheduling Scheduling, FEUP/PRODEI /MIEIC 1 Planning and Scheduling: Processes of Decision Making regarding the selection and ordering of activities as well as
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 informationResource Dedication Problem in a Multi-Project Environment*
Noname manuscript No. (will be inserted by the editor) Resource Dedication Problem in a Multi-Project Environment* Umut Beşikci Ümit Bilge Gündüz Ulusoy Abstract There can be different approaches to the
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 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 Proposed Scheme for Software Project Scheduling and Allocation with Event Based Scheduler using Ant Colony Optimization
A Proposed Scheme for Software Project Scheduling and Allocation with Event Based Scheduler using Ant Colony Optimization Arjita sharma 1, Niyati R Bhele 2, Snehal S Dhamale 3, Bharati Parkhe 4 NMIET,
More informationIndependent t- Test (Comparing Two Means)
Independent t- Test (Comparing Two Means) The objectives of this lesson are to learn: the definition/purpose of independent t-test when to use the independent t-test the use of SPSS to complete an independent
More informationRobust Preemptive Resource Assignment for Multiple Software Projects Using Parameter Design
International Journal of Applied Science and Engineering 2007. 5, 2: 159-171 Robust Preemptive Resource Assignment for Multiple Software Projects Using Parameter Design Lai-Hsi Lee * Department of Information
More informationModel-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms
Symposium on Automotive/Avionics Avionics Systems Engineering (SAASE) 2009, UC San Diego Model-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms Dipl.-Inform. Malte Lochau
More informationMulti-Mode Resource Constrained Multi-Project Scheduling and Resource Portfolio Problem
Multi-Mode Resource Constrained Multi-Project Scheduling and Resource Portfolio Problem Umut Beşikci a, Ümit Bilgea, Gündüz Ulusoy b, a Boğaziçi University, Department of Industrial Engineering, Bebek,
More informationConfidence Intervals for the Difference Between Two Means
Chapter 47 Confidence Intervals for the Difference Between Two Means Introduction This procedure calculates the sample size necessary to achieve a specified distance from the difference in sample means
More informationWei-Neng Chen, Student Member, IEEE, Jun Zhang, Senior Member, IEEE, Henry Shu-Hung Chung, Senior Member, IEEE, Rui-Zhang Huang, and Ou Liu
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART C: APPLICATIONS AND REVIEWS 1 Optimizing Discounted Cash Flows in Project Scheduling An Ant Colony Optimization Approach Wei-Neng Chen, Student Member,
More informationSOFTWARE FOR THE OPTIMAL ALLOCATION OF EV CHARGERS INTO THE POWER DISTRIBUTION GRID
SOFTWARE FOR THE OPTIMAL ALLOCATION OF EV CHARGERS INTO THE POWER DISTRIBUTION GRID Amparo MOCHOLÍ MUNERA, Carlos BLASCO LLOPIS, Irene AGUADO CORTEZÓN, Vicente FUSTER ROIG Instituto Tecnológico de la Energía
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 informationGenetic Algorithms for Bridge Maintenance Scheduling. Master Thesis
Genetic Algorithms for Bridge Maintenance Scheduling Yan ZHANG Master Thesis 1st Examiner: Prof. Dr. Hans-Joachim Bungartz 2nd Examiner: Prof. Dr. rer.nat. Ernst Rank Assistant Advisor: DIPL.-ING. Katharina
More informationA) 0.1554 B) 0.0557 C) 0.0750 D) 0.0777
Math 210 - Exam 4 - Sample Exam 1) What is the p-value for testing H1: µ < 90 if the test statistic is t=-1.592 and n=8? A) 0.1554 B) 0.0557 C) 0.0750 D) 0.0777 2) The owner of a football team claims that
More informationGASolver-A Solution to Resource Constrained Project Scheduling by Genetic Algorithm
Vol. 4, No. 2, 23 GASolver-A Solution to Resource Constrained Project Scheduling by Genetic Algorithm Dr Mamta Madan Professor(Comp science) Vivekananda Institute of Professional Studies, Affiliated to
More informationAn Evolutionary Algorithm in Grid Scheduling by multiobjective Optimization using variants of NSGA
International Journal of Scientific and Research Publications, Volume 2, Issue 9, September 2012 1 An Evolutionary Algorithm in Grid Scheduling by multiobjective Optimization using variants of NSGA Shahista
More informationA Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms
A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms MIGUEL CAMELO, YEZID DONOSO, HAROLD CASTRO Systems and Computer Engineering Department Universidad de los
More informationInternational Journal of Software and Web Sciences (IJSWS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International
More informationProblems, Methods and Tools of Advanced Constrained Scheduling
Problems, Methods and Tools of Advanced Constrained Scheduling Victoria Shavyrina, Spider Project Team Shane Archibald, Archibald Associates Vladimir Liberzon, Spider Project Team 1. Introduction In this
More informationLoad Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
More informationReal Time Scheduling Basic Concepts. Radek Pelánek
Real Time Scheduling Basic Concepts Radek Pelánek Basic Elements Model of RT System abstraction focus only on timing constraints idealization (e.g., zero switching time) Basic Elements Basic Notions task
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 informationRESOURCE ALLOCATION AND PLANNING FOR PROGRAM MANAGEMENT. Kabeh Vaziri Linda K. Nozick Mark A. Turnquist
Proceedings of the 005 Winter Simulation Conference M. E. Kuhl, N. M. Steiger, F. B. Armstrong, and J. A. Joins, eds. RESOURCE ALLOCATION AND PLANNING FOR PROGRAM MANAGEMENT Kabeh Vaziri Linda K. Nozick
More informationAPPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION
APPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION Harald Günther 1, Stephan Frei 1, Thomas Wenzel, Wolfgang Mickisch 1 Technische Universität Dortmund,
More information. 1/ CHAPTER- 4 SIMULATION RESULTS & DISCUSSION CHAPTER 4 SIMULATION RESULTS & DISCUSSION 4.1: ANT COLONY OPTIMIZATION BASED ON ESTIMATION OF DISTRIBUTION ACS possesses
More informationMAGS An Approach Using Multi-Objective Evolutionary Algorithms for Grid Task Scheduling
Issue 2, Volume 5, 2011 117 MAGS An Approach Using Multi-Objective Evolutionary Algorithms for Grid Task Scheduling Miguel Camelo, Yezid Donoso, Harold Castro Systems and Computing Engineering Department
More informationInformation Visualization in Project Management and Scheduling
Information Visualization in Project Management and Scheduling Ping Zhang (pzhang@mailbox.syr.edu) School of Information Studies Syracuse University Dan Zhu (dan-zhu@uiowa.edu) College of Business, University
More informationA Hybrid Technique for Software Project Scheduling and Human Resource Allocation
A Hybrid Technique for Software Project Scheduling and Human Resource Allocation A. Avinash, Dr. K. Ramani Department of Information Technology Sree Vidyanikethan Engineering College, Tirupati Abstract
More informationProject and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi
Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture - 9 Basic Scheduling with A-O-A Networks Today we are going to be talking
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 informationSelecting Best Investment Opportunities from Stock Portfolios Optimized by a Multiobjective Evolutionary Algorithm
Selecting Best Investment Opportunities from Stock Portfolios Optimized by a Multiobjective Evolutionary Algorithm Krzysztof Michalak Department of Information Technologies, Institute of Business Informatics,
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 informationWireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm
, pp. 99-108 http://dx.doi.org/10.1457/ijfgcn.015.8.1.11 Wireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm Wang DaWei and Wang Changliang Zhejiang Industry Polytechnic College
More informationMultiobjective Multicast Routing Algorithm
Multiobjective Multicast Routing Algorithm Jorge Crichigno, Benjamín Barán P. O. Box 9 - National University of Asunción Asunción Paraguay. Tel/Fax: (+9-) 89 {jcrichigno, bbaran}@cnc.una.py http://www.una.py
More informationSimulating the Multiple Time-Period Arrival in Yield Management
Simulating the Multiple Time-Period Arrival in Yield Management P.K.Suri #1, Rakesh Kumar #2, Pardeep Kumar Mittal #3 #1 Dean(R&D), Chairman & Professor(CSE/IT/MCA), H.C.T.M., Kaithal(Haryana), India #2
More informationMulti-objective Approaches to Optimal Testing Resource Allocation in Modular Software Systems
Multi-objective Approaches to Optimal Testing Resource Allocation in Modular Software Systems Zai Wang 1, Ke Tang 1 and Xin Yao 1,2 1 Nature Inspired Computation and Applications Laboratory (NICAL), School
More informationPEST - Beyond Basic Model Calibration. Presented by Jon Traum
PEST - Beyond Basic Model Calibration Presented by Jon Traum Purpose of Presentation Present advance techniques available in PEST for model calibration High level overview Inspire more people to use PEST!
More informationSurvey, Statistics and Psychometrics Core Research Facility University of Nebraska-Lincoln. Log-Rank Test for More Than Two Groups
Survey, Statistics and Psychometrics Core Research Facility University of Nebraska-Lincoln Log-Rank Test for More Than Two Groups Prepared by Harlan Sayles (SRAM) Revised by Julia Soulakova (Statistics)
More informationResearch on Project Scheduling Problem with Resource Constraints
2058 JOURNAL OF SOFTWARE, VOL. 8, NO. 8, AUGUST 2013 Research on Project Scheduling Problem with Resource Constraints Tinggui Chen College of Computer Science & Information Engineering, Zhejiang Gongshang
More informationLecture Notes Module 1
Lecture Notes Module 1 Study Populations A study population is a clearly defined collection of people, animals, plants, or objects. In psychological research, a study population usually consists of a specific
More informationUsing simulation to calculate the NPV of a project
Using simulation to calculate the NPV of a project Marius Holtan Onward Inc. 5/31/2002 Monte Carlo simulation is fast becoming the technology of choice for evaluating and analyzing assets, be it pure financial
More informationScheduling Algorithm with Optimization of Employee Satisfaction
Washington University in St. Louis Scheduling Algorithm with Optimization of Employee Satisfaction by Philip I. Thomas Senior Design Project http : //students.cec.wustl.edu/ pit1/ Advised By Associate
More informationA GENETIC ALGORITHM FOR THE RESOURCE CONSTRAINED MULTI-PROJECT SCHEDULING PROBLEM
A GENETIC ALGORITHM FOR THE RESOURCE CONSTRAINED MULTI-PROJECT SCHEDULING PROBLEM J. F. GONÇALVES, J. J. M. MENDES, AND M.G.C. RESENDE ABSTRACT. This paper presents a genetic algorithm (GA) for the Resource
More informationUnit 31 A Hypothesis Test about Correlation and Slope in a Simple Linear Regression
Unit 31 A Hypothesis Test about Correlation and Slope in a Simple Linear Regression Objectives: To perform a hypothesis test concerning the slope of a least squares line To recognize that testing for a
More informationTECHNISCHE UNIVERSITÄT DRESDEN Fakultät Wirtschaftswissenschaften
TECHNISCHE UNIVERSITÄT DRESDEN Fakultät Wirtschaftswissenschaften Dresdner Beiträge zur Betriebswirtschaftslehre Nr. 168/12 A survey of recent methods for solving project scheduling problems Markus Rehm,
More informationStats for Strategy Fall 2012 First-Discussion Handout: Stats Using Calculators and MINITAB
Stats for Strategy Fall 2012 First-Discussion Handout: Stats Using Calculators and MINITAB DIRECTIONS: Welcome! Your TA will help you apply your Calculator and MINITAB to review Business Stats, and will
More informationLesson 1: Comparison of Population Means Part c: Comparison of Two- Means
Lesson : Comparison of Population Means Part c: Comparison of Two- Means Welcome to lesson c. This third lesson of lesson will discuss hypothesis testing for two independent means. Steps in Hypothesis
More informationChapter 5. Process design
Chapter 5 Process design Slack et al s model of operations management Direct Product and service design Design Operations Management Deliver Develop Process design Location, layout and flow Key operations
More informationUNIVERSITY of MASSACHUSETTS DARTMOUTH Charlton College of Business Decision and Information Sciences Fall 2010
UNIVERSITY of MASSACHUSETTS DARTMOUTH Charlton College of Business Decision and Information Sciences Fall 2010 COURSE: POM 500 Statistical Analysis, ONLINE EDITION, Fall 2010 Prerequisite: Finite Math
More informationA Brief Study of the Nurse Scheduling Problem (NSP)
A Brief Study of the Nurse Scheduling Problem (NSP) Lizzy Augustine, Morgan Faer, Andreas Kavountzis, Reema Patel Submitted Tuesday December 15, 2009 0. Introduction and Background Our interest in the
More informationPearson's Correlation Tests
Chapter 800 Pearson's Correlation Tests Introduction The correlation coefficient, ρ (rho), is a popular statistic for describing the strength of the relationship between two variables. The correlation
More informationScheduling Jobs and Preventive Maintenance Activities on Parallel Machines
Scheduling Jobs and Preventive Maintenance Activities on Parallel Machines Maher Rebai University of Technology of Troyes Department of Industrial Systems 12 rue Marie Curie, 10000 Troyes France maher.rebai@utt.fr
More informationOffline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
More informationSoftware Project Planning and Resource Allocation Using Ant Colony Optimization with Uncertainty Handling
Software Project Planning and Resource Allocation Using Ant Colony Optimization with Uncertainty Handling Vivek Kurien1, Rashmi S Nair2 PG Student, Dept of Computer Science, MCET, Anad, Tvm, Kerala, India
More informationConfidence Intervals for One Standard Deviation Using Standard Deviation
Chapter 640 Confidence Intervals for One Standard Deviation Using Standard Deviation Introduction This routine calculates the sample size necessary to achieve a specified interval width or distance from
More informationRESOURCE ALLOCATION USING METAHEURISTIC SEARCH
RESOURCE ALLOCATION USING METAHEURISTIC SEARCH Dr Andy M. Connor 1 and Amit Shah 2 1 CoLab, Auckland University of Technology, Private Bag 92006, Wellesley Street, Auckland, NZ andrew.connor@aut.ac.nz
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 informationConfidence Intervals for Cpk
Chapter 297 Confidence Intervals for Cpk Introduction This routine calculates the sample size needed to obtain a specified width of a Cpk confidence interval at a stated confidence level. Cpk is a process
More informationStatistics I for QBIC. Contents and Objectives. Chapters 1 7. Revised: August 2013
Statistics I for QBIC Text Book: Biostatistics, 10 th edition, by Daniel & Cross Contents and Objectives Chapters 1 7 Revised: August 2013 Chapter 1: Nature of Statistics (sections 1.1-1.6) Objectives
More informationAgenda. Real System, Transactional IT, Analytic IT. What s the Supply Chain. Levels of Decision Making. Supply Chain Optimization
Agenda Supply Chain Optimization KUBO Mikio Definition of the Supply Chain (SC) and Logistics Decision Levels of the SC Classification of Basic Models in the SC Logistics Network Design Production Planning
More informationGenetic algorithms for solving portfolio allocation models based on relative-entropy, mean and variance
Journal of Scientific Research and Development 2 (12): 7-12, 2015 Available online at www.jsrad.org ISSN 1115-7569 2015 JSRAD Genetic algorithms for solving portfolio allocation models based on relative-entropy,
More informationAppendix: Simple Methods for Shift Scheduling in Multi-Skill Call Centers
MSOM.1070.0172 Appendix: Simple Methods for Shift Scheduling in Multi-Skill Call Centers In Bhulai et al. (2006) we presented a method for computing optimal schedules, separately, after the optimal staffing
More informationA SIMULATION MODEL FOR RESOURCE CONSTRAINED SCHEDULING OF MULTIPLE PROJECTS
A SIMULATION MODEL FOR RESOURCE CONSTRAINED SCHEDULING OF MULTIPLE PROJECTS B. Kanagasabapathi 1 and K. Ananthanarayanan 2 Building Technology and Construction Management Division, Department of Civil
More informationResources Management
Resources Management. Introduction s we have seen in network scheduling, the basic inputs to criticalpath analysis are the individual project activities, their durations, and their dependency relationships.
More informationUnderstand the role that hypothesis testing plays in an improvement project. Know how to perform a two sample hypothesis test.
HYPOTHESIS TESTING Learning Objectives Understand the role that hypothesis testing plays in an improvement project. Know how to perform a two sample hypothesis test. Know how to perform a hypothesis test
More informationUnderstanding Confidence Intervals and Hypothesis Testing Using Excel Data Table Simulation
Understanding Confidence Intervals and Hypothesis Testing Using Excel Data Table Simulation Leslie Chandrakantha lchandra@jjay.cuny.edu Department of Mathematics & Computer Science John Jay College of
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 informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationChi Square Tests. Chapter 10. 10.1 Introduction
Contents 10 Chi Square Tests 703 10.1 Introduction............................ 703 10.2 The Chi Square Distribution.................. 704 10.3 Goodness of Fit Test....................... 709 10.4 Chi Square
More information6 3 The Standard Normal Distribution
290 Chapter 6 The Normal Distribution Figure 6 5 Areas Under a Normal Distribution Curve 34.13% 34.13% 2.28% 13.59% 13.59% 2.28% 3 2 1 + 1 + 2 + 3 About 68% About 95% About 99.7% 6 3 The Distribution Since
More informationMinimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet Vehicle Routing Problem with Alternative Paths
Sustainability 2014, 6, 4658-4684; doi:10.3390/su6074658 Article OPEN ACCESS sustainability ISSN 2071-1050 www.mdpi.com/journal/sustainability Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet
More informationChi-square test Fisher s Exact test
Lesson 1 Chi-square test Fisher s Exact test McNemar s Test Lesson 1 Overview Lesson 11 covered two inference methods for categorical data from groups Confidence Intervals for the difference of two proportions
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 informationChapter 8: Hypothesis Testing for One Population Mean, Variance, and Proportion
Chapter 8: Hypothesis Testing for One Population Mean, Variance, and Proportion Learning Objectives Upon successful completion of Chapter 8, you will be able to: Understand terms. State the null and alternative
More informationThe Project Scheduling and Decision Mechanism Based on the Multi-Resource Leveling
EPPM, Singapore, 20-21 Sep 2011 The Project Scheduling and Decision Mechanism Based on the Multi-Resource Leveling Abstract Hsiang-Hsi Huang 1, Jia-Chen Shiu 2, Tai-Lin Chen 3 Except for optimizing the
More informationScheduling Single Machine Scheduling. Tim Nieberg
Scheduling Single Machine Scheduling Tim Nieberg Single machine models Observation: for non-preemptive problems and regular objectives, a sequence in which the jobs are processed is sufficient to describe
More informationReview #2. Statistics
Review #2 Statistics Find the mean of the given probability distribution. 1) x P(x) 0 0.19 1 0.37 2 0.16 3 0.26 4 0.02 A) 1.64 B) 1.45 C) 1.55 D) 1.74 2) The number of golf balls ordered by customers of
More informationMulti-Objective Optimization using Evolutionary Algorithms
Multi-Objective Optimization using Evolutionary Algorithms Kalyanmoy Deb Department of Mechanical Engineering, Indian Institute of Technology, Kanpur, India JOHN WILEY & SONS, LTD Chichester New York Weinheim
More information1. What is the critical value for this 95% confidence interval? CV = z.025 = invnorm(0.025) = 1.96
1 Final Review 2 Review 2.1 CI 1-propZint Scenario 1 A TV manufacturer claims in its warranty brochure that in the past not more than 10 percent of its TV sets needed any repair during the first two years
More information