• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.25-33
• /
• 2014

This paper proposes a power-efficient scheduling scheme that stochastically minimizes the power consumption of real-time tasks while meeting their deadlines on multicore processors. In the proposed scheme, uncertain computation amounts of given tasks are translated into probabilistic computation amounts based on their past completion amounts, and the mean power consumption of the translated probabilistic computation amounts is minimized with a finite set of discrete clock frequencies. Also, when system load is low, the proposed scheme activates a part of all available cores with unused cores powered off, considering the leakage power consumption of cores. Evaluation shows that the scheme saves up to 69% power consumption of the previous method.

• Journal of the Korea Society for Simulation
• /
• v.24 no.3
• /
• pp.17-26
• /
• 2015

A cluster tool used in many kinds of semiconductor processes for improving the performance and the quality of wafers has a simple configuration, but its schedule is not easy because of its parallel processing module, a lack of intermediate buffers, and time constraints. While there have been many studies on its schedule, most of them have focused on full cycles in which identical work cycles are repeated under constant task times. In this research, we suggest strategies of start-up transient scheduling which satisfies time constraints and converges into a desirable steady schedule for full work cycle. The proposed schedules are expected robust under the stationary stochastic task times. Finally, we show that the strategies make schedules enters the desirable steady schedule and robust using the simulation.

• Journal of Korean Society for Quality Management
• /
• v.14 no.1
• /
• pp.33-38
• /
• 1986

This paper deals with probabilistic order level inventory system which the quantity ordered at the end of the scheduling period is dependent on lead times. To find an optimal solution, pearson system of distributions is used to approximate the probability density function of the on-order quantity. An example is solved and sensitivity analysis is performed to examine the relation between lead times and the ordering quantity.

• Korean Journal of Construction Engineering and Management
• /
• v.5 no.6 s.22
• /
• pp.72-79
• /
• 2004

Critical Path-based project management has been applied to the construction projects with a goal of delivering projects within original costs and time estimates. These current project management methods, rarely make early finishes of construction Projects. In addition, current practices on time management seems not to take advantages of early finishes concepts due to student syndrome and Parkinson's Law, This research study applied the Theory of Constraints(n) in the estimation of construction project duration. While the TOC includes variety of management techniques, in this study, it refers to critical chain that has been used to develop the specific management technique in scheduling. The concept of critical chain is applied to this study to solve the problems associated with the current scheduling method. The efforts focus to solve the p개blems associated with current construction project scheduling methods by adopting both stochastic estimation technique and the concept of schedule buffer,

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.39-60
• /
• 1995

In this paper, an integration of stochastic dynamic programming (SDP), integer goal programming (IGP) and analytic hierarchy process (AHP) is proposed to handle multiobjective-multicriteria sequential decision making problems under uncertainty inherent in R & D investment planning. SDP has its capability to handle problems which are sequential and stochastic. In the SDP model, the probabilities of the funding levels in any time period are generated using a subjective model which employs functional relationships among interrelated parameters, scenarios of future budget availability and subjective inputs elicited from a group of decision makers. The SDP model primarily yields an optimal investment planning policy considering the possibility that actual funding received may be less than anticipated one and thus the projects being selected under the anticipated budget would be interrupted. IGP is used to handle the multiobjective issues such as tradoff between economic benefit and technology accumulation level. Other managerial concerns related to the determination of the optimal project portifolio within each stage of the SDP model. including project selection, project scheduling and annual budget allocation are also determined by the IGP. AHP is proposed for generating scenario-based transformation probabilities under budgetary uncertainty and for quantifying the environmental risk to be considered.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4044-4062
• /
• 2016

We investigate the optimization of energy consumption in Mobile Cloud environment in this paper. In order to optimize the energy consumed by the CPUs in mobile devices, we put forward using the asymptotic time complexity (ATC) method to distinguish the computational complexities of the applications when they are executed in mobile devices. We propose a multi-scale scheme to quantize the channel gain and provide an improved dynamic transmission scheduling algorithm when offloading the applications to the cloud center, which has been proved to be helpful for reducing the mobile devices energy consumption. We give the energy estimation methods in both mobile execution model and cloud execution model. The numerical results suggest that energy consumed by the mobile devices can be remarkably saved with our proposed multi-scale scheme. Moreover, the results can be used as a guideline for the mobile devices to choose whether executing the application locally or offloading it to the cloud center.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2227-2235
• /
• 2018

Under the current policies and compensation rules in South Korea, Photovoltaic (PV) generation supplier can maximize the profit by combining PV generation with Energy Storage System (ESS). However, the existing operational strategy of ESS is not able to maximize the profit due to the limitation of ESS capacity. In this paper, new ESS scheduling algorithm is introduced by utilizing the System Marginal Price (SMP) and PV generation forecasting to maximize the profits of PV generation supplier. The proposed algorithm determines the charging time of ESS by ranking the charging schedule from low to high SMP when PV generation is more than enough to charge ESS. The discharging time of ESS is determined by ranking the discharging schedule from high to low SMP when ESS energy is not enough to maintain the discharging. To compensate forecasting error, the algorithm is updated every hour to apply the up-to-date information. The simulation is performed to verify the effectiveness of the proposed algorithm by using actual PV generation and ESS information.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.3
• /
• pp.13-22
• /
• 2013

Queueing system with scheduled arrivals is useful in many fields where both customers' waiting time and servers' operation time (utilization) are important, and arrival time of customers is possible to be controlled. In this paper, we analyzed the operation of ship maintenance with the queueing system with scheduled arrival. Based on the model presented by Pegden and Rosenshine [8], who dealt with exponential service time, we extended the service time distributions to phase-type distribution which is able to include a wide range of real stochastic phenomena. Since most activities in the military are carried out under tight control and schedule, scheduled arrival queue has quite good applicability in this area. In this context, we applied queue with scheduled arrival to the optimal booking time decision for the ship maintenance in the navy.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2007.11a
• /
• pp.327-330
• /
• 2007

This paper verifies that the normality assumption that the simulation output data, Project Completion Times (PCTs), follow normal distribution is not always acceptable and the existing belief may lead to misleading results. A risk quantification method, which measures the effect caused by the assumption, relative to the probability distribution of PCTs is implemented as an algorithm in MATLAB. To validate the reliability of the quantification, several series of simulation experiments have been carried out to analyze a set of simulation output data which are obtained from different type of Probability Distribution Function (PDF) assigned to activities'duration in a network. The method facilitates to find the effect of PDF type and its parameters. The procedure necessary for performing the risk quantification method is described in detail along with the findings. This paper contributes to improving the reliability of simulation based scheduling method, as well as increasing the accuracy of analysis results.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.350-353
• /
• 2004

The increasing use of Ethernet-TCP/IP network in industry has led to the growing interest in its reliability in real-time applications such as automated manufacturing systems and process control systems. However, stochastic behavior of its medium access scheme makes it inadequate for time-critical applications. In order to guarantee hard real-time communication service in Ethernet-TCP/IP network, we proposed an algorithm running over TCP/IP protocol stack without modification of protocols. In this paper, we consider communication services guaranteeing deadlines of periodic real-time messages over MAC protocols that have unbounded medium access time. We propose a centralized token scheduling scheme for multiple access networks. The token is used to allow a station to transmit its message during the time amount that is appended to the token. The real-time performance of the proposed algorithm has been described.