Pub Date : 2011-06-17DOI: 10.1080/10170669.2011.580469
Hsu-Hao Yang, Shihao Wang
This article proposes a methodology that introduces attribute reduction of rough sets into crossover of genetic algorithms (GAs), and then uses the methodology to develop two algorithms. The first algorithm selects the crossover points, either by attribute reduction or randomly; the second selects the crossover points solely by attribute reduction, with no crossover otherwise. We test the methodology on the solving of the 0/1 knapsack problem, due to the problem's NP-hard complexity, and we compare the experiment results to those of typical GAs. According to the results, the introduction of attribute reduction increases the mean and decreases the standard deviation of the final solutions, especially in the presence of tighter capacity, i.e. attribution reduction leads to better solution quality and more tightly clustered solutions. Moreover, the mean number of iterations required to terminate the algorithm and that required to reach maximal profits are significantly reduced.
{"title":"Solving the 0/1 knapsack problem using rough sets and genetic algorithms","authors":"Hsu-Hao Yang, Shihao Wang","doi":"10.1080/10170669.2011.580469","DOIUrl":"https://doi.org/10.1080/10170669.2011.580469","url":null,"abstract":"This article proposes a methodology that introduces attribute reduction of rough sets into crossover of genetic algorithms (GAs), and then uses the methodology to develop two algorithms. The first algorithm selects the crossover points, either by attribute reduction or randomly; the second selects the crossover points solely by attribute reduction, with no crossover otherwise. We test the methodology on the solving of the 0/1 knapsack problem, due to the problem's NP-hard complexity, and we compare the experiment results to those of typical GAs. According to the results, the introduction of attribute reduction increases the mean and decreases the standard deviation of the final solutions, especially in the presence of tighter capacity, i.e. attribution reduction leads to better solution quality and more tightly clustered solutions. Moreover, the mean number of iterations required to terminate the algorithm and that required to reach maximal profits are significantly reduced.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126085068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-06-16DOI: 10.1080/10170669.2011.591974
Chung-Min Wu, Jiun-Ting Chen, Chuen-Lung Chen
The main implementation in a Web services system is enterprise application integration (EAI), which has been presented for years. The emergence of Web services technology has opened up several new and previously unimaginable ways to achieve similar results. It has become a lingua franca for integrating business-to-business (B2B) applications across corporate boundaries to build a true and federated environment. Enterprises with legacy systems that migrate to use Web services may meet some problems with system integration because there is no experienced implementation guideline. Thus, the environmental factor study is important to the Web services system implementation among enterprises. This research proposes an approach for providing key factors for the enterprises to implement Web services systems. It adopts the Delphi method to scheme the appropriate Web services system implementation with some conditions in planning, development, and operation phases. The deployment circumstances are also analyzed in corporate internal and external scenarios in studies of cases. The conclusion provides the key environmental factors for enterprises to adopt Web services successfully.
{"title":"Consideration for employing a Web services system","authors":"Chung-Min Wu, Jiun-Ting Chen, Chuen-Lung Chen","doi":"10.1080/10170669.2011.591974","DOIUrl":"https://doi.org/10.1080/10170669.2011.591974","url":null,"abstract":"The main implementation in a Web services system is enterprise application integration (EAI), which has been presented for years. The emergence of Web services technology has opened up several new and previously unimaginable ways to achieve similar results. It has become a lingua franca for integrating business-to-business (B2B) applications across corporate boundaries to build a true and federated environment. Enterprises with legacy systems that migrate to use Web services may meet some problems with system integration because there is no experienced implementation guideline. Thus, the environmental factor study is important to the Web services system implementation among enterprises. This research proposes an approach for providing key factors for the enterprises to implement Web services systems. It adopts the Delphi method to scheme the appropriate Web services system implementation with some conditions in planning, development, and operation phases. The deployment circumstances are also analyzed in corporate internal and external scenarios in studies of cases. The conclusion provides the key environmental factors for enterprises to adopt Web services successfully.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127752873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-06-16DOI: 10.1080/10170669.2011.591842
Wen-Pai Wang, Chun-Chih Chiu
Increasing competitive pressures, market globalization, and shortened product life cycles are forcing firms to develop supply chains that can quickly respond to customer needs. How to manage demand instability as well as controlling well makes a great impact on order allocation decisions, whereas it plays an important role in minimizing total purchasing costs, while maintaining a specified service level. The objective of this article is to explore how order allocation decisions influence a supply chain. A simulation-based system structure is therefore proposed for regular/urgent orders, and factors under consideration include cost, quality, delivery date, service quality, order fill rates, production capacity, and current order quantities simultaneously. Multiple concerns in this article include total turnover, purchasing costs, back order costs, transportation costs, and order waiting costs. Finally, its effectiveness in terms of the service level and the company's total purchasing cost is examined by a numerical example.
{"title":"The impact of order allocation decision on supply chain benefits under multiple suppliers","authors":"Wen-Pai Wang, Chun-Chih Chiu","doi":"10.1080/10170669.2011.591842","DOIUrl":"https://doi.org/10.1080/10170669.2011.591842","url":null,"abstract":"Increasing competitive pressures, market globalization, and shortened product life cycles are forcing firms to develop supply chains that can quickly respond to customer needs. How to manage demand instability as well as controlling well makes a great impact on order allocation decisions, whereas it plays an important role in minimizing total purchasing costs, while maintaining a specified service level. The objective of this article is to explore how order allocation decisions influence a supply chain. A simulation-based system structure is therefore proposed for regular/urgent orders, and factors under consideration include cost, quality, delivery date, service quality, order fill rates, production capacity, and current order quantities simultaneously. Multiple concerns in this article include total turnover, purchasing costs, back order costs, transportation costs, and order waiting costs. Finally, its effectiveness in terms of the service level and the company's total purchasing cost is examined by a numerical example.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114955773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-27DOI: 10.1080/10170669.2011.574736
Taravatsadat Nehzati, Hannaneh Rashidi-Bajgan, N. Ismail
The warehouse layout problem involves allocation of different product types to certain areas of a warehouse so that the cost of material handling from docks of the warehouse can be minimized. In this study, a Tabu Search algorithm as a satisfying solution for the quadratic assignment problem is applied for modeling. The layout problem is linked to Visual Basic® programming in Excel®. A spreadsheet-based decision support system is developed in which the user specifies the area of the warehouse by height and number of bays, places the docks around the warehouse and gives the frequency of their usage, and provides the demand and area required per product type. Then, the problem is solved to find the proper location of each product type for minimal material handling cost. The proposed system will provide decision-makers and engineers with a suitable answer in negligible time.
{"title":"Development of a decision support system using Tabu Search algorithm for the warehouse layout problem","authors":"Taravatsadat Nehzati, Hannaneh Rashidi-Bajgan, N. Ismail","doi":"10.1080/10170669.2011.574736","DOIUrl":"https://doi.org/10.1080/10170669.2011.574736","url":null,"abstract":"The warehouse layout problem involves allocation of different product types to certain areas of a warehouse so that the cost of material handling from docks of the warehouse can be minimized. In this study, a Tabu Search algorithm as a satisfying solution for the quadratic assignment problem is applied for modeling. The layout problem is linked to Visual Basic® programming in Excel®. A spreadsheet-based decision support system is developed in which the user specifies the area of the warehouse by height and number of bays, places the docks around the warehouse and gives the frequency of their usage, and provides the demand and area required per product type. Then, the problem is solved to find the proper location of each product type for minimal material handling cost. The proposed system will provide decision-makers and engineers with a suitable answer in negligible time.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127855712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-27DOI: 10.1080/10170669.2011.568016
Suh-Jenq Yang, Chou-Jung Hsu, Teng-Ruey Chang, Dar-Li Yang
In this study we consider single-machine scheduling problems with past-sequence-dependent (p-s-d) delivery times and a learning effect. The objectives are to minimize the makespan, the total completion time, the total weighted completion time, the total waiting time, and the total weighted waiting time. We show that the makespan, the total completion time, and the total waiting time minimization problems can be optimally solved in polynomial time algorithms. For the total weighted completion time and the total weighted waiting time minimization problems, we prove that they remain polynomially solvable with certain conditions. Furthermore, we analyze the worst-case bounds for the total weighted completion time and the total weighted waiting time minimization problems and propose two heuristic algorithms to find near optimal solutions. Our numerical results indicate that the two heuristic algorithms are efficient and effective in obtaining near optimal solutions for both problems.
{"title":"Single-machine scheduling with past-sequence-dependent delivery times and learning effect","authors":"Suh-Jenq Yang, Chou-Jung Hsu, Teng-Ruey Chang, Dar-Li Yang","doi":"10.1080/10170669.2011.568016","DOIUrl":"https://doi.org/10.1080/10170669.2011.568016","url":null,"abstract":"In this study we consider single-machine scheduling problems with past-sequence-dependent (p-s-d) delivery times and a learning effect. The objectives are to minimize the makespan, the total completion time, the total weighted completion time, the total waiting time, and the total weighted waiting time. We show that the makespan, the total completion time, and the total waiting time minimization problems can be optimally solved in polynomial time algorithms. For the total weighted completion time and the total weighted waiting time minimization problems, we prove that they remain polynomially solvable with certain conditions. Furthermore, we analyze the worst-case bounds for the total weighted completion time and the total weighted waiting time minimization problems and propose two heuristic algorithms to find near optimal solutions. Our numerical results indicate that the two heuristic algorithms are efficient and effective in obtaining near optimal solutions for both problems.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115038130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-27DOI: 10.1080/10170669.2011.579477
Ching-Chi Tseng, Jenn-Yang Lin, Ming-Shi Chen, M. Lin
Product design is a creative decision-making process that aims to satisfy human needs by releasing good products that can appropriately meet the preferential requirements of customers. In the development of new products, the designer must identify the preference and attitudes of customers toward certain products, ascertain the factors that make products popular in the market, and devise optimum design plans for those products. Biking has become a popular activity due to its contribution to maintaining health. Bicycle-related clothing is known to play an important role in comfort level and safety. Unfortunately, there is hardly any research or designs that consider customer preferences in the bicycle-related clothing design process. Many manufacturers mainly focus on the improvement of the material properties of clothes instead of clothing design to meet the customer requirements. This study uses conjoint analysis in bicycle-related clothing design to provide designers with an efficient approach to identify customer preferences. The lifestyles of users are examined through a massive amount of collected data used to design an attitude measurement chart/questionnaire. Customer requirements are subsequently categorized through factor analysis, and critical requirement attributes are identified for conjoint analysis. Finally, conjoint analysis is used to obtain the optimal design combination for bicycle-related clothing that adheres to the preferences of customers.
{"title":"The use of conjoint analysis in the design of bicycle-related clothing","authors":"Ching-Chi Tseng, Jenn-Yang Lin, Ming-Shi Chen, M. Lin","doi":"10.1080/10170669.2011.579477","DOIUrl":"https://doi.org/10.1080/10170669.2011.579477","url":null,"abstract":"Product design is a creative decision-making process that aims to satisfy human needs by releasing good products that can appropriately meet the preferential requirements of customers. In the development of new products, the designer must identify the preference and attitudes of customers toward certain products, ascertain the factors that make products popular in the market, and devise optimum design plans for those products. Biking has become a popular activity due to its contribution to maintaining health. Bicycle-related clothing is known to play an important role in comfort level and safety. Unfortunately, there is hardly any research or designs that consider customer preferences in the bicycle-related clothing design process. Many manufacturers mainly focus on the improvement of the material properties of clothes instead of clothing design to meet the customer requirements. This study uses conjoint analysis in bicycle-related clothing design to provide designers with an efficient approach to identify customer preferences. The lifestyles of users are examined through a massive amount of collected data used to design an attitude measurement chart/questionnaire. Customer requirements are subsequently categorized through factor analysis, and critical requirement attributes are identified for conjoint analysis. Finally, conjoint analysis is used to obtain the optimal design combination for bicycle-related clothing that adheres to the preferences of customers.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115812996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-27DOI: 10.1080/10170669.2011.573004
Ping-Shun Chen, A. Garcia-Diaz
Transshipment problems (TPs) have been widely applied in academic and practical areas. The deterministic TPs, which include four characteristics: commodities, modes (transportation methods), generalized network, and time periods, are NP-hard problems. Therefore, this research analyzes the structure of the multi-commodity multi-mode generalized networks over a multi-time-period problem and develops three Lagrangian-relaxation heuristic algorithms to minimize total costs for delivering commodities. The proposed mathematical model incorporates an upper bound on traffic flow for each segment of the distribution network. This is the so-called knapsack constraint. Further, two application networks are tested for medium and large-scale problems. As a result, simulation results show that the three proposed algorithms can provide more feasible solutions with attractive levels of near-optimality within reasonable time compared to the branch-and-bound method.
{"title":"Lagrangian relaxation heuristics for deterministic transshipment problems","authors":"Ping-Shun Chen, A. Garcia-Diaz","doi":"10.1080/10170669.2011.573004","DOIUrl":"https://doi.org/10.1080/10170669.2011.573004","url":null,"abstract":"Transshipment problems (TPs) have been widely applied in academic and practical areas. The deterministic TPs, which include four characteristics: commodities, modes (transportation methods), generalized network, and time periods, are NP-hard problems. Therefore, this research analyzes the structure of the multi-commodity multi-mode generalized networks over a multi-time-period problem and develops three Lagrangian-relaxation heuristic algorithms to minimize total costs for delivering commodities. The proposed mathematical model incorporates an upper bound on traffic flow for each segment of the distribution network. This is the so-called knapsack constraint. Further, two application networks are tested for medium and large-scale problems. As a result, simulation results show that the three proposed algorithms can provide more feasible solutions with attractive levels of near-optimality within reasonable time compared to the branch-and-bound method.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117310788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-27DOI: 10.1080/10170669.2011.580467
U. Wen, Ru-Siou Yu, Che-Wei Tsui
Radiation therapy is a common and important treatment for some specific tumors in the treatment of cancer. In recent years, there has been a new development in radiation therapy, intensity-modulated radiation therapy (IMRT). IMRT modulates the intensity of the radiation beam to focus a higher radiation dose on the tumor while minimizing radiation exposure to surrounding normal tissues. This study aims to investigate the optimal selection of beam angles. Besides limiting the radiation dose to the tumor and the adjacent organs, we also take the dose distribution into consideration and optimize the beam angles and beam intensity maps simultaneously. Compared with the typical equi-spaced model, our proposed approach can provide optimal beam configuration to help physicians in decision-making.
{"title":"Optimal selection of beam orientations in intensity-modulated radiation therapy","authors":"U. Wen, Ru-Siou Yu, Che-Wei Tsui","doi":"10.1080/10170669.2011.580467","DOIUrl":"https://doi.org/10.1080/10170669.2011.580467","url":null,"abstract":"Radiation therapy is a common and important treatment for some specific tumors in the treatment of cancer. In recent years, there has been a new development in radiation therapy, intensity-modulated radiation therapy (IMRT). IMRT modulates the intensity of the radiation beam to focus a higher radiation dose on the tumor while minimizing radiation exposure to surrounding normal tissues. This study aims to investigate the optimal selection of beam angles. Besides limiting the radiation dose to the tumor and the adjacent organs, we also take the dose distribution into consideration and optimize the beam angles and beam intensity maps simultaneously. Compared with the typical equi-spaced model, our proposed approach can provide optimal beam configuration to help physicians in decision-making.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122355091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-05-27DOI: 10.1080/10170669.2011.573006
Suh-Jenq Yang
This article considers identical parallel-machine scheduling problems with simultaneous considerations of position-dependent deterioration effects and maintenance activities. To counteract the deterioration effects on the machines, we assume that each machine must be maintained exactly once during the planning horizon and the maintenance can be scheduled immediately after completing the processing of any job. We further assume that, after the maintenance on a machine, the machine reverts to its initial condition and the deterioration effect starts anew. The objective is to find jointly the optimal maintenance positions and the optimal job sequences to minimize the total machine load. We provide polynomial time solutions for all the problems studied. Furthermore, we also show that the problem under study remains polynomially solvable when each machine is subject to multiple maintenance activities.
{"title":"Parallel machines scheduling with simultaneous considerations of position-dependent deterioration effects and maintenance activities","authors":"Suh-Jenq Yang","doi":"10.1080/10170669.2011.573006","DOIUrl":"https://doi.org/10.1080/10170669.2011.573006","url":null,"abstract":"This article considers identical parallel-machine scheduling problems with simultaneous considerations of position-dependent deterioration effects and maintenance activities. To counteract the deterioration effects on the machines, we assume that each machine must be maintained exactly once during the planning horizon and the maintenance can be scheduled immediately after completing the processing of any job. We further assume that, after the maintenance on a machine, the machine reverts to its initial condition and the deterioration effect starts anew. The objective is to find jointly the optimal maintenance positions and the optimal job sequences to minimize the total machine load. We provide polynomial time solutions for all the problems studied. Furthermore, we also show that the problem under study remains polynomially solvable when each machine is subject to multiple maintenance activities.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131191646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-04-01DOI: 10.1080/10170669.2010.532598
Ching-Chih Tseng
Most organizations have evaluated project performance primarily through cost and schedule performance measures, such as earned value management, for projects. However, to date, few tools in the project management literature have been proposed for enabling comparisons of the overall performance of projects. This study introduces a simple index, the critical ratio in time (CR(t)), as a measure of the overall performance of a project. The index can be easily calculated on the basis of the earned value (EV) data, which are normally available from a project cost system. Based on the index, a statistical analysis for the comparison of the overall performance of projects using Weibull analysis on EV metrics is proposed. The statistical analysis can be performed on a spreadsheet, such as Microsoft® Excel®. Furthermore, the detailed steps in the analysis are discussed along with an example in which five sample projects are analyzed and compared. Based on the obtained results, the author concludes that the proposed approach on the basis of CR(t) data can provide a robust and effective method for managers to evaluate and compare the overall performance of projects, and can be applicable in evaluating the project whose value has been determined (e.g. contracted projects).
{"title":"Statistical analysis for comparison of overall performance of projects using Weibull analysis on earned value metrics","authors":"Ching-Chih Tseng","doi":"10.1080/10170669.2010.532598","DOIUrl":"https://doi.org/10.1080/10170669.2010.532598","url":null,"abstract":"Most organizations have evaluated project performance primarily through cost and schedule performance measures, such as earned value management, for projects. However, to date, few tools in the project management literature have been proposed for enabling comparisons of the overall performance of projects. This study introduces a simple index, the critical ratio in time (CR(t)), as a measure of the overall performance of a project. The index can be easily calculated on the basis of the earned value (EV) data, which are normally available from a project cost system. Based on the index, a statistical analysis for the comparison of the overall performance of projects using Weibull analysis on EV metrics is proposed. The statistical analysis can be performed on a spreadsheet, such as Microsoft® Excel®. Furthermore, the detailed steps in the analysis are discussed along with an example in which five sample projects are analyzed and compared. Based on the obtained results, the author concludes that the proposed approach on the basis of CR(t) data can provide a robust and effective method for managers to evaluate and compare the overall performance of projects, and can be applicable in evaluating the project whose value has been determined (e.g. contracted projects).","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121668356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：