• Title/Summary/Keyword: (Max, +)-linear Systems

Search Result 46, Processing Time 0.029 seconds

Blocking Probability in an M/D/1/K Queue (M/D/1/K 대기행렬에서의 차단확률)

  • Seo, Dong-Won
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.4
    • /
    • pp.241-247
    • /
    • 2008
  • In this study we consider an M/D/1 queue with a finite buffer. Due to the finiteness of the buffer capacity arriving customers can not join the system and turn away without service when the buffer is full. Even though a computational method for blocking probabilities in an M/D/1/K queue is already known, it is very complex to use. The aim of this study is to propose a new way to compute blocking probability by using (max,+)-algebra. Our approach provide a totally different and easier way to compute blocking probabilities and it is, moreover, immediately applicable to more generous queueing systems.

  • PDF

Timetabling and Analysis of Train Connection Schedule Using Max-Plus Algebra (Max-Plus 대수를 이용한 환승 스케줄 시간표 작성 및 분석)

  • Park, Bum-Hwan
    • Journal of the Korean Society for Railway
    • /
    • v.12 no.2
    • /
    • pp.267-275
    • /
    • 2009
  • Max-plus algebra is a nonlinear system comprised of two operations, maximization (max) and addition (Plus), which are corresponding to the addition and the multiplication in conventional algebra, respectively. This methodology is applicable to many discrete event systems containing the state transition with the maximization and addition operation. Timetable with connection is one of such systems. We present the method based on max-plus algebra, which can make up timetable considering transfer and analyse its stability and robustness. In this study, it will be shown how to make up the timetable of the urban train and analyse its stability using Max-Plus algebra.

Buffer Management Method for Multiple Projects in the CCPM-MPL Representation

  • Nguyen, Thi Ngoc Truc;Takei, Yoshinori;Goto, Hiroyuki;Takahashi, Hirotaka
    • Industrial Engineering and Management Systems
    • /
    • v.11 no.4
    • /
    • pp.397-405
    • /
    • 2012
  • This research proposes a framework of buffer management for multi-project systems in the critical chain project management (CCPM) method, expressed in the form of max-plus linear (MPL) representation. Since time buffers are inserted in the projects for absorbing uncertainties in task durations and protecting the completion times, the proposed method provides a procedure for frequently surveying the rates of consumed buffers and the rate of elapsed times. Their relation expresses the performance of the projects which is plotted on a chart through the completed processes. The chart presents the current performance of the projects and their interaction, which alerts managers to make necessary decisions at the right time for managing each project and the entire multi-project system. The proposed framework can analyze the complex system readily, and it enables managers to make an effective decision on scheduling. The effectiveness of the framework is demonstrated through a numerical example.

Determining the Optimal Buffer Sizes in Poisson Driven 3-node Tandem Queues using (Max, +)-algebra ((Max, +)-대수를 이용한 3-노드 유한 버퍼 일렬대기행렬 망에서 최적 버퍼 크기 결정)

  • Seo, Dong-Won;Hwang, Seung-June
    • Korean Management Science Review
    • /
    • v.24 no.1
    • /
    • pp.25-34
    • /
    • 2007
  • In this study, we consider stationary waiting times in finite-buffer 3-node single-server queues in series with a Poisson arrival process and with either constant or non-overlapping service times. We assume that each node has a finite buffer except for the first node. The explicit expressions of waiting times in all areas of the stochastic system were driven as functions of finite buffer capacities. These explicit forms show that a system sojourn time does not depend on the finite buffer sizes, and also allow one to compute and compare characteristics of stationary waiting times at all areas under two blocking rules communication and manufacturing blocking. The goal of this study is to apply these results to an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on stationary waiting times at all nodes. Numerical examples are also provided.

Simplified neuron functions for FPGA evaluations of engineering neuron on gate array and analogue circuit

  • Saito, Masayuki;Wang, Qianyi;Aoyama, Tomoo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.157.6-157
    • /
    • 2001
  • We estimated various neuron functions to construct of engineering neurons, which are the combination of sigmoid, linear, sine, quadric, double/single bended, soft max/minimum functions. These combinations are estimated by the property on the potential surface between the learning points, calculation speed, and learning convergence; because the surface depends on the inference ability of a neuron system; and speed and convergence are depend on the efficiency on the points of engineering applications. After the evaluating discussions, we can select more appropriate combination than original sigmoid function´s, which is single bended function and linear one. The combination ...

  • PDF

