• Journal of applied mathematics & informatics
• /
• 제5권3호
• /
• pp.827-837
• /
• 1998

We consider the M/G/1 queue with instantaneous feed-back. The probabilities of feedback are determined by the state of the underlaying Markov chain. by using the supplementary variable method we derive the generating function of the number of customers in the system. In the analysis it is required to calculate the matrix equations. To solve the matrix equations we use the notion of Ex-tended Laplace Transform.

• Safety and Health at Work
• /
• 제12권1호
• /
• pp.133-135
• /
• 2021

The COVID-19 pandemic has resulted in movement restrictions being instituted globally and the cessation of work at many workplaces. However, during this period, essential services such as healthcare, law enforcement, and critical production and supply chain operations have been required to continue to function. In Singapore, measures were put in place to protect the workers from infection at the workplace, as well as to preserve the operational capability of the essential service in a COVID-19 pandemic environment. This paper critically analyses the measures that were implemented and discusses the extension to broader general industry.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3446-3464
• /
• 2017

Backoff mechanism serves as one of the key technologies in the MAC-layer of wireless mobile networks. The traditional Binary Exponential Backoff (BEB) mechanism in IEEE 802.11 Distributed Coordination Function (DCF) and other existing backoff mechanisms poses several performance issues. For instance, the Contention Window (CW) oscillations occur frequently; a low delay QoS guarantee cannot be provided for real-time transmission, and services with different priorities are not differentiated. For these problems, we present a novel Multi-Priority service differentiated and Adaptive Backoff (MPAB) algorithm over IEEE 802.11 DCF for wireless mobile networks in this paper. In this algorithm, the backoff stage is chosen adaptively according to the channel status and traffic priority, and the forwarding and receding transition probability between the adjacent backoff stages for different priority traffic can be controlled and adjusted for demands at any time. We further employ the 2-dimensional Markov chain model to analyze the algorithm, and derive the analytical expressions of the saturation throughput and average medium access delay. Both the accuracy of the expressions and the algorithm performance are verified through simulations. The results show that the performance of the MPAB algorithm can offer a higher throughput and lower delay than the BEB algorithm.

• 한국유통학회:학술대회논문집
• /
• 한국유통학회 2000년도 추계학술대회 발표논문집
• /
• pp.47-59
• /
• 2000

Following the increasing importance of logistics function in today's company operation, this work explores the mechanism for cooperation within a supply chain, especially between a firm and an independent logistics supplier. We first characterize the optimal linear logistics contract based upon the recent developments in contract theory, and then investigate the effect of such a contract on the firm's inventory policy. The results indicate that the order quantity becomes smaller and the lead time becomes shorter and under the optimal contract than without the incentive scheme. Accordingly, the service level under the optimal contract becomes higher. These findings are in accordance with the literature on vertical control and JIT (Just in Time) philosophy.

• 대한안전경영과학회지
• /
• 제3권1호
• /
• pp.35-44
• /
• 2001

Today's environment of enterprise is changing. They have to face customers' demands with the right product, the right service and supply them at the right time. And aIso cut down logistics and inventory cost and bring up the Profit as much as they can. This means the change of putting enterprise first in importance to putting customer first in importance. therefore to correspond to customer's demand, shorting lead time is becoming a essential condition. The answer to this changes of environment is supply chain management In this study, we use Goldratt's drum-buffer-rope scheduling in between manufacturer and supplier. And when shortage of inventory occur, search for the supply chain's CCR. Pressing CCR for more production, and supply Inventory from logistic center to guide for inventory buffing. using logistic warehouse between manufacturer and supplier, can execute function of buffer.

• 산업경영시스템학회지
• /
• 제30권4호
• /
• pp.103-110
• /
• 2007

The facility location in designing a supply chain network is an important decision problem that gives form, structure, and shape to the entire supply chain system. Location problems involve determining the location, number, and size of the facilities to be used. The optimization of these location decisions requires careful attention to the inherent trade-offs among service time, inventory costs, facility cost, transportation costs. This paper presents a strategy that provides the best locations of distribution centers using GIS(Geographical Information System) assuming the limitation of delivery time. To get the best strategy of the location of distribution centers, we use the new loss functions as a penalty when the delivery time is violated

