• Title/Summary/Keyword: large-scale problem

Search Result 950, Processing Time 0.027 seconds

A Study on Integration of Process Planning and Scheduling Using AND/OR Graph (AND/OR 그래프를 이용한 공정계획과 일정계획의 통합에 관한 연구)

  • Kim, Ki-Dong;Jeong, Han-Il;Chung, Dae-Young;Park, Jin-Woo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.2
    • /
    • pp.323-341
    • /
    • 1997
  • Traditionally, the Process Planning problems and the Scheduling problems have been considered as independent ones. However, we can take much advantages by solving the two problems simultaneously. In this paper, we deal with the enlarged problem that takes into account both the process planning and the scheduling problems. And we present a solution algorithm for the problem assuming that the given process plan data is represented by AND/OR graph. A mathematical model(mixed ILP model) whose objective is the minimization of the makespan, is formulated. We found that we can get the optimal solutions of the small-size problems within reasonable time limits, but not the large-size problems. So we devised an algorithm based on the decomposition strategy to solve the large-scale problems (realistic problems) within practical time limits.

  • PDF

Psychological Characteristics according to the Level of Ego-Resilience among Adolescents (청소년 자아탄력성 수준에 따른 정신심리학적 특성)

  • Kim, Sang-Eun;Kim, Seung-Gon;Kim, Sang-Hoon;Park, Sang-Hag;Yoon, Hyung-Jun
    • Journal of the Korean society of biological therapies in psychiatry
    • /
    • v.24 no.3
    • /
    • pp.156-162
    • /
    • 2018
  • Objectives : This study aimed to investigate the relationship between the level of ego-resilience and depression, anxiety, conduct problems and self-esteem in a large sample of Korean adolescents. Methods : A total 4508(2036 males and 2472 females) middle and high school students in Gwang-ju metropolitan city were included in this study. Subjects were asked to complete a self-reported questionnaire, including Ego-Resilience(ER) scale, Beck Depression Inventory(BDI), Beck Anxiety Inventory(BAI), Self-Esteem Scale(SES), 15 items in Korean-Youth Self Report(K-YSR) to measure conduct problems and demographic variables. Subjects were classified into three high, intermediate and low ER group according to total ER scale scores. Results : Total ER scores was positively correlated with total SES scores and negatively correlated with total BDI, BAI, and conduct problem scores. Using analysis ANOVA(analysis and variance) and post hoc test, significant mean differences in BDI, BAI, SES and conduct problem scores were observed among the three groups. High ER group showed that SES scores were significantly higher and BDI, BAI and conduct problem scores were significantly lower than that observed in middle and lower ER group. Using multiple regression analysis, the results showed that depression, low self-esteem were significant factors affecting ego-resilience in adolescents. Conclusion : Our findings indicate that depression, anxiety, behavioral problem such as conduct problems and low self-esteem are associated with low ego-resilience.

The assessment of the Spatial Variation of the Wind Field using the Meso-velocity Scale and its Contributing Factors (중간 속도 규모를 이용한 바람장의 균질성 평가 및 영향요소 분석)

  • Lee, Seong-Eun;Shin, Sun-Hee;Ha, Kyung-Ja
    • Atmosphere
    • /
    • v.20 no.3
    • /
    • pp.343-353
    • /
    • 2010
  • A regional wind network with complex surface conditions must be designed with sufficient space and time resolution to resolve the local circulations. In this study, the spatial variations of the wind field observed in the Seoul and Jeju regional networks were evaluated in terms of annual, seasons, and months to assess the spatial homogeneity of wind fields within the regional networks. The coherency of the wind field as a function of separation distance between stations indicated that significant coherency was sometimes not captured by the network, as inferred by low correlations between adjacent stations. A meso-velocity scale was defined in terms of the spatial variability of the wind within the network. This problem is predictably most significant with weak winds, dull prevailing wind, clear skies and significant topography. The relatively small correlations between stations imply that the wind at a given point cannot be estimated by interpolating winds from the nearest stations. For the Seoul and Jeju regional network, the meso-velocity scale has typically a same order of magnitude as the speed of the network averaged wind, revealing the large spatial variability of the Jeju network station imply topography and weather. Significant scatter in the relationship between spatial variability of the wind field and the wind speed is thought to be related to thermally-generated flows. The magnitude of the mesovelocity scale was significantly different along separation distance between stations, wind speed, intensity of prevailing wind, clear and cloudy conditions, topography. Resultant wind vectors indicate much different flow patterns along condition of contributing factors. As a result, the careful considerations on contributing factors such as prevailing wind in season, weather, and complex surface conditions with topography and land/sea contrast are required to assess the spatial variations of wind field on a regional network. The results in the spatial variation from the mesovelocity scale are useful to represent the characteristics of regional wind speed including lower surface conditions over the grid scale of large scale atmospheric model.

