• The Journal of the Korea Contents Association
• /
• v.13 no.10
• /
• pp.27-36
• /
• 2013

Recently, as researches on VANET have actively progressed, the convenient and reliable services can be provided to the vehicles. In this paper, we propose the collaborative RSU scheduling scheme using multiple RSUs which are connected through a wired backbone. The proposed scheme efficiently disseminates both unsafety data and safety data, and reduces the deadline miss rate and the average response time. When safety data is occurred, it is send to previous RSU in advance and is scheduled by deadline and reception rate. We provide the prevention technology for unsafety data when the workload is occurred in RSU because it is on-demand data processed by user requests. It is shown through performance evaluation that the proposed scheme outperforms the existing scheme in terms of the deadline miss rate and the average response time according to the number of vehicles and the velocities of vehicles.

• Journal of Korean Society of Transportation
• /
• v.24 no.7 s.93
• /
• pp.129-138
• /
• 2006

After Seoul has introduced semi-public bus management system(public management-private operation), the Seoul Metro Government needs a scientific management tool for optimal scheduling for bus routes, to reduce unnecessary operations and provide demand responsive service. As a product of this effort, this paper proposes a heuristic model that could minimize total passenger waiting time under the constraints, such as number of vehicles, working conditions, max load point, minimax headway. etc. For verifying the validity of the proposed model, it is applied to an existing bus route. It results that headways in rush hours become decreased and the passenger waiting time could be decreased. In conclusion. it is thought that the Proposed model contributes to efficiency of bus operation.

• Journal of Korean Society of Water and Wastewater
• /
• v.32 no.5
• /
• pp.421-434
• /
• 2018

Water supply/intake pumps operation use 70~80% of power costs in water treatment plants. In the water treatment plant, seasonal and hourly differential electricity rates are applied, so proper pump scheduling can yield power cost savings. Accordingly, the purpose of this study was to develop an optimal water supply pump scheduling scheme. An optimal operation method of water supply pumps by using genetic algorithm was developed. Also, a method to minimize power cost for water supply pump operation based on pump performance derived from the thermodynamic pump efficiency measurement method was proposed. Water level constraints to provide sufficient disinfection performance in a clearwell and reservoirs were calibrated. In addition, continuous operation time constraints were calibrated to prevent frequent pump switching. As a result of optimization, savings ratios during 7 days in winter and summer were 4.5% and 5.1%, respectively. In this study, the method for optimal water pump operation was developed to secure disinfection performance in the clearwell and to save power cost. It is expected that it will be used as a more advanced optimal water pump operation method through further studies such as water demand forecasting and efficiency according to pump combination.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.1046-1053
• /
• 2003

Recently various new model of teaching-learning as web based education system has been proposed. The demand for the customized courseware which is required from the learners is increased, the needs of the efficient and automated education agents in the web-based instruction are recognized. But many education systems that had been studied recently did not service fluently the courses which learners had been wanting and could not provide the way for the learners to study the teaming weakness which is observed in the continuous feedback of the course. In this paper we propose a multi-agent system for course scheduling of learner-oriented using weakness analysis algorithm. First proposed system analyze learner's result of evaluation and calculates teaming accomplishment. From this accomplishment the multi-agent schedules the suitable course for the learner The learner achieves an active and complete learning from the repeated and suitable course.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.6
• /
• pp.1848-1868
• /
• 2014

Multiple-in multiple-out (MIMO) in long-term evolution (LTE) is an essential factor in achieving high speed data rates and spectral efficiency. The unexpected growth in data rate demand has pushed researchers to extend the benefits of multi-user MIMO. The multi-user MIMO system can take full advantage of channel conditions by employing efficient adjustment techniques for scheduling, and by assigning different modulation and coding rates. However, one of the critical issues affecting this feature is the appropriate estimation of channel quality indicator (CQI) to manage the allocated resources to users. Therefore, an accurate CQI estimation scheme is required for the multi-user MIMO transmission to obtain significant improvements on spectral efficiency. This paper presents overviews of multi-user MIMO in LTE/LTE-advanced systems. The link adaptation, scheduling process, and different factors that affect the reliability of CQI measurements are discussed. State-of-the-art schemes for the post-processing CQI estimation, and the comparisons of various CQI estimation schemes to support multi-user MIMO are also addressed.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.3
• /
• pp.77-86
• /
• 2012

