• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.744-747
• /
• 2005

The AEC (Architecture/Engineering/Construction) industry is facing a competitive world after it entered into the 21^st century. Due to improper planning and scheduling, the construction projects face severe delays in completion. Most of the present day construction organisations operate in multiple project environments where more than one projects are to be managed simultaneously. But the advantages of planning and scheduling as multiple projects have not been utilized by these organisations. Change in multi-project planning and scheduling is inevitable and often frequent, therefore the traditional planning and scheduling approaches are no more feasible in scheduling multiple construction projects. The traditional scheduling tools like CPM and PERT do not offer any help in scheduling in a resource-constrained environment. This necessitated a detailed study to model the environment realistically and to make the allocation of limited resources flexible and efficient. This paper delineates about the proactive model which will help the project managers for scheduling the multiple construction projects.

• The Journal of Asian Finance, Economics and Business
• /
• v.8 no.12
• /
• pp.129-139
• /
• 2021

The aim of this study is to provide insight into tax avoidance through planning and management, and its investment consequences in financially constrained and unconstrained firms, as well as to empirically examine the interrelationships between the variables studied. Data was extracted from the financial statement analysis of non-financial companies listed on the Pakistan stock exchange (PSX) published by the State Bank of Pakistan, covering ten major manufacturing sectors. KZ index and WW index are used to identify financially constrained and unconstrained firms. Tax avoidance is measured by using GETR and LETR. All the equations are estimated through panel data regression models using common, fixed, and random effects. The empirical investigation of the role of tax avoidance in all firms collectively and constrained and unconstrained firms separately showed that the tax avoidance behavior of these firms is translated into investments by these firms. The study will help policymakers in strategy formulation and implementation related to tax planning and investment decisions in constrained and unconstrained firms to overcome their financial constraints and to optimize their investment decisions for value maximization. This will substantially increase the investment in the country by providing growth opportunities and lowering the tax rates.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.4
• /
• pp.142-148
• /
• 2012

Release planning for incremental software development is to select and assign features in sequence of releases along a specified planning horizon. It includes the technical precedence inherent in the features, the conflicting priorities as determined by the representative stakeholders, and the balance between required and available resources. The complexity of this consideration is getting more complicated when planning releases in software product lines. The problem is formulated as a precedence-constrained multiple 0-1 knapsack problem. In this research a genetic algorithm is developed for solving the release planning problems in software product lines as well as tests for the proposed solution methodology are conducted using data generated randomly.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.17-24
• /
• 2013

Release planning in a software product line (SPL) is to select and assign the features of the multiple software products in the SPL in sequence of releases along a specified planning horizon satisfying the numerous constraints regarding technical precedence, conflicting priorities for features, and available resources. A greedy genetic algorithm is designed to solve the problems of release planning in SPL which is formulated as a precedence-constrained multiple 0-1 knapsack problem. To be guaranteed to obtain feasible solutions after the crossover and mutation operation, a greedy-like heuristic is developed as a repair operator and reflected into the genetic algorithm. The performance of the proposed solution methodology in this research is tested using a fractional factorial experimental design as well as compared with the performance of a genetic algorithm developed for the software release planning. The comparison shows that the solution approach proposed in this research yields better result than the genetic algorithm.

• Journal of Families and Better Life
• /
• v.10 no.1 s.19
• /
• pp.191-205
• /
• 1992

The purpose of this study was to investigate the planning styles and the differences of the level of planning styles according to individuals, family related variables and perceived adequacy of resources. The subjects of the study were 560 wives living in seoul and Daejeon. Survey methods were questionnaire. Data analysis strategies were percentile, frequency, Pearson's correlation, factor analysis, oneway analysis and multiple classification analysis. The major findings were as follows : 1) Planning styles were categorized into three factors. They were labeled resource-centered, goal-centered, constrained planning style. 2) wives tended to more frequently use a goal-centered planning style. 3) The perceived adequacy of health resource, the perceived adequacy of inter-personnal resource and occupation of husband were significant predictors of the level of resource-centered planning style. 4) The perceived adequacy of money resource was significant predictors of the level of constrained planning style. 5) The perceived adequacy of money resource and the age of youngest child were significant predictors of the level of goal-centered planning style.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.7-13
• /
• 2008

This paper suggests a Path-planning algorithm for mobile agents. While there are a lot of studies on the path-planning for mobile agents, mathematical modeling of complex environment which constrained by spatio-temporally is very difficult and it is impossible to obtain the optimal solutions. In this paper, an optimal path-planning algorithm based on the graphic technique is presented. The working environment is divided into two areas, the one is free movable area and the other is not permissible area in which there exist obstacles and spatio-temporally constrained, and an optimal solution is obtained by using a new algorithm which is based on the well known ACO algorithm.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.3
• /
• pp.232-239
• /
• 2006

This paper is for applying interactive fuzzy linear programming for the problem of product mix planning, which is one of the aggregate planning problem. We developed a modified algorithm, which has two-phase approach for interactive fuzzy linear programming to get a better solution. Adding two-phase method, we expect to obtain not only the highest membership degree, but also a better utilization of each constrained resource.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.55 no.3
• /
• pp.123-127
• /
• 2006

The recent movement to deregulated and competitive electricity market requires new concepts in applying dispatch algorithms to system operation and planning. As power systems tend to be operated more closely to their ultimate ratings, the role of Contingency Constrained Optimal Power Flow is changed and the importance for security enhancement will be more increased in the new and competitive electricity market. This paper presents a contingency constrained optimal power flow (CCOPF) algorithm. The proposed algorithm maintains the nodal voltage levels and transmission line's power flow within the specified limits before and after a contingency. A case study demonstrates the proposed algorithm with the IEEE-14RTS under N-1 contingency criterion.

• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.412-413
• /
• 2006

This paper proposed the transmission planning mechanism in competitive power markets. This mechanism used Optimal Power Flow(OPF) to calculate operation cost and Contingency Constrained OPF(CC-OPF) to consider N-1 contingency outage. In addition, this algorithm deduced a yearly transmission planning using Dynamic Programming(DP).

• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.184-186
• /
• 1999

This paper presents a method for security constrained optimal reactive power planning in electric power systems. This method deals with corrective mode optimal reactive power dispatch in each (n-1)contingency system state and determination of the location and amount of reactive sources in preventive mode. In this paper the proposed scheme uses Benders decomposition method to determine the proper amount and location of reactive support in order to maintain a proper voltage profile and minimize active power transmission losses. This method is tested on IEEE 30 bus test system to prove effectiveness.