• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.865-876
• /
• 2002

Successful project planning relies on a good estimation of the effort required to complete a project, together with the schedule options that may be available. Existing software effort estimation models are present only the total effort and instantaneous effort function for the software life-cycle. Also, Putnam presents constant effort rate in each phase. However, the size of total effort varies according to the software projects under the influence of its size, complexity and operational environment. As a result, the allocated effort in each phase also differs from one project to another. This paper suggests models for effort allocation in planning, specifying, building, testing and implementing phases followed by the project size and development types. These models are derived from 155 different projects. Therefore, these models can be considered as a practical guideline in management of project schedule and effort allocation.

• Journal of Korean Society on Water Environment
• /
• v.32 no.5
• /
• pp.450-457
• /
• 2016

The Total Maximum Daily Load (TMDL) is a watershed management system that involves the establishment of the target water quality, the calculation of permission loading (allocation loading), and the control of total pollutants for each unit watershed. Allocation loading is assessed through the comprehensive implementation assessment of the previous year's plan. Assessment results are used for follow-up management measures such as the limit of development and updating of TMDL Management Implementation Plans for the next planning period. Although detailed assessment criteria are important, they are not currently available. Therefore, we suggested assessment criteria by comparing two methods('integration method' and 'separation method') using combination point and non-point discharge loading. We also examined the penalty criteria considering controllable load local government and updating methods of the TMDL Management Implementation Plan for the next planning period.

• The Journal of Society for e-Business Studies
• /
• v.19 no.1
• /
• pp.43-61
• /
• 2014

This research is an application of game theory to developing the supplier selection and demand allocation mechanism, which are the essential and major research areas of supply chain planning and operation. In this research, the most popular and widely accepted mechanism, the progressive reverse auction is analyzed and compared with the other game theoretic approach, Kalai-Smorodinsky Bargaining Solution in the viewpoint of holistic efficiency of supply chain operation. To logically and exquisitely compare the efficiencies, a heuristic algorithm based on Genetic Algorithm is devised to find the other optimal demand allocation plan. A well known metric, profit-cost ratio, as well as profit functions for both suppliers and buyer has been designed for evaluating the overall profitability of supply chain. The experimental results with synthesis data and supply chain model which were made to mimic practical supply chain are illustrated and analyzed to show how the proposed approach can enhance the profitability of supply chain planning. Based on the result, it can be said that the proposed mechanism using bargainging solution mayguarantee the better profitability for the whole supply chin including both suppliers and buyer, even though quite small portion of buyer's profitability should be sacrified.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.3
• /
• pp.295-306
• /
• 2002

Successful project planning relies on a good estimation of the effort required to complete a project, together with the schedule options that may be available. Despite the extensive research done developing new and better models, existing software effort estimation models are present only the total effort and instantaneous effort function for the software life-cycle. Also, Putnam presents constant effort rate in each phase. However, the size of total effort are variable according to the software projects under the influence of its size, complexity and operational environment. As a result, the allocated effort in each phase also differ from project to project. This paper suggests the criteria for effort allocation in planning, specifying, building, testing and implementing phase followed by the project total effort. These criteria are derived from 183 different projects. This result can be considered as a practical guideline in management of project schedule and effort allocation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.216-224
• /
• 2000

The spatial layout planning system allocates rectangular resources in the limited space according to user requirements, This system also can optimizes the spatial allocation problem to maximize the user's requirement. The spatial layout planning Problems for this system can be solved by searching a wide area of space since this problem entails the non-polynomial algorithm. By accommodating the user's dynamic requirements, the modification of a specific space and the redesign of the whole area can be accomplished. In this paper, the spatial layout planning problem is solved efficiently with a resource allocation method based on CSP. The dynamic constraints by adding user requirements are accommodated through the intelligent user Interface. The 3-D layout on the web environment by using VRML is also shown for providing for the visual verification of the 2-D layout and, thereafter, the additional modification of the 2-D layout.

• Journal of Software Engineering Society
• /
• v.26 no.4
• /
• pp.77-92
• /
• 2013