We consider the capacitated lot-sizing and scheduling problem for a paper remanufacturing system that produces several types of corrugated cardboards. The problem is to determine the lot sizes as well as the sequence of lots for the objective of minimizing the sum of setup and inventory holding costs while satisfying the demand and the machine capacity over a given planning horizon. In particular, the paper remanufacturing system has sequence-dependent setup costs that depend on the type of product just completed and on the product to be processed. Also, the setup state at one period can be carried over to the next period. An integer programming model is presented to describe the problem. Due to the complexity of the problem, we modify the existing two-stage heuristics in which an initial solution is obtained and then it is improved using a multi-pass interchange method. To show the performances of the heuristics, computational experiments were done using the real data, and a significant amount of improvement is reported.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.365-373
• /
• 2005

Ubiquitous learning environment needs various new model of e-learning as web based education system has been proposed. The demand for the customized courseware which is required from the learners is increased. the needs of the efficient and automated education agents in the web-based instruction are recognized. But many education systems that had been studied recently did not service fluently the courses which learners had been wanting and could not provide the way for the learners to study the learning weakness which is observed in the continuous feedback of the course. In this paper we propose a multi-agent system for course scheduling of learner-oriented using weakness analysis algorithm via personalized ubiquitous environment factors. First proposed system analyze learner's result of evaluation and calculates learning accomplishment. From this accomplishment the multi-agent schedules the suitable course for the learner. The learner achieves an active and complete learning from the repeated and suitable course.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.12
• /
• pp.673-681
• /
• 2004

As the use of digital videos is getting popular, there is an increasing demand for efficient browsing and retrieval of video. To support such operations, effective video indexing should be incorporated. One of the most fundamental steps in video indexing is to parse video stream into shots and scenes. Generally, it takes long time to parse a video due to the huge amount of computation in a traditional single computing environment. Previous studies had widely used Round Robin scheduling which basically allocates tasks to each slave for a time interval of one quantum. This scheduling is difficult to adapt in a heterogeneous environment. In this paper, we propose two different parallel parsing algorithms which are Size-Adaptive Round Robin and Dynamic Size-Adaptive Round Robin for the heterogeneous distributed computing environments. In order to show their performance, we perform several experiments and show some of the results.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.3
• /
• pp.137-148
• /
• 2012

Cloud service users request dedicated virtual computing resource from the cloud service provider to process jobs in independent environment from other users. To optimize this process with automated method, in this paper we proposed a framework for workflow scheduling in the cloud environment, in which the core component is the middleware called broker mediating the interaction between users and cloud service providers. To process jobs in on-demand and virtualized resources from cloud service providers, many papers propose scheduling algorithms that allocate jobs to virtual machines which are dedicated to one machine one job. With this method, the isolation of being processed jobs is guaranteed, but we can't use each resource to its fullest computing capacity with high efficiency in resource utilization. This paper therefore proposed a cost-efficient job scheduling algorithm which maximizes the utilization of managed resources with increasing the degree of multiprogramming to reduce the number of needed virtual machines; consequently we can save the cost for processing requests. We also consider the performance degradation in proposed scheme with thrashing and context switching. By evaluating the experimental results, we have shown that the proposed scheme has better cost-performance feature compared to an existing scheme.

• KOREAN JOURNAL OF PACKAGING SCIENCE & TECHNOLOGY
• /
• v.28 no.3
• /
• pp.183-192
• /
• 2022

With the growth of the packaging industry, demand on the packaging printing comes in various forms. Customers' orders are diversifying and the standards for quality are increasing. Offset printing is mainly used in the packaging printing since it is easy to print in large quantities. However, productivity of the offset printing decreases when printing various order. This is because it takes time to change colors for each printing unit. Therefore, scheduling that minimizes the color replacement time and shortens the overall makespan is required. By the existing manual method based on workers' experience or intuition, scheduling results may vary for workers and this uncertainty increase the production cost. In this study, we propose an automated scheduling method of parallel offset printing process for packaging printing. We decompose the original problem into assigning and sequencing orders, and ink arrangement for printing problems. Vehicle routing problem and assignment problem are applied to each part. Mixed integer programming is used to model the problem mathematically. But it needs a lot of computational time to solve as the size of the problem grows. So guided local search algorithm is used to solve the problem. Through actual data experiments, we reviewed our method's applicability and role in the field.