Korea's Corona 19(COVID-19) quarantine, referred to as 'K-Quarantine', is a globally recognized quarantine system that has achieved both conflicting goals: health and economy. The quarantine system represented by 3T(Test-Trace-Treat) is not a method of blocking an area, but a method of screening and treating infected and non-infected persons. The screening center, one of the key elements of this screening treatment system, has evolved to suit the timing and situation of COVID-19, and has succeeded in initial response by conducting large-scale tests quickly and safely. By analyzing the evolution of screening centers that produced such significant results from a problem-solving point of view, it proved its meaning as a practical success case of creative problem- solving. In addition, the usefulness of TRIZ (Russian abbreviation of Theory of Solving Inventive Problem), a creative problem- solving theory, was confirmed through an analysis of actual verified cases of COVID-19 response. TRIZ is a problem-solving theory created by analyzing the regularity of invention patents, and is widely used not only in the technical field but also in the non-technical fields such as design, management, and education. The results of this study are expected to provide useful meaning and practical examples to researchers interested in system analysis and TRIZ application from a problem-solving perspective.

This study is to propose the paradox management process to analysis and solve the public education’s dilemma between the standardized education and the personalized education. The process is based on combining the TOC(Theory Of Constraints) and TRIZ(Russian Theory of Inventive Problem Solving), which is a creative way of thinking to draw the synergic effect by pursuing simultaneously the conflicting elements. Through this research, a new concept of learning method can be suggested on a public course.

This paper deals with the problem of determining the buyer's economic lot sizing policy for exponentially deteriorating products under trade credit. Assuming that the supplier's credit terms are already known and the length of delay is a function of the buyer's order size, we formulate the mathematical model and the solution algorithm is developed based on the properties of an optimal solution.

This paper deals with the problem of determining the buyer's economic lot sizing policy for exponentially deteriorating products under trade credit. It is also assumed that the ordering cost consists of a fixed set-up cost and a freight cost, where the freight cost has a quantity discount offered due to the economies of scale. We formulate the mathematical model and the solution algorithm is developed based on the properties of an optimal solution.

In today's business transactions, it is more and more common to see that the buyers are allowed some grace period before they settle the account with the supplier. In this regard, we analyze the problem of determining the buyer's EOQ when the supplier allows day-terms credit. For the analysis, it is assumed that the buyer's demand rate is a function of the on -hand inventory level and the relevant mathematical model is developed.

This paper addresses the problem of placing tools in a tool magazine with random-select capability on a flexible machine. The tool placement problem could be a significant portion of the total processing time. It is assumed that the total number of tools required to process a set of parts exceeds the available magazine capacity, and so tool switches may occur between two adjacent parts in a given part sequence. Two heuristics are presented so as to minimize the total travel distance of the tool magazine before the completion of all parts.

This paper analyses the tool switching problem in the dynamic environment, where parts to be processed on a flexible machine arrive randomly. As the total number of tools required to Process a set of parts on the machine is generally larger than the available magazine storage capacity, tool switches between parts are usually necessary. We assume that tool switching must be made just before the processing of the parts. Since the time required for tool switches can be significant relative to processing time and cause the processing of parts to be delayed, it is desirable to minimize the number of tool switches. Therefore, we present one heuristic algorithm to minimize the total number of tool switches and the t)reposed heuristic is compared with the KTNS (Keep Tool Needed Soonest) policy on randomly generated problems.