To plan a software project, the manager (1)make a work breakdown structure (WBS), (2) estimate efforts for each task, (3) assign employee to each task, and (4) estimate overall schedule. When software project becomes complicated, the possible combination of WBS, effort, and employee assignments dramatically becomes larger. Software planning tool can help software project managers to deal with this complexity. In this research, we discuss with a group of experts who work in software industry, to elicit practical requirements that should be considered in the software planning technique. Considering these requirements, we develop a software project planning tool APP (Automatic Project Planner) which provide effort estimation based on historical knowledge data and automatic human resource allocation. Our technique can be the basis of reasonable and practical software project planing.

• English Language & Literature Teaching
• /
• v.15 no.3
• /
• pp.223-248
• /
• 2009

Previous research on the impact of pretask planning on subsequent second language (L2) production has mainly focused on the linguistic quality of planned production, while learners' thought processes and perceptions about planning have been relatively less explored. In addition, few previous planning studies have examined whether the learners did in fact follow the pretask instructions, thus leaving the role of pretask instructions in the planning process unexplored. Therefore, the present study investigated whether pretask instructions affect attentional allocation as well as what cognitive operations planners engage in and what their perceptions about planning are. Forty-three Korean EFL classroom learners were divided into two groups: before having time to plan for an oral story retelling task, one group received general instructions, while the other group received specific instructions. The findings, based on both quantitative and qualitative data analysis, indicated no large effects of pretask instructions on the planners' attentional focus. Rather, the qualitative analysis identified a number of other factors that influenced learners' decision making as well as their general processes and approaches to planning and their perceptions about planning and thinking aloud while planning. Implications for L2 teaching as well as limitations of the study are discussed.

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.5 no.9
• /
• pp.17-23
• /
• 1999

The Korean hospitals have been changed a lot from 1970's to 1990's, not only in their space allocation but also in their functions. These changes were affected by the medical development, social atmosphere, increasing population, needs of medical demands, and so on. In this study, we compared net area allocation involve in these affect of hospitals which were built in 1970's, 80's, and 90's, and through this comparison, we analyzed developing tendencies of hospitals. In doing so, we tried to provide basic research data for planning of new hospital buildings.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.1
• /
• pp.1-10
• /
• 2003

A recent trend In flexible manufacturing systems (FMS) Is to utilize the Identical versatile machines with fast tool delivery devices. Unlike a conventional FMS where parts are fed to the machines with the required tools, tools are acquired from other machines using a tool delivery system and parts can be finished on the same machine In these FMS. Therefore it Is more important problem 4o plan tool flow using tool delivery system In these FMS rather than part flow In conventional FMS. According to the existing study, In FMS 20∼30 percent of the total management cost Is the cost related with tools and It Is possible to reduce the tool Inventory by 40 percent using efficient tool allocation. In this study, In FMS under dynamic tool allocation strategy, a new method of part release considering tool flow at the stage of part release Is proposed. In order to prove the efficiency of the proposed part release It is compared with other part release through simulation experiments. Performance measures in these experiments are the throughput and the number of tardy parts.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.4
• /
• pp.175-187
• /
• 2004

We consider the simultaneous selection of part routes for multiple part types in Flexible Manufacturing Systems (FMSs). Using an optimization framework we investigate two alternative route assignment policies. The one, called routing mix policy in the literature, specifies the optimal proportion of each part type to be produced along its alternative routes, assuming that the proportions can be kept during execution. The other one, which we propose and call pallet allocation policy, partitions the pallets assigned to each part type among the routes. The optimization framework used is a nonlinear programming superimposed on a closed queueing network model of an FMS which produces multiple part types with distinct repeated visits to certain workstations. The objective is to maximize the weighted throughput. Our study shows that the simultaneous use of multiple routes leads to reduced bottleneck utilization, improved workload balance, and a significant increase in the FMS's weighted throughput, without any additional capital investments. Based on numerical work, we also conjecture that pallet allocation policy is more robust than routing mix policy, operationally easier to implement, and may yield higher revenues.