Application of (Max, +)-algebra to the Waiting Times in Deterministic 2-node Tandem Queues with Blocking ((Max, +)-대수를 이용한 2-노드 유한 버퍼 일렬대기행렬에서의 대기시간 분석)

  • Seo Dong-Won
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.1
    • /
    • pp.149-159
    • /
    • 2005
  • In this study, we consider characteristics of stationary waiting times in single-server 2-node tandem queues with a finite buffer, a Poisson arrival process and deterministic service times. The system has two buffers: one at the first node is infinite and the other one at the second node is finite. We show that the sojourn time or departure process does not depend on the capacity of the finite buffer and on the order of nodes (service times), which are the same as the previous results. Furthermore, the explicit expressions of waiting times at the first node are given as a function of the capacity of the finite buffer and we are able to disclose a relationship of waiting times between under communication blocking and under manufacturing blocking. Some numerical examples are also given.

Comparison of DBR with CONWIP in a Production Line with Constant Processing Times (상수 공정 시간을 갖는 라인 생산 시스템에서 DBR과 CONWIP의 성능 비교 분석)

  • Lee, Hochang;Seo, Dong-Won
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.4
    • /
    • pp.11-24
    • /
    • 2012
  • We compared a DBR(drum-buffer-rope) system with a CONWIP(constant work-in-process) system in a production line with constant processing times. Based on the observation that a WIP-controlled line production system such as DBR and CONWIP is equivalent to a m-node tandem queue with finite buffer, we applied a max-plus algebra based solution method for the tandem queue to evaluate the performance of two systems. Numerical examples with 6 workstations were also used to demonstrate the proposed analysis. The mathematical analyses support that CONWIP outperforms DBR in terms of expected waiting time and WIP. Unlike the CONWIP case, sequencing workstations in a DBR affects the performance of the system. Delaying a bottleneck station in a DBR reduces expected waiting time.

IFS DECISION MAKING PROCESSES TO DIFFERENTIAL DIAGNOSIS OF HEADACHE

  • Kim, Soon-Ki
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.264-267
    • /
    • 1998
  • We are dealing with the preliminary diagnosis from the information of headache interview chart. We quantify the qualitative information based on the interview chart by dual scaling. Prototype of fuzzy diagnostic sets and the neural linear regression methods are established with these quantified data, These new methods can be used to classify new patient's tone of diseases with certain degrees of belief and its concerned symptoms. We call these procedures as neural Fuzzy Differential Diagnosis of Headache (NFDDH-1). Also we investigate three measures to medical diagnosis, where relations between symptoms and diseases are described by intutionistic fuzzy set (IFS) data. Two measures are described by nin-max and max-min IFS operators, respectively. Another measure is the similarity degree, i.e., IFS distance between patient's symptoms and prototypes of diseases. We consider some reasonable criteria for three measures in order to determine the label of headache, We will establish hree measures in NFDDH-2 and combine two packages as NFDDH

  • PDF

A DESIGN METHOD OF LYAPUNOV-STABLE MMG FUZZY CONTROLLER

  • Hara, Fumio;Yamamoto, Kazuomi
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.873-876
    • /
    • 1993
  • A fuzzy controller designed by mini-max-gravity(MMG) method is essentially nonlinear with respect to the controller's input and output relationship, and stability analysis is thus needed to construct a stable control system. This paper deals with a design method of a position-type MMG fuzzy controller stable in a sense of Lyapunov when considered is a single-input-single-output linear, stable plant. We first introduce a method to construct a Laypunov function by using an eigen-value of A matrix of the linear, stable plant dynamics and then we derive an asymtotic stability condition in terms of scale factors for fuzzy state variables and controller gain. The stability condition is found reasonably practical through comparing the theoretical stability region with that obtained from simulations.

  • PDF