• IE interfaces
• /
• v.22 no.1
• /
• pp.1-9
• /
• 2009

As the LCD fabrication factories (Fab) are highly capital-intensive and the markets are very competitive, it is an essential requirement of operational management to achieve full-capacity production while meeting customer demands on time. In a typical LCD Fab, medium-term schedules such as release plans and production plans are critical to achieve the goal of full-capacity production and on-time delivery. Presented in this paper is a framework for weekly planning system generating medium-term schedules using a finite-capacity planning method. Also this paper presents a release planning method applying capacityfiltering algorithm, especially backward capacity-filtering procedure, which is one of the finite-capacity planning methods. In addition, performance analyses using actual data of a TFT-LCD Fab show that the proposed method is superior to existing methods or commercial S/W products generating release plans.

• 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 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.

• Korean Journal of Environment and Ecology
• /
• v.37 no.6
• /
• pp.484-498
• /
• 2023

This study aimed to analyze the appropriateness of the criteria and methods of the feasibility study for national park re-planning. The rate of 'release area' was derived at a lower rate in the absolute evaluation (the second) than the relative evaluation(the third) Seoraksan and Juwangsan National Parks as well as Gayasan National Park. Despite the third evaluation method aiming to maintain park area through retention by setting the areas available for release as 10% rather than applying release, it was found that the absolute evaluation method did not derive more areas available for release. When the second and third ecology-based assessments were applied to study sites, both second and third ecological-based assessments showed that the actual release areas were not reflected in the extraction in 2011. Consequently, it was found that the ecological-based assessment was only a means of assistance instead of a means of critical decision-making for determining the release area. From the district adjustment of the park planning easibility study, it can be determined that interactive exchange and priority application of release criteria as external factors acted more significantly.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.2
• /
• pp.57-63
• /
• 2012

Software release planning model of software product lines was formulated as a precedence-constrained multiple 0-1 knapsack problem. The purpose of the model was to maximize the total profit of an entire set of selected features in a software product line over a multi-release planning horizon. The solution approach is a dynamic programming procedure. Feasible solutions at each stage in dynamic programming are determined by using backward dynamic programming approach while dynamic programming for multi-release planning is forward approach. The pre-processing procedure with a heuristic and reduction algorithm was applied to the single-release problems corresponding to each stage in multi-release dynamic programming in order to reduce the problem size. The heuristic algorithm is used to find a lower bound to the problem. The reduction method makes use of the lower bound to fix a number of variables at either 0 or 1. Then the reduced problem can be solved easily by the dynamic programming approaches. These procedures keep on going until release t = T. A numerical example was developed to show how well the solution procedures in this research works on it. Future work in this area could include the development of a heuristic to obtain lower bounds closer to the optimal solution to the model in this article, as well as computational test of the heuristic algorithm and the exact solution approach developed in this paper. Also, more constraints reflecting the characteristics of software product lines may be added to the model. For instance, other resources such as multiple teams, each developing one product or a platform in a software product line could be added to the model.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.1
• /
• pp.38-49
• /
• 2017

In general, railroad operation companies sell tickets to maximize their profits by applying the ticketing release time (when selling any tickets regardless of trip distances). This study is to analyze the effect of the release time on KTX ticket reservation behavior. The reservation behavior in this study means the reservation time calculated by difference between ticketing time and departure time. The data come from KTX ticket sales data of Gyeongbu-line for a week including Saturday and Sunday. The results show that the factors to affect the reservation time are day of the week, trip distance and operation direction, in addition to the release time. Furthermore, most of tickets were reserved three hours before their departure time, and most of the up line weekend users reserved their tickets a day before the departure time. Before the release time, reservation time was affected by up line and long distance travel. On the other hand, after the release time, it was affected by long distance travel and Sunday.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.305-305
• /
• 1996

• Journal of Fashion Business
• /
• v.8 no.6
• /
• pp.90-102
• /
• 2004

