• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.271-272
• /
• 2008

TD-SCDMA combines TDMA and CDMA components to provide more efficient use of radio resources, and includes a new feature called HSDPA (high-speed downlink packet access) in the R5 stage. The TD-HSDPA supports high-speed traffic with a shared channel, but its uplink mechanism causes feedback problem for scheduling. Since the base station of TD-SCDMA can estimate the location of mobile terminals precisely, it can also estimate the possible path loss. In this paper, the base station utilizes the estimated path loss for scheduling, which is related with CQI (channel quality indicator) values. The proposed mechanism can provide the TD-HSDPA scheduler with an intial CQI value for efficient transmission.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.5
• /
• pp.426-432
• /
• 2000

A novel mixed-integer linear programming model for the short-term scheduling of a sequential multipurpose batch plant is addressed. First, a time slot domain to each unit is introduced. By assigning each time slot to a product, we obtain the production sequence that minimizes makespan. For multiple-unit assignment problem where a few parallel units with the same function exist, production paths are defined for the distinction of the same stage with a different unit. As a second issue, the model adapted for sequence dependent changeover is presented. For a time slot of a unit, if a product is assigned to the time slot and a different product is assigned to the adjacent time slot, the changeover time considering this situation is included. The performance of the proposed models are illustrated through two examples.

• Journal of Korean Institute of Industrial Engineers
• /
• v.11 no.2
• /
• pp.57-73
• /
• 1985

Group scheduling problem in a multi-stage manufacturing system is reviewed and two heuristic procedures for minimizing the makespan are developed by employing the methods of flow shop sequencing heuristics with a slight modification. The comparisons among the five heuristics, three previously reported heuristics and two heuristics suggested by this study, are made on different problem sizes. The computational results indicate that NEH-GS method gives better group schedules than the other heuristics tested, but its computation time increases rapidly as the problem size increases. On the other hand, CDS-GS method provides relatively good group schedules with less computation time compared with NEH-GS method.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.2 no.2
• /
• pp.83-91
• /
• 1999

Dynamic characteristic of manufacturing stage is understood and the utilization of each machine is maximized by developing on-line dynamic CAPP system to consider the overloads in the aircraft part manufacturing line. In this paper, a scheme of production planning and scheduling system was proposed through inspection about some predeveloped CAPP system. Developed production planning and scheduling system included process planning module. After precise inspection of some FMS line schema at domestic heavy industry, optimized FMS line was applied to aircraft part manufacturing and repairing factory. By virtue of considering overloads of factory and machine through on-line dynamic CAPP system, the utilization of resources is maximized and manufacturing lead time is minimized.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.12 no.19
• /
• pp.39-47
• /
• 1989

This paper considers a multi-stage flowshop scheduling Problem where the setup times of jots depend on immediately preceding jobs. Three heuristics algorithms, CAMPBELL, PEIDAN and CAMRING are proposed. The performance measure is a minimization of makespan. The parameters of simulation model are PS(ratio of the processing times to setup times), M(number of machines), and N(number of job). This simulation model for each algorithm is a 4$\times$3$\times$3 factorial design with 360 observations. The makespan of the proposed heuristic algorithms is compared with the optimal makespan obtained by the complete enumeration of schedules. This yardstick of comparison is defined as a relative error. The mean relative error of CAMPBELL, PEIDAN, and CAMRING algorithms are 4.353%, 7.908%, and 8.578% respectively. The SPSS, is used to analyse emphirical results. The experimental results show that the three factors are statistically significant at 5% level.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.1
• /
• pp.86-95
• /
• 2013

The distribution cost increases constantly because of the growth of yield, globalization of accounts and the generalization of e-commerce. This paper is concerned with scheduling on the allocation of workers to maximize the amount of order process in warehouse logistics system. The problem is to determine the number of operators in each process by the sequential time zone. We considered that the number of operators is restricted to the current level and also the process time is changed by putting some resources into the process. In each stage, we suggest some considerations for the allocation of workers and estimate the maximum amount of order process of the alternatives. We analyzed the alternatives using simulation s/w Arena with real cases.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.1248-1251
• /
• 2011

Web Service technologies make the automation of business activities that are distributed across multiple enterprises possible. Existing extended transaction protocols typically resort to compensation actions to regain atomicity and consistency. A reservation-based transaction protocol is proposed to reduce high compensation risk. However, for a serial long running transaction processing, the resource that is reserved in the early stage may be released due to resource holding time expires. Therefore, our analysis theoretically illustrates a scheduling scheme that tries to prevent the loss of resource holding as well as gain an optimized execution plan with minimum compensation cost. In order to estimate cost of different schedules, we set up a costing model and cost metric to quantize compensation risk.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.2
• /
• pp.115-127
• /
• 2006

At the initial design stage, the generation process of the production material information of a building block and the simulation process of the block erection, which are required to perform the production planning and scheduling, have been manually performed by using 2D drawings, data of parent ships, and design experiences. To make these processes automatic, the accurate generation method of the production material information and the convenient simulation method of the block erection using the 3D CAD model, which was generated from the initial hull structural design system early developed by us, were proposed in this study. For this, a 3D CAD model for a whole hull structure was generated first, and the block division method for dividing the 3D CAD model into several building blocks was proposed. The generation method of the production material information for calculating the weight, center of gravity, painting area, joint length, etc. of a building block was proposed as well. Moreover, the simulation method of the block erection was proposed. Finally, to evaluate the efficiency of the proposed methods for the generation of the production material information and the simulation of the block erection, these methods were applied to corresponding processes of a deadweight 300,000 ton VLCC (Very Large Crude oil Carrier). As a result, it was shown that the production material information of a building block can be accurately generated and the block erection can be conveniently simulated in the initial design stage.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.188-198
• /
• 2013

In order to increase its performance, NAND flash memory-based storage is composed of data buses that are shared by a number of flash memories and uses a parallel technique that can carry out multiple flash memory operations simultaneously. Since the storage performance is strongly influenced by the performance of each data bus, it is important to improve the utilization of the bus by ensuring effective scheduling of operations by the storage controller. However, this is difficult because of dynamic changes in buses due to the unique characteristics of each operation with different timing, cost, and usage by each bus. Furthermore, the scheduling technique for increasing bus utilization may cause unanticipated operation delay and wastage of storage resource. In this study, we suggest various dynamic operation scheduling techniques that consider data bus performance and storage resource efficiency. The proposed techniques divide each operation into three different stages and schedule each stage depending on the characteristics of the operation and the dynamic status of the data bus. We applied the suggested techniques to the controller and verified them on the FPGA platform, and found that program operation decreased by 1.9% in comparison to that achieved by a static scheduling technique, and bus utilization and throughput was approximately 4-7% and 4-19% higher, respectively.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.450-453
• /
• 2004

본 연구는 리드타임이 상이한 다단계의 공급 사슬에서 수송비용과 재고비용을 최소화하는 다기간의 차량일정계획 수립에 관한 연구이다. 일반적인 공급사슬모형과 차량일정계획 문제를 통합한 모형으로서, 각 단계의 가용차량과 차량 용량이 제한된 제약조건하에서 비용을 최소화하는 차량일정을 구하는 문제이다. 본 연구에서는 이에 대한 최적화 수리모형과 2단계의 분할해법을 제시하였으며, 다양한 공급사슬모형에 대한 발견적 기법의 성능을 분석하였다.