• The Journal of Bigdata
• /
• v.9 no.1
• /
• pp.141-152
• /
• 2024

In the biopharmaceutical contract manufacturing organization (CMO) business, establishing a production schedule that satisfies the due date for various customer orders is crucial for competitiveness. In a CMO process, each order consists of multiple batches that can be allocated to multiple production lines in small batch units for parallel production. This study proposes a meta-heuristic algorithm to establish a scheduling plan that minimizes the total delivery delay of orders in a CMO process with identical parallel machine. Inspired by biological evolution, the proposed algorithm generates random data structures similar to chromosomes to solve specific problems and effectively explores various solutions through operations such as crossover and mutation. Based on real-world data provided by a domestic CMO company, computer experiments were conducted to verify that the proposed algorithm produces superior scheduling plans compared to expert algorithms used by the company and commercial optimization packages, within a reasonable computation time.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.60-67
• /
• 2001

Multicast Protocol for multimedia service on the Internet can be classified into two types, e.g., source based tree and shared tree according to difference of tree construction method. Shared tree based multicast is known to show outstanding results in the aspect of scalability than source based tree. Generally, There have been lots of researches on the method to satisfy QoS constraints through proper Rendezvous Point (RP) in the shared tree. In addition, as the multicast group members join and leave dynamically in the service time, RP of the shared tree should b be reselected for guranteeing Qos to new member, But, RP reselection method has not been considered generally as the solution to satisfy QoS C constraints. In this paper, new initial RP selection and RP reselection method are proposed, which utilize RTCP (Real Time Control Protocol) report packet fields. Proposed initial RP selection and RP reselection method use RTCP protocol which underlying multimedia application service So, the proposed method does not need any special process for collecting network information to calculate RP. New initial RP selection method s shows better performance than random and topology based one by 40-50% in simulation. Also, RP reselection method improves delay p performance by 50% after initial RP selection according to the member’s dynamicity.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.426-426
• /
• 1999

;There are many sources of uncertainty in a typical production and inventory system. There is uncertainty as to how many items customers will demand during the next day, week, month, or year. There is uncertainty about delivery times of the product. Uncertainty exacts a toll from management in a variety of ways. A spurt in a demand or a delay in production may lead to stockouts, with the potential for lost revenue and customer dissatisfaction. Firms typically hold inventory to provide protection against uncertainty. A cushion of inventory on hand allows management to face unexpected demands or delays in delivery with a reduced chance of incurring a stockout. The proposed strategies are used for the design of a probabilistic inventory system. In the traditional approach to the design of an inventory system, the goal is to find the best setting of various inventory control policy parameters such as the re-order level, review period, order quantity, etc. which would minimize the total inventory cost. The goals of the analysis need to be defined, so that robustness becomes an important design criterion. Moreover, one has to conceptualize and identify appropriate noise variables. There are two main goals for the inventory policy design. One is to minimize the average inventory cost and the stockouts. The other is to the variability for the average inventory cost and the stockouts The total average inventory cost is the sum of three components: the ordering cost, the holding cost, and the shortage costs. The shortage costs include the cost of the lost sales, cost of loss of goodwill, cost of customer dissatisfaction, etc. The noise factors for this design problem are identified to be: the mean demand rate and the mean lead time. Both the demand and the lead time are assumed to be normal random variables. Thus robustness for this inventory system is interpreted as insensitivity of the average inventory cost and the stockout to uncontrollable fluctuations in the mean demand rate and mean lead time. To make this inventory system for robustness, the concept of utility theory will be used. Utility theory is an analytical method for making a decision concerning an action to take, given a set of multiple criteria upon which the decision is to be based. Utility theory is appropriate for design having different scale such as demand rate and lead time since utility theory represents different scale across decision making attributes with zero to one ranks, higher preference modeled with a higher rank. Using utility theory, three design strategies, such as distance strategy, response strategy, and priority-based strategy. for the robust inventory system will be developed.loped.

• The Journal of Society for e-Business Studies
• /
• v.25 no.2
• /
• pp.15-27
• /
• 2020

