• 제목/요약/키워드: Idle time optimization

Search Result 16, Processing Time 0.029 seconds

Optimization of theM/M/1 Queue with Impatient Customers

  • Lee, Eui-Yong;Lim, Kyung-Eun
    • International Journal of Reliability and Applications
    • /
    • v.3 no.4
    • /
    • pp.165-171
    • /
    • 2002
  • An optimization of the M/M/1 queue with impatient customers is studied. The impatient customer does not enter the system if his or her virtual waiting time exceeds the threshold K > 0. After assigning three costs to the system, a cost proportional to the virtual waiting time, a penalty to each impatient customer, and also a penalty to each unit of the idle period of the server, we show that there exists a threshold K which minimizes the long-run average cost per unit time.

  • PDF

Fuzzy Inference for Idle Time Optimization of Hard Disk Drive (퍼지 추론을 이용한 하드디스크드라이브의 유휴시간 최적화)

  • Jun, Jin-Wan;Kim, Gyu-Taek;Lee, Jee-Hyong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.3
    • /
    • pp.473-479
    • /
    • 2008
  • Generally, HDDs are widely used as data storage device in office, home and mobile machineries. So, it is used for various applications or tasks, such as file copy, file download, music and movie play etc., in various environment. In spite of this kind of varieties in tasks and environment in which HDDs perform, most commercial HDDs hardly control its operations adaptively to these varieties. Thus, it is preferred to optimize the performance and energy consumption of HDDs according to the task and/or the environment. So, this paper proposes a new fuzzy inference algorithm which adaptively controls HDDs operations and may also easily be implemented as the firmware of HDDs and run in the restricted environment such as embedded systems.

Optimal Block Lifting Scheduling Considering the Minimization of Travel Distance at an Idle State and Wire Replacement of a Goliath Crane (골리앗 크레인의 공주행 거리와 와이어 교체 최소를 고려한 최적 블록 리프팅 계획)

  • Roh, Myung-Il;Lee, Kyu-Yeul
    • Korean Journal of Computational Design and Engineering
    • /
    • v.15 no.1
    • /
    • pp.1-10
    • /
    • 2010
  • Recently, a shipyard is making every effort to efficiently manage equipments of resources such as a gantry crane, transporter, and so on. So far block lifting scheduling of a gantry crane has been manually performed by a manager of the shipyard, and thus it took much time to get scheduling results and moreover the quality of them was not optimal. To improve this, a block lifting scheduling system of the gantry crane using optimization techniques was developed in this study. First, a block lifting scheduling problem was mathematically formulated as a multi-objective optimization problem, considering the minimization of travel distance at an idle state and wire replacement during block lifting. Then, to solve the problem, a meta-heuristic optimization algorithm based on the genetic algorithm was proposed. To evaluate the efficiency and applicability of the developed system, it was applied to an actual block lifting scheduling problem of the shipyard. The result shows that blocks can be efficiently lifted by the gantry crane using the developed system, compared to manual scheduling by a manager.

Optimal Electric Energy Subscription Policy for Multiple Plants with Uncertain Demand

  • Nilrangsee, Puvarin;Bohez, Erik L.J.
    • Industrial Engineering and Management Systems
    • /
    • v.6 no.2
    • /
    • pp.106-118
    • /
    • 2007
  • This paper present a new optimization model to generate aggregate production planning by considering electric cost. The new Time Of Switching (TOS) electric type is introduced by switching over Time Of Day (TOD) and Time Of Use (TOU) electric types to minimize the electric cost. The fuzzy demand and Dynamic inventory tracking with multiple plant capacity are modeled to cover the uncertain demand of customer. The constraint for minimum hour limitation of plant running per one start up event is introduced to minimize plants idle time. Furthermore; the Optimal Weight Moving Average Factor for customer demand forecasting is introduced by monthly factors to reduce forecasting error. Application is illustrated for multiple cement mill plants. The mathematical model was formulated in spreadsheet format. Then the spreadsheet-solver technique was used as a tool to solve the model. A simulation running on part of the system in a test for six months shows the optimal solution could save 60% of the actual cost.

Auto Regulated Data Provisioning Scheme with Adaptive Buffer Resilience Control on Federated Clouds

  • Kim, Byungsang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5271-5289
    • /
    • 2016
  • On large-scale data analysis platforms deployed on cloud infrastructures over the Internet, the instability of the data transfer time and the dynamics of the processing rate require a more sophisticated data distribution scheme which maximizes parallel efficiency by achieving the balanced load among participated computing elements and by eliminating the idle time of each computing element. In particular, under the constraints that have the real-time and limited data buffer (in-memory storage) are given, it needs more controllable mechanism to prevent both the overflow and the underflow of the finite buffer. In this paper, we propose an auto regulated data provisioning model based on receiver-driven data pull model. On this model, we provide a synchronized data replenishment mechanism that implicitly avoids the data buffer overflow as well as explicitly regulates the data buffer underflow by adequately adjusting the buffer resilience. To estimate the optimal size of buffer resilience, we exploits an adaptive buffer resilience control scheme that minimizes both data buffer space and idle time of the processing elements based on directly measured sample path analysis. The simulation results show that the proposed scheme provides allowable approximation compared to the numerical results. Also, it is suitably efficient to apply for such a dynamic environment that cannot postulate the stochastic characteristic for the data transfer time, the data processing rate, or even an environment where the fluctuation of the both is presented.