A New Approach for Resource Allocation in Project Scheduling with Variable-Duration Activities

  • Kim, Soo-Young;Leachman, Robert C.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.3
    • /
    • pp.139-149
    • /
    • 1994
  • In many project-oriented production systems, e. g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [13] and by Leachman, Dincerler, and Kim [7[ in extended formulations of the resource-constrained poject scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach : (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationship of the activities also are presented.

  • PDF

A Look-ahead Heuristic Algorithm for Large-scale Part-Machine Grouping Problems (대단위 부품-기계 군집 문제를 위한 Look-ahead 휴리스틱 알고리듬)

  • Baek Jong-Kwan;Baek Jun-Geol;Kim Chang Ouk
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.3
    • /
    • pp.41-54
    • /
    • 2005
  • In this paper, we consider a multi-objective machine cell formation problem. This problem Is characterized as determining part route families and machine cells such that total sum of inter-ceil part movements and maximum machine workload imbalance are simultaneously minimized. Together with the objective function, alternative part routes and the machine sequences of part routes are considered In grouping Part route families. Due to the complexity of the problem, a two-phase heuristic algorithm is proposed. And we developed an n-stage look-ahead heuristic algorithm that generalizes the roll-out algorithm. Computational experiments were conducted to verify the performance of the algorithm.

A new approach for resource allocation in project scheduling with variable-duration activities

  • 김수영;제진권;이상우
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1994.04a
    • /
    • pp.410-420
    • /
    • 1994
  • In many project-oriented production systems, e.g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [131 and by Leachman, Dincerler, and Kim [7] in extended formulations of the resource-constrained project scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach: (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationships of the activities also are presented.

Designing hierarchical ring-star networks under node capacity constraints (설비용량을 고려한 계층적 네트워크의 설계 및 분석)

  • 이창호;윤종화;정한욱
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.1
    • /
    • pp.69-83
    • /
    • 1994
  • This paper deals with a capacitated ring-star network design problem (CRSNDP) with node capacity constraints. The CRSNDP is formulated as a mixed 0-1 integer problem, and a 2-phase heuristic solution procedure, ADD & VAM and RING, is developed, in which the CRSNDP is decomposed into two subproblems : the capacitated facility location problem (CFLP) and the traveling sales man problem (TSP). To solve the CFLP in phase I the ADD & VAM procedure selects hub nodes and their appropriate capacity from a candidate set and then assigns them user nodes under node capacity constraints. In phase II the RING procedure solves the TSP to interconnect the selected hubs to form a ring. Finally a solution of the CRSNDP can be achieved through combining two solution of phase I & II, thus a final design of the capacitated ring-star network is determined. The analysis of computational results on various random problems has shown that the 2-phase heuristic procedure produces a solution very fast even with large-scale problems.

  • PDF

Generalized Vehicle Routing Problem for Reverse Logistics Aiming at Low Carbon Transportation

  • Shimizu, Yoshiaki;Sakaguchi, Tatsuhiko
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.2
    • /
    • pp.161-170
    • /
    • 2013
  • Deployment of green transportation in reverse logistics is a key issue for low carbon technologies. To cope with such logistic innovation, this paper proposes a hybrid approach to solve practical vehicle routing problem (VRP) of pickup type that is common when considering the reverse logistics. Noticing that transportation cost depends not only on distance traveled but also on weight loaded, we propose a hierarchical procedure that can design an economically efficient reverse logistics network even when the scale of the problem becomes very large. Since environmental concerns are of growing importance in the reverse logistics field, we need to reveal some prospects that can reduce $CO_2$ emissions from the economically optimized VRP in the same framework. In order to cope with manifold circumstances, the above idea has been deployed by extending the Weber model to the generalized Weber model and to the case with an intermediate destination. Numerical experiments are carried out to validate the effectiveness of the proposed approach and to explore the prospects for future green reverse logistics.

-Machining Route Selection with the Shop Flow Information Using Genetic Algorithm- (작업장 특성을 고려한 가공경로선정 문제의 유전알고리즘 접근)

  • 이규용;문치웅;김재균
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.54
    • /
    • pp.13-26
    • /
    • 2000
  • Machining route selection to produce parts should be based on shop flow information because of input data at scheduling tasks and is one of the main problem in process planning. This paper addresses the problem of machining route selection in multi-stage process with machine group included a similar function. The model proposed is formulated as 0-1 integer programing considering the relation of parts and machine table size, avaliable time of each machine for planning period, and delivery date. The objective of the model is to minimize the sum of processing, transportation, and setup time for all parts. Genetic algorithm approach is developed to solve this model. The efficiency of the approach is examined in comparison with the method of branch and bound technique for the same problem. Also, this paper is to solve large problem scale and provide it if the multiple machining routes are existed an optimal solution.

  • PDF

ARTIFICIAL ISLANDS RECENTLY CONSTRUCTED IN OSAKA BAY. JAPAN (최근 일본 오사카만에 건설된 세개의 인공섬)

  • T.Akagi
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 1992.10a
    • /
    • pp.11-26
    • /
    • 1992
  • An attempt has been made to summarize some of the unique geotechnical problems encountered during construction of a few large man-made islands recently completed off the coast of Osaka Bay, Japan. Large settlements appear to be the most serious problem both during and after construction. Settlements due to consolidation of a thick layer of soft alluvial clay that constitutes seabed seem to virtually cease within a relatively short period of time when vertical drains are installed adequately prior to fill placement. Settlements due to compression of underlying thick diluvial deposits consisting of layers of stiff clays interbedded with coarse-grained soils, however, continue over a prolonged period of time and call for special provisions for structures built on the artificial islands to cope with relatively large future settlements. Although accurate settlement prediction is not possible, it is both technically and economically feasible, nevertheless, to construct large-scale islands. Partjcularly attractive and promising is creation of sizable new areas for various purposes, immediately adjacent to highly-developed, densely-populated cities situated along the coast such as those around Osaka Bay.

  • PDF