• 한국컴퓨터정보학회논문지
• /
• 제21권6호
• /
• pp.107-115
• /
• 2016

In this paper, we propose a Bicycle sharing has grown popular around the cities in the world due to its convenience. However, the bicycle sharing system is not problem-free, and there remains many managerial problems to be solved. In this study, we analyzed pricing strategy of a bicycle sharing system by minimizing the number of bicycles relocated by trucks, the act of which incurs penalty. The objective function is constructed by applying mixed integer programming and is presented as a stochastic model by using Markov chain so that arrival and departure rates of bicycle stations can be utilized in the analysis. The efficiency of the presented model is verified upon the analysis of bicycle sharing data gathered in Daejeon in 2014.

• 사물인터넷융복합논문지
• /
• 제4권2호
• /
• pp.13-20
• /
• 2018

본 논문은 최근 대두된 신기술인 '블록체인' 기술을 기반으로 'Single-Sign-On'과 'Token 기반 인증 방식'을 접목한 인증 시스템을 제안하였다. Single-Sign-On 기반 인증 방식에 블록체인 기술을 접목하여 '접근제어' 기능과 '무결성'을 제공하였으며, Token 기반 인증 방식을 사용하여 Stateless한 Self-Contained 인증 기능을 제공하였다. 암호화 기반 Token 발급 및 인증 과정을 수행하여 보안성을 높일 수 있었으며, Web Server에 대한 인증 편리성을 제공하였다. 또한 SSO과 Token 기반 인증을 통해 번거로운 인증 과정을 보다 편리하게 개선할 수 있는 방법을 제시하였다.

• Industrial Engineering and Management Systems
• /
• 제11권1호
• /
• pp.1-10
• /
• 2012

Supplier selection is an essential task within the purchasing function of supply chain management because it provides companies with opportunities to reduce various costs and realize stable and reliable production. However, many companies find it difficult to determine which suppliers should be targeted as each of them has varying strengths and weaknesses in performance which require careful screening by the purchaser. Moreover, information required to assess suppliers is not known precisely and typically fuzzy in nature. In this paper, therefore, fuzzy multi-objective linear programming (fuzzy MOLP) is presented under fuzzy goals: cost minimization, service level maximization and purchasing risk. To solve the problem, we introduce an enhanced two-phase approach of fuzzy linear programming for the supplier selection. In formulated problem, Analytical Hierarchy Process (AHP) is used to determine the weights of criteria, and Taguchi Loss Function is employed to quantify purchasing risk. Finally, we provide a set of alternative solution which enables decision maker (DM) to select the best compromise solution based on his/her preference. Numerical experiment is provided to demonstrate our approach.

• Journal of Communications and Networks
• /
• 제16권2호
• /
• pp.193-201
• /
• 2014

In cognitive radio networks, the packet transmissions of the secondary users (SUs) can be interrupted randomly by the primary users (PUs). That is to say, the PU packets have preemptive priority over the SU packets. In order to enhance the quality of service (QoS) for the SUs, we propose a spectrum access strategy with an ${\alpha}$-Retry policy. A buffer is deployed for the SU packets. An interrupted SU packet will return to the buffer with probability ${\alpha}$ for later retrial, or leave the system with probability (1-${\alpha}$). For mathematical analysis, we build a preemptive priority queue and model the spectrum access strategy with an ${\alpha}$-Retry policy as a two-dimensional discrete-time Markov chain (DTMC).We give the transition probability matrix of the Markov chain and obtain the steady-state distribution. Accordingly, we derive the formulas for the blocked rate, the forced dropping rate, the throughput and the average delay of the SU packets. With numerical results, we show the influence of the retrial probability for the strategy proposed in this paper on different performance measures. Finally, based on the trade-off between different performance measures, we construct a cost function and optimize the retrial probabilities with respect to different system parameters by employing an iterative algorithm.