Resource Allocation and Offloading Decisions of D2D Collaborative UAV-assisted MEC Systems

  • Jie Lu;Wenjiang Feng;Dan Pu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.1
    • /
    • pp.211-232
    • /
    • 2024
  • In this paper, we consider the resource allocation and offloading decisions of device-to-device (D2D) cooperative UAV-assisted mobile edge computing (MEC) system, where the device with task request is served by unmanned aerial vehicle (UAV) equipped with MEC server and D2D device with idle resources. On the one hand, to ensure the fairness of time-delay sensitive devices, when UAV computing resources are relatively sufficient, an optimization model is established to minimize the maximum delay of device computing tasks. The original non-convex objective problem is decomposed into two subproblems, and the suboptimal solution of the optimization problem is obtained by alternate iteration of two subproblems. On the other hand, when the device only needs to complete the task within a tolerable delay, we consider the offloading priorities of task to minimize UAV computing resources. Then we build the model of joint offloading decision and power allocation optimization. Through theoretical analysis based on KKT conditions, we elicit the relationship between the amount of computing task data and the optimal resource allocation. The simulation results show that the D2D cooperation scheme proposed in this paper is effective in reducing the completion delay of computing tasks and saving UAV computing resources.

Rules of Three Untrained Workers' Assignment Optimization in Reset Limited-Cycled Model with Multiple Periods

  • Song, Peiya;Kong, Xianda;Yamamoto, Hisashi;Sun, Jing;Matsui, Masayuki
    • Industrial Engineering and Management Systems
    • /
    • v.14 no.4
    • /
    • pp.372-378
    • /
    • 2015
  • In labor-intensive enterprise, such as garment factory, assembly line is widely used as a manufacturing process for reducing costs and production time. However, for the sake of the various working capacity of worker, idle or delay may happen and influence the rear processes. If these unforeseeable delay happened continuously, it may influence the whole manufacturing process and a model, which is called limited-cycle model with multiple periods (LCMwMP), is assumed to evaluate the influence risk. In order to minimize the risk, the assignment of the workers is focused on. In this paper, we deal with an assembly line as LCMwMP model when two kinds of workers exist, whose efficiency is assumed to two different groups. We consider an optimization problem for finding an assignment of workers to the line that minimizes total expected risk, which is exchanged to expected cost by reset model of LCMwMP. First, reset model as a simple model of LCMwMP is introduced. Then, some hypotheses of the rules of the optimal worker assignment are proposed and some numerical experiments are researched assuming the processing time as Erlang distribution. Finally, the other rules on other certain conditions are discussed.

Optimal Throughput of Secondary Users over Two Primary Channels in Cooperative Cognitive Radio Networks

  • Vu, Ha Nguyen;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.12 no.1
    • /
    • pp.1-7
    • /
    • 2012
  • In this paper, we investigated the throughput of a cognitive radio network where two primary frequency channels (PCs) are sensed and opportunistically accessed by N secondary users. The sharing sensing member (SSM) protocol is introduced to sense both PCs simultaneously. According to the SSM protocol, N SUs (Secondary User) are divided into two groups, which allows for the simultaneous sensing of two PCs. With a frame structure, after determining whether the PCs are idle or active during a sensing slot, the SUs may use the remaining time to transmit their own data. The throughput of the network is formulated as a convex optimization problem. We then evaluated an iterative algorithm to allocate the optimal sensing time, fusion rule and the number of members in each group. The computer simulation and numerical results show that the proposed optimal allocation improves the throughput of the SU under a misdetection constraint to protect the PCs. If not, its initial date of receipt shall be nullified.

A Generalized N-Policy for an M/M/1 Queueing System and Its Optimization

  • Bae, Jong-Ho;Kim, Jong-Woo;Lee, Eui-Yong
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2002.05a
    • /
    • pp.61-66
    • /
    • 2002
  • We consider a generalized N-policy for an M/M/1 queueing system. The idle server starts to work with ordinary service rate when a customer arrives. If the number of customers in the system reaches N, the service rate gets faster and continues until the system becomes empty. Otherwise, the server finishes the busy period with ordinary service rate. We obtain the limiting distribution of the number of customers in the system. After assigning various operating costs to the system, we show that there exists a unique fast service rate minimizing the long-run average cost per unit time.

  • PDF

Technology of thin Film Formation by Using the Micro Gravure Coater (마이크로 그라비어 코터를 이용한 박막 형성 기술)

  • Kim, Dong Soo;Kim, Jung Su;Bae, Sung Woo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.30 no.6
    • /
    • pp.596-600
    • /
    • 2013
  • We report here on the processing and manufacturing of thin film for printed electronics by micro-gravure coating system. The micro-gravure coating systems are consisted of various modules such as web and system tension controller, micro-gravure coating units, dispenser and hybrid dry units (UV, NIR, Hot air). Especially, for the optimization of system, the number of idle roller was minimized and tension isolating infeeder was included. Also, we applied four patterns circle, 45 degree, square and 35 degree for the optimizing coating thickness. The micro-gravure coating system which applied various patterns to enable continuous coating process and fast coating time compare with conventional batch coating system. In this paper, introduce of micro-gravure coating system and testing results of coating thickness (20~700nm), coating time (1~2sec) and surface roughness (3~12nm) by using micro-gravure coating system.