This study starts with the idea that the process of creating a Gantt Chart for schedule planning is similar to Tetris game with only a straight line. In Tetris games, the X axis is M machines and the Y axis is time. It is assumed that all types of orders can be worked without separation in all machines, but if the types of orders are different, setup cost will be incurred without delay. In this study, the game described above was named Gantris and the game environment was implemented. The AI-scheduling table through in-depth reinforcement learning compares the real-time scheduling table with the human-made game schedule. In the comparative study, the learning environment was studied in single order list learning environment and random order list learning environment. The two systems to be compared in this study are four machines (Machine)-two types of system (4M2T) and ten machines-six types of system (10M6T). As a performance indicator of the generated schedule, a weighted sum of setup cost, makespan and idle time in processing 100 orders were scheduled. As a result of the comparative study, in 4M2T system, regardless of the learning environment, the learned system generated schedule plan with better performance index than the experimenter. In the case of 10M6T system, the AI system generated a schedule of better performance indicators than the experimenter in a single learning environment, but showed a bad performance index than the experimenter in random learning environment. However, in comparing the number of job changes, the learning system showed better results than those of the 4M2T and 10M6T, showing excellent scheduling performance.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2004.11a
• /
• pp.122-125
• /
• 2004

In radiotherapy of tumors in liver, enough planning target volume (PTV) margins are necessary to compensate breathing-related movement of tumor volumes. To overcome the problems, this study aims to obtain patients' body movements by using a moving phantom and an ultrasonic sensor, and to develop respiration gating techniques that can adjust patients' beds by using reversed values of the data obtained. The phantom made to measure patients' body movements is composed of a microprocessor (BS II, 20 MHz, 8K Byte), a sensor (Ultra-Sonic, range 3 cm ${\sim}$3 m), host computer (RS232C) and stepping motor (torque 2.3Kg) etc., and the program to control and operate it was developed. The program allows the phantom to move within the maximum range of 2 cm, its movements and corrections to take place in order, and x, y and z to move successively. After the moving phantom was adjusted by entering random movement data(three dimensional data form with distance of 2cm), and the phantom movements were acquired using the ultra sonic sensor, the two data were compared and analyzed. And then, after the movements by respiration were acquired by using guinea pigs, the real-time respiration gating techniques were drawn by operating the phantom with the reversed values of the data. The result of analyzing the acquisition-correction delay time for the three types of data values and about each value separately shows that the data values coincided with one another within 1% and that the acquisition-correction delay time was obtained real-time (2.34 ${\times}$ 10$^{-4}$sec). This study successfully confirms the clinic application possibility of respiration gating techniques by using a moving phantom and an ultra sonic sensor. With ongoing development of additional analysis system, which can be used in real-time set-up reproducibility analysis, it may be beneficially used in radiotherapy of moving tumors.

• Progress in Medical Physics
• /
• v.18 no.1
• /
• pp.27-34
• /
• 2007

Respiration sating radiotherapy technique developed In consideration of the movement of body surface and Internal organs during respiration, is categorized into the method of analyzing the respiratory volume for data processing and that of keeping track of fiducial landmark or dermatologic markers based on radiography. However, since these methods require high-priced equipments for treatment and are used for the specific radiotherapy. Therefore, we should develop new essential method whilst ruling out the possible problems. This study alms to obtain body surface motion by using the couch based computer-controlled motion phantom (CBMP) and US sensor, and to develop respiration gating techniques that can adjust patients' beds by using opposite values of the data obtained. The CBMP made to measure body surface motion is composed of a BS II microprocessor, sensor, host computer and stopping motor etc. And the program to control and operate It was developed. After the CBMP was adjusted by entering random movement data, and the phantom movements were acquired using the sensors, the two data were compared and analyzed. And then, after the movements by respiration were acquired by using a rabbit, the real-time respiration gating techniques were drawn by operating the phantom with the opposite values of the data. The result of analysing the acquisition-correction delay time for the data value shows that the data value coincided within 1% and that the acquistition-correction delay time was obtained real-time $(2.34{\times}10^{-4}sec)$. And the movement was the maximum movement was 6 mm In Z direction, In which the respiratory cycle was 2.9 seconds. This study successfully confirms the clinical application possibility of respiration gating techniques by using a CBWP and sensor.

