• Title/Summary/Keyword: Path Management

Search Result 1,721, Processing Time 0.028 seconds

Finding the Workflow Critical Path in the Extended Structural Workflow Schema (확장된 구조적 워크플루우 스키마에서 워크플로우 임계 경로의 결정)

  • Son, Jin-Hyeon;Kim, Myeong-Ho
    • Journal of KIISE:Databases
    • /
    • v.29 no.2
    • /
    • pp.138-147
    • /
    • 2002
  • The concept of the critical path in the workflow is important because it can be utilized In many issues in workflow systems, e.g., workflow resource management and workflow time management. However, the critical path in the contest of the workflow has not been much addressed in the past. This is because control flows in the workflow, generally including sequence, parallel, alternative, iteration and so on, are much more complex than those in the ordinary graph or network. In this paper we first describe our workflow model that has considerable work(low control constructs. They would provide the sufficient expressive power for modeling the growing complexities of today's most business processes. Then, we propose a method to systematically determine the critical path in a workflow schema built by the workflow control constructs described in our workflow model.

A TQM case of Centralized Sequential Decision-making Problem

  • Chang, Cheng-Chang;Chu, Yun-Feng
    • International Journal of Quality Innovation
    • /
    • v.4 no.1
    • /
    • pp.131-147
    • /
    • 2003
  • This paper considers that a public department under specialized TQM manpower constraints have to implement multiple total quality management (TQM) policies to promote its service performance (fundamental goal) by adopting a centralized sequential advancement strategy (CSAS). Under CSAS, the decision-makers (DMs) start off by focusing specialized TQM manpower on a single policy, then transfer the specialized TQM manpower to the next policy when the first policy reaches the predetermined implementation time limit (in terms of education and training). Suppose that each TQM policy has a different desirous education and training goal. When the desirous goals for all TQM policies are achieved, we say that the fundamental goal will be satisfied. Within the limitation of total implementation period of time for all policies, assume the desirous goals for all TQM policies cannot be achieved completely. Under this premise, the optimal implementation sequence for all TQM policies must be calculated to maximize the weighted achievement of the desirous goal. We call this optimization problem a TQM case of "centralized sequential decision-making problem (CSDMP)". The achievement of the desirous goal for each TQM policy is usually affected by the experience in prior implemented policies, which makes solving CSDMP quite difficult. As a result, this paper introduces the concepts of sequential effectiveness and path effectiveness. The structural properties are then studied to propose theoretical methods for solving CSDMP. Finally, a numerical example is proposed to demonstrate CSDMP′s usability.

The Effect of Task Interdependence and User Participation on Software Development Project Performance (업무상호의존성과 사용자참여가 소프트웨어 개발 프로젝트 성과에 미치는 영향)

  • Hong Myung-Hon;Kim Shinkon;Kim Jeonggon
    • Journal of Information Technology Applications and Management
    • /
    • v.12 no.1
    • /
    • pp.213-229
    • /
    • 2005
  • Cost overrun or schedule delay of the software development project happens frequently despite that software developers continue to make every effort for the effective management of the projects. Previous researches have ascertained that these problems are ascribed to the uncertainty of projects and the improper management of the projects. The purposes of this research are to investigate the impacts of user participation and task interdependence on the performance of the projects and also to find out the appropriate project management method to improve the project performance. Even though the model fitness of the path model is proved to be very high, the verification of the hypotheses showed a variety of results including the four verifications and the one refutation of the hypotheses as well as the suggestion of one alternative hypothesis. The contribution of this research is that the integration model is proposed and verified, comprising the relationship among the user participation, the task interdependence, and the performance of software development projects. A project manager can utilize the implication of this research for an effective management of software development project.

  • PDF

A Comprehensive Model for Measuring Information Systems Performance (포괄적인 정보시스템 성과평가모형에 관한 연구)

  • An Bong-Geun;Ju Ki-Jung;Kwon Hae-Ik
    • Korean Management Science Review
    • /
    • v.21 no.2
    • /
    • pp.111-122
    • /
    • 2004
  • Measuring performance of corporate information system has become one of the core issues in that development of the information system requires substantial amount of investments and the system works as a crucial leverage to enhance competitive edge. Most of the previous researches for performance of the information system have narrow and limited focus on such as the effect of user satisfaction and productivity. This paper suggests a model to measures the comprehensive performance which is classified as user scope (user involvement and satisfaction), operational scope (task productivity, task innovation, customer satisfaction, management control) and efficiency scope (financial performance), and to represent the relationship among the scopes by the path analysis model. Followings are conclusions from statistical hypothesis test of the model: (i) user involvement through user satisfaction has positive effect on all the performances in the operational scope, (ii) task innovation and customer satisfaction in the operational scope has statistically significant impact on financial performance but task productivity and management control do not. This conclusion indicates that task productivity and management control has the long term effect in nature, and evaluation of the information system has managerial implication when it Is measured in comprehensive performance which includes internal operational performances as well as financial performance.

AN INTRODUCTION OF NEW SCHEDULING SOFTWARE "BEELINER" BASED ON THE BEELINE DIAGRAMMING METHOD (BDM)

  • Seon-Gyoo Kim
    • International conference on construction engineering and project management
    • /
    • 2013.01a
    • /
    • pp.391-396
    • /
    • 2013
  • As the construction environment has been changing all the times, the techniques for managing the construction projects have been improved accordingly. The schedule management technique, one of the construction management tools, has been evolved as well in order to be adaptable to new construction environment. Most of newly proposed scheduling techniques have been based on the Critical Path Method (CPM) that was proposed in 1956. The CPM is classified into two categories, Arrow Diagramming Method (ADM) and Precedence Diagramming Method (PDM). ADM is so good in the visual format but it cannot express the overlapping relationships between two consecutive activities. On the other hand, PDM can express the overlapping relationships but it is unsatisfactory in the visual format. Recently, as the construction environment becomes more complex and the role of schedule management becomes more and more important, the overlapping expression becomes one of critical factors for scheduling as well. Most of construction project participants prefer more comfortable visual format, however, the scheduling software based on the PDM cannot satisfy their basic requirement. Beeliner, new scheduling software based on the Beeline Diagramming Method (BDM) that was proposed in 2010, was developed in 2012, it can express more flexible overlapping relationships and has superior visual format as well. This paper presents major features and applications of Beeliner, and makes construction professionals understand new scheduling concept and its applications.

  • PDF

A Study of Optimal path Availability Clustering algorithm in Ad Hoc network (에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.278-280
    • /
    • 2012
  • We are propose the position of the node context-awareness information and the validity of the head node in the path according to the clustering how to elect one of the energy efficiency ECOPS (Energy Conserving Optimal path Schedule) algorithm. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution, if the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. ECOPS algorithm that contextual information is contributed for head node selection in topology protocols. The proposed ECOPS algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election show as the entire node lifetime and network management technique improving the network lifetime and efficient management the simulation results.

  • PDF

Path Model Analysis of the Maternal Childhood Attachment, Emotions, Parenting Behaviors and Children's Behavioral Problems (어머니의 아동기 애착, 정서, 양육행동과 아동의 문제행동의 경로모형 분석)

  • Kwahk, So-Hyeon;Kim, Soon-Ok
    • Journal of Families and Better Life
    • /
    • v.24 no.6 s.84
    • /
    • pp.95-116
    • /
    • 2006
  • The purpose of this study was to validate a hypothetical path model of maternal childhood attachment, emotions, parenting behaviors, and child behavioral problems. The research was conducted with 240 sets or mothers and their children 70 mother-child teams from seven counseling organizations including the Children's Counseling Clinic, Community Social Welfare Service Center, and Welfare Service Center for the Disabled in Seoul, Incheon, and Pyeongtaek, and 170 elementary school children from Seoul and their mothers. Consequently, a total of 200 mother-child teams were selected for this study. The data in this study were analyzed with SPSS 12.0 program and LISREL 8.3 program. The result of this study is as follows: (1) Examining the path of paternal attachment and the internalizing and externalizing behavioral problems, it was noted that paternal attachment had the indirect effect of anxiety and over-protection on the path to internalizing problems and the indirect effect of anxiety also noted is that there is a full-mediation of anxiety and over-protection between paternal attachment and the internalizing problems. (2) Examining the path of maternal attachment and the internalizing problems, it was noted that maternal attachment has direct effect on the internalizing problems. Maternal attachment has the indirect effect of self-esteem depression, anxiety and over-protection on the Path, and the indirect effect of self-esteem, anxiety and over-protection. (3) Examining the path of maternal attachment and the externalizing problems, it was noted that maternal attachment has direct effect on the externalizing problems and on the path to the externalizing problems, and maternal attachment has the indirect effect of depression, the indirect effect of self-esteem and authoritarian control, and the indirect effect of self-esteem and depression.

Shortest Path Search Scheme with a Graph of Multiple Attributes

  • Kim, Jongwan;Choi, KwangJin;Oh, Dukshin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.12
    • /
    • pp.135-144
    • /
    • 2020
  • In graph theory, the least-cost path is discovered by searching the shortest path between a start node and destination node. The least cost is calculated as a one-dimensional value that represents the difference in distance or price between two nodes, and the nodes and edges that comprise the lowest sum of costs between the linked nodes is the shortest path. However, it is difficult to determine the shortest path if each node has multiple attributes because the number of cost types that can appear is equal to the number of attributes. In this paper, a shortest path search scheme is proposed that considers multiple attributes using the Euclidean distance to satisfy various user requirements. In simulation, we discovered that the shortest path calculated using one-dimensional values differs from that calculated using the Euclidean distance for two-dimensional attributes. The user's preferences are reflected in multi attributes and it was different from one-dimensional attribute. Consequently, user requirements could be satisfied simultaneously by considering multiple attributes.

Development of Optimal-Path Finding System(X-PATH) Using Search Space Reduction Technique Based on Expert System (전문가시스템을 이용한 최적경로 탐색시스템(X-PATH)의 개발)

  • 남궁성;노정현
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.1
    • /
    • pp.51-67
    • /
    • 1996
  • The optimal path-finding problem becomes complicated when multiple variables are simultaneously considered such as physical route length, degree of congestion, traffic capacity of intersections, number of intersections and lanes, and existence of free ways. Therefore, many researchers in various fields (management science, computer science, applied mathematics, production planning, satellite launching) attempted to solve the problem by ignoring many variables for problem simplification, by developing intelligent algorithms, or by developing high-speed hardware. In this research, an integration of expert system technique and case-based reasoning in high level with a conventional algorithms in lower level was attempted to develop an optimal path-finding system. Early application of experienced driver's knowledge and case data accumulated in case base drastically reduces number of possible combinations of optimal paths by generating promising alternatives and by eliminating non-profitable alternatives. Then, employment of a conventional optimization algorithm provides faster search mechanisms than other methods such as bidirectional algorithm and $A^*$ algorithm. The conclusion obtained from repeated laboratory experiments with real traffic data in Seoul metropolitan area shows that the integrated approach to finding optimal paths with consideration of various real world constraints provides reasonable solution in a faster way than others.

  • PDF

Collision Free Path Planing of Articulated Manipulator for Remote Maintenance Using Sequential Search Method (원격 유지보수용 다관절 조작기의 순차 탐색에 의한 장애물 회피 경로계획)

  • 이종열;송태길;김성현;박병석;윤지섭
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1997.10a
    • /
    • pp.519-522
    • /
    • 1997
  • In this study, the collision free path planning method of the articulated manipulator using sequential search is proposed. This method is to find the joint path of the manipulator with many degrees of freedom from the distal joint to the proximal one. To do this, the initial work space of the gantry manipulator, which is a remote maintenance equipment of the radioactive environment, is defined from the condition that the distal joint configuration is determined by the posture of maintenance. Then, 2-dimensional configuration space with the obstacle area is represented and the collision free path of manipulator is searched in the configuration space. And, this method is verified using the graphic simulation in virtual workcell for the spent fuel disassembling processes. The result of this study can be effectively used in implementing the maintenance processes for the hot cell equipment and enhance the reliability of the spent fuel management.

  • PDF