The purpose of this research is to identify the phases of the fashion merchandising process and the range of the fashion designer's work as well as performing degree at each stage according to the brand types of domestic women's apparel. The preliminary research was conducted with the chief designers of five woman's apparel manufactures located in Seoul and the questionnaires were collected from 192 fashion designers. They were measured by the five point Likert-type scales. For a data analysis, the Pearson's Correlation, ANOVA, Sheffe Test, MANOVA were used with SPSS V. 11.0. The results are as follows; 1. The steps which fashion designers of domestic apparel brand take in fashion merchandising process have been identified in 7 stages- Environment Information, Target Market Planning, Design Planning, Design Development, Price Settlement, Presentation & Line Release, Production. 2. The task achievement level of fashion designers in fashion merchandising process differs in brand types as well as in fashion merchandising stages. In NB, the designer's work was conducted in order of Design Planning(M=4.58)$\to$Presentation & Line release(M=4.31)$\to$ Environment Information(M=3.83)$\to$Target Market Planning(M=3.13). In DB, in order of Price Settlement (M=4.80)$\to$Production(M=4.33)$\to$Design Development(M=4.27)$\to$Design Planning(M=3.77)$\to$Presentation & Line release(M=3.20)$\to$Environment Information (M2.70). In GB, in order of Production(M=4.38)$\to$Design Planning(M=4.22)$\to$Price Settlement(M4.16)$\to$Environment Information(M=3.83)$\to$Merchandising Target Market (M=3.72)$\to$Design Development(M=3.65). 3. Considering the other factors such as sales, the amount of owning shops, item amounts that are related to the company size, this study shows that only the brand type affects designer's task achievement.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.159-167
• /
• 2015

We consider a wafer lot transfer/release planning problem from semiconductor wafer fabrication facilities to probing facilities with the objective of minimizing the deviation of workload and total tardiness of customers' orders. Due to the complexity of the considered problem, we propose a two-level hierarchical production planning method for the lot transfer problem between two parallel facilities to obtain an executable production plan and schedule. In the higher level, the solution for the reduced mathematical model with Lagrangian relaxation method can be regarded as a coarse good lot transfer/release plan with daily time bucket, and discrete-event simulation is performed to obtain detailed lot processing schedules at the machines with a priority-rule-based scheduling method and the lot transfer/release plan is evaluated in the lower level. To evaluate the performance of the suggested planning method, we provide computational tests on the problems obtained from a set of real data and additional test scenarios in which the several levels of variations are added in the customers' demands. Results of computational tests showed that the proposed lot transfer/planning architecture generates executable plans within acceptable computational time in the real factories and the total tardiness of orders can be reduced more effectively by using more sophisticated lot transfer methods, such as considering the due date and ready times of lots associated the same order with the mathematical formulation. The proposed method may be implemented for the problem of job assignment in back-end process such as the assignment of chips to be tested from assembly facilities to final test facilities. Also, the proposed method can be improved by considering the sequence dependent setup in the probing facilities.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.27 no.5
• /
• pp.38-47
• /
• 2000

Carbon dioxide is a major greenhouse gas causing climate change. This study quantified annual direct and indirect uptake of carbon by urban greenspace, and annual carbon release from vegetation maintenance and fossil fuel consumption. The study area was whole Chuncheon and Kangleung, and also two districts of Kangnam and Junglang in Seoul, cities located in middle Korea. Carbon uptake by urban greenspace played an important role through offsetting carbon release by 6-7% annually in Chuncheon and Kangleung. For Kangnam and Junglang, where the population density was relatively higher, urban greenspace annually offset carbon release by 1-2%. Future possible tree plantings could double annual carbon uptake by existing trees in urban lands (except natural and agricultural lands) of a study city. Based on study results, planning and management guidelines for urban greenspace were suggested to save energy and to reduce atmospheric $CO_2$ concentrations. They included selection of optimum tree species, proper planting location from buildings, design of multilayered planting, amendment of existing regulations for greenspace enlargement, avoidance f intensive vegetation maintenance, and conservation of natural vegetation.