• Journal of the Korea Society for Simulation
• /
• v.10 no.1
• /
• pp.1-12
• /
• 2001

This article describes the application of discrete event simulation in a process industry (coffee manufacturing) as a daily production-scheduling tool. A large number of end products (around 300), sporadic demand, and limited shelf life of coffee (90 days) make it difficult to generate feasible production schedules manually. To solve this problem, an integrated system was developed incorporating discrete event simulation methodology into scheduling process. The integrated system is comprised of two components: a scheduling program and a simulation model. The scheduling program is used to generate daily schedules for roasting, grinding, and packing coffee. The simulation model uses the generated schedules to simulate the production of coffee and regenerates a modified production schedule. In this paper, each of the components will be described in detail, evaluated in terms of performance factors, and validated with a set of real production data. Although this article focuses on a specific system, we will share our experiences and Intuitions gained and encourage other process industries to develop simulation-based scheduling tools.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.33-51
• /
• 1998

The industrial operation is one of the three basic modes of shipping operation with liner and Tramp operations. Industrial operators usually control vessels of their own or on a time charter to minimize the cost of shipping their cargoes. Such operations abound in shipping of bulk commodities, such as oil, chemicals and ores. This work is concerned with an operational optimization analysis of the fleet owned by a major oil company. a typical industrial operator. The operational optimization problem of the fleet of a major oil company is divided Into two phase problem. The front end corresponds to the optimization problem of the transportation of crude oil. product mix. and the distribution of product oil to comply with the demand of the market. The back end tackles the scheduling optimization problem of the fleet to meet the seaborne transportation demand derived from the front end. A case study reflecting the practices of an international major oil company is demonstrated to make clear the underlying ideas.

• Journal of the Korean Institute of Navigation
• /
• v.23 no.4
• /
• pp.63-76
• /
• 1999

This paper aims at developing an integrated fleet management support system for industrial carriers who usually control the vessels of their own or on a time charter to minimize the cost of shipping their cargoes. The work is mainly concerned with the operational management problem of the fleet owned by a major oil company, a typical industrial carrier. The optimal fleet management problem for the major oil company can be divided into two phase problem. The front end corresponds to the production operation problem of the transportation of crude oil, the refinery operation, and the distribution of product oil to comply with the demand of the market. The back end is to tackle the fleet scheduling problem to meet the seaborne transportation demand derived from the front end. Relevant optimization models for each phase are proposed and described briefly. Then a user-friendly integrated fleet management support system is built based on the proposed optimization models for both ends under Windows environment. A case study reflecting the practices of fleet management problem for the major oil company is carried out by using the system.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.355-364
• /
• 2004

These days, various clustering technologies have been adopted to construct web sites. High performance hardware switches have good performance, but have disadvantage of high cost for constructing small and middle-sized web sites. Now a days, many sites have been constructed with the LVS (Linux Virtual Server), which is free of charge and has good performance. Having a centralized load balancing with one front-end, the LVS causes a bottleneck when it receives all at once. In the paper, we suggest a way to remove the LVS bottleneck by providing multiple front-ends. In this architecture, all of cluster nodes act as both a front-end and a back-end. When the load of a node receiving requests is not large enough, the node responds to the client directly. When the load of a node is large enough, the node send the request to a node which is selected by a scheduling algorithm. The scheduling algorithm is discussed to balance loads between servers. While single front-end cluster raises the throughput curvedly, the multiple front-end cluster raises the throughput linearly.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.60
• /
• pp.67-72
• /
• 2000

In this paper we consider to parallel machines scheduling problems for minimizing mean tardiness that is known NP-complete. This problems is classified into two cases, one of which is the case which processing time are identical and the other, nonidentical. A Tabu Search method is applied to the problems considered in this paper to get an improved solution. To this end, we design move attribute, Tabu attribute and Tabu tenure, and thereafter perform the experiments to the problems.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.11a
• /
• pp.28-33
• /
• 2000