• Radiation Oncology Journal
• /
• v.22 no.4
• /
• pp.316-324
• /
• 2004

Purpose : In radiotherapy of tumors in liver, enough planning target volume (PTV) margins are necessary to compensate breathing-related movement of tumor volumes. To overcome the problems, this study aims to obtain patients' body movements by using a moving phantom and an ultrasonic sensor, and to develop respiration sating techniques that can adjust patients' beds by using reversed values of the data obtained. Materials and Methods : The phantom made to measure patients' body movements is composed of a microprocessor (BS II, 20 MHz, 8K Byte), a sensor (Ultra-Sonic, range $3\~3$ m), host computer (RS232C) and stepping motor (torque 2.3 Kg) etc., and the program to control and operate it was developed. The program allows the phantom to move within the maximum range of 2 cm, its movements and corrections to take place In order, and x, y and z to move successively. After the moving phantom was adjusted by entering random movement data (three dimensional data form with distance of 2 cm), and the phantom movements were acquired using the ultra sonic sensor, the two data were compared and analyzed. And then, after the movements by respiration were acquired by using guinea pigs, the real-time respiration gating techniques were drawn by operating the phantom with the reversed values of the data. Results : The result of analyzing the acquisition-correction delay time the three types of data values and about each value separately shows that the data values coincided with one another within $1\%$ and that the acquisition-correction delay time was obtained real-time $(2.34{\times}10^{-4}sec)$. Conclusion : This study successfully confirms the clinic application possibility of respiration gating techniques by using a moving phantom and an ultrasonic sensor. With ongoing development of additional analysis system, which can be used in real-time set-up reproducibility analysis, it may be beneficially used in radiotherapy of moving tumors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.68-78
• /
• 2013

In this paper, we propose an early spectrum sensing(ESS) as an advance preparation for radio-access trial, which enables multi-mode terminals to access the most appropriate radio-access system in a cloud-conceptual base station system where multiple radio access technologies(RATs) coexist. Prior to a random access to one of RATs, a multi-mode terminal conducts a spectrum sensing over entire frequency bands of whole RATs, then select the RAT with the lowest sensing power, that is likely to have the most available spectrum. Thus, an access failure caused by that the selected RAT has no available radio spectrum could be avoidable in advance. In computer simulation, we consider as various RATs as possible. First, circuit and packet systems are taken into consideration. In addition, the packet systems are classified according to the feasibility of carrier aggregation(CA). In case of terminal, three modes are considered with circuit-only, packet-only, and multi-mode. Subsequently, packet traffic is classified into real-time and non-real-time traffic with three different tolerable delay levels. The simulation includes a call process starting with a call generation and ending up with a resource allocation reflecting individual user's QoS requirements and evaluates the proposed scheme in terms of the successful access probability, system access time, system balancing factor and packet loss probability.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.8
• /
• pp.86-96
• /
• 2000

The representative area among the ones whose cost increases as the integration ratio increases is the test area. As the relative cost of hardware decreases, the BIST method has been focued on as the future-oriented test method. The biggest drawback of it is the increasing test time to obtain the acceptable fault coverage. This paper proposed a BIST implementation method to reduce the test times. This method uses an input grouping and test point insertion method, in which the definition of test point is different from the previous one. That is, the test points are defined on the basis of the internal nodes which are the reference points of the input grouping and are merging points of the grouped signals. The main algorithms in the proposed method were implemented with C-language, and various circuits were used to apply the proposed method for experiment. The results showed that the test time could be reduced to at most $1/2^{40}$ of the pseudo-random pattern case and the fault coverage were also increased compared with the conventional BIST method. The relative hardware overhead of the proposed method to the circuit under test decreases as th e size of the circuit to be tested increases, and the delay overhead by the BIST utility is negligible compared to that of the original circuit. That means, the proposed method can be applied efficiently to large VLSI circuits.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.28-41
• /
• 2017

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.