This article describes the application of discrete event simulation in a process industry (coffee manufacturing) as a daily production-scheduling tool. A large number of end products (around 300), sporadic demand, and limited shelf life of coffee (90 days) make it difficult to generate feasible production schedules manually. To solve this problem an integrated system was developed incorporating discrete event simulation methodology into scheduling process. The integrated system is comprised of two components: a scheduling program and a simulation model. The scheduling program is used to generate daily schedules for roasting, grinding, and packing coffee. The simulation model uses the generated schedules to simulate the production of coffee and regenerates a modified production schedule. In this paper, each of the components will be described in detail, evaluated in terms of performance factors, and validated with a set of real production data. Although this article focuses on a specific system, we will share our experiences and intuitions gained and encourage other process industries to develop simulation-based scheduling tools.

• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.433-440
• /
• 2011

In this paper, we propose a new scheduling method that can guarantee reliable jitter by minimizing the queue length variation in the streaming service provisioning such as IPTV and VoD. The amount of traffic to be delivered within a certain time is very fluid because MPEG-4 and H.264 encoders use VBR(Variable Bit Rate) for delivering video streaming traffic. This VBR characteristic increases the end-to-end propagation delay variation when existing scheduling methods are used for delivering video frames. Therefore, we propose the new scheduling method that can minimize change rate of queue length by adaptively controling service rate taking into account the size of bulk incoming packets and arrival rate for bulk streaming traffic. Video frames can be more reliably transmitted through the minimization of the queue length variation using the proposed method. We use the queueing model and also carry out OPNET simulation to validate the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1675-1689
• /
• 2000

We present CReMeS a CORBA-compliant design and implementation of a new real-time communication service. It provides for efficient predictable and scalable communication between information producers and consumers. The CReMeS architecture is based on MidART's Real-Time Channel-based Reflective Memory (RT-CRM) abstraction. This architecture supports the separation of QoS specification between producer and consumer of data and employs a user-level scheduling scheme for communicating real-time tasks. These help us achieve end-to-end predictability and allows our service to scale. The CReMeS architecture provides a CORBA interface to applications and demands no changes to the ORB layer and the language mapping layer. Thus it can run on non real-time Off-The-Shelf ORBs enables applications on these ORBs to have scalable and end-to-end predictable asynchronous communication facility. In addition an application designer can select whether to use an out-of-band channel or the ORB GIOP/IIOP for data communication. This permits a trade-off between performance predictability and reliability. Experimental results demonstrate that our architecture can achieve better performance and predictability than a real-time implementation of the CORBA Even Service when the out-of-band channel is employed for data communication it delivers better predictability with comparable performance when the ORB GIOP/IIOP is used.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.293-300
• /
• 2014

As energy harvesting communication systems emerge, there is a need for transmission schemes that dynamically adapt to the energy harvesting process. In this paper, after exhibiting a finite-horizon online throughput-maximizing scheduling problem formulation and the structure of its optimal solution within a dynamic programming formulation, a low complexity online scheduling policy is proposed. The policy exploits the existence of thresholds for choosing rate and power levels as a function of stored energy, harvest state and time until the end of the horizon. The policy, which is based on computing an expected threshold, performs close to optimal on a wide range of example energy harvest patterns. Moreover, it achieves higher throughput values for a given delay, than throughput-optimal online policies developed based on infinite-horizon formulations in recent literature. The solution is extended to include ergodic time-varying (fading) channels, and a corresponding low complexity policy is proposed and evaluated for this case as well.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.695-704
• /
• 2003

This paper proposes a new scheduling technique to play multimedia data streams in mobile terminals. The paper explores the characteristics of multimedia data streams , firstly. On basis of these characteristics, selection of specific data stream can be possible as well as transcoding protest. Our approach aims at reducing the early-stage delay time more effectively since it makes possible to select and transcodes some specific streams by employing a selection policy rather than transcoding all streams in the playing process Thus, this paper suggests a stream selection policy for the transcoding based on EPOB (End Point of Over Bandwidth). It aims to lower the required bandwidth of multimedia streams than the network bandwidth level and also to minimize early-stage delay time for multimedia streams, which is to be played in mobile terminals.