On a Single Server Queueing Inventory System

Author(s):  
K. A. K. AL Maqbali ◽  
V. C. Joshua ◽  
A. Krishnamoorthy
2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
R. Jayaraman ◽  
B. Sivakumar ◽  
G. Arivarignan

A mathematical modelling of a continuous review stochastic inventory system with a single server is carried out in this work. We assume that demand time points form a Poisson process. The life time of each item is assumed to have exponential distribution. We assume(s,S)ordering policy to replenish stock with random lead time. The server goes for a vacation of an exponentially distributed duration at the time of stock depletion and may take subsequent vacation depending on the stock position. The customer who arrives during the stock-out period or during the server vacation is offered a choice of joining a pool which is of finite capacity or leaving the system. The demands in the pool are selected one by one by the server only when the inventory level is aboves, with interval time between any two successive selections distributed as exponential with parameter depending on the number of customers in the pool. The joint probability distribution of the inventory level and the number of customers in the pool is obtained in the steady-state case. Various system performance measures in the steady state are derived, and the long-run total expected cost rate is calculated.


This paper considers a single server inventory queueing system with two types of server breakdowns, say Type 1(T1) breakdown and Type 2 (T2) breakdowns, and working breakdown. T1 breakdown occurs in regular service period whereas T2 breakdown occurs in the duration of working breakdown. The inter arrival time between any two customers and the times of occurrences of both types of breakdowns are all independent exponential distributions. The commencement of repairing process of T1 breakdown follows Bernoulli’s whereas the commencement of repairing process of T2 breakdown is instantaneous. By using matrix method, we obtain the steady state probability vector of the finite capacity queueing inventory system. Finally, the numerical examination of model sensitiveness is performed.


Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1514
Author(s):  
R. Suganya ◽  
Lewis Nkenyereye ◽  
N. Anbazhagan ◽  
S. Amutha ◽  
M. Kameswari ◽  
...  

In this study, we consider a perishable inventory system that has an (s, Q) ordering policy, along with a finite waiting hall. The single server, which provides an item to the customer after completing the required service performance for that item, only begins serving after N customers have arrived. Impatient demand is assumed in that the customers waiting to be served lose patience and leave the system if the server’s idle time overextends or if the arriving customers find the system to be full and will not enter the system. This article analyzes the impatient demands caused by the N-policy server to an inventory system. In the steadystate, we obtain the joint probability distribution of the level of inventory and the number of customers in the system. We analyze some measures of system performance and get the total expected cost rate in the steadystate. We present a beneficial cost function and confer the numerical illustration that describes the impact of impatient customers caused by N-policy on the inventory system’s total expected cost rate.


2016 ◽  
Vol 48 (6) ◽  
pp. 22-38 ◽  
Author(s):  
Agasi Zarbali ogly Melikov ◽  
Leonid A. Ponomarenko ◽  
Mamed Oktay ogly Shahmaliyev
Keyword(s):  

Author(s):  
Amit Sharma

Distributed Denial of Service attacks are significant dangers these days over web applications and web administrations. These assaults pushing ahead towards application layer to procure furthermore, squander most extreme CPU cycles. By asking for assets from web benefits in gigantic sum utilizing quick fire of solicitations, assailant robotized programs use all the capacity of handling of single server application or circulated environment application. The periods of the plan execution is client conduct checking and identification. In to beginning with stage by social affair the data of client conduct and computing individual user’s trust score will happen and Entropy of a similar client will be ascertained. HTTP Unbearable Load King (HULK) attacks are also evaluated. In light of first stage, in recognition stage, variety in entropy will be watched and malevolent clients will be recognized. Rate limiter is additionally acquainted with stop or downsize serving the noxious clients. This paper introduces the FAÇADE layer for discovery also, hindering the unapproved client from assaulting the framework.


Author(s):  
Tan Liong Ching ◽  
Nureize Binti Arbaiy

The smart store system (F3 Storage System) provides an inventory system function, and is supported by voice recognition for items searching purpose in the warehouse. This system is aimed to improve effectiveness in item searching process for the warehouse management. An inventory system structures is employed in this system to enable items management. Voice recognition facility helps the worker to search item in an effective way. Worker can use voice recognition function to search the item in the warehouse, and searched information of the item will be displayed in the liquid crystal display (LCD) screen. Meanwhile, the location of the item will be physically indicated by the light emitting diode (LED) light function. The developed system also contains a barcode system to enhance the process of scheduling warehouse activity. Such facilities will enhance the capabilities of existing inventory management systems in warehouses. Prototyping model is used to assist project development. Arduino technology is used to enable integrated hardware and software to read data or input. With Arduino technology, traditional search items by using text and search functionality are enhanced to allow speech functionality. This functionality makes the search process faster and more efficient.


2016 ◽  
Vol 1 (2) ◽  
pp. 129
Author(s):  
Sri Wahyun ◽  
Yuri Shelvi Purwaningsih ◽  
Erifa Syahnaz

Universities have many departments and within departments there is a course of study program there are many students who will make the Thesis project as a graduation requirement, and in particular the management programmed each study must assess all students Thesis. Applications made specifically to see the similarities title and inventory the Thesis title of data that already exists, the application is expected to greatly facilitate the reporting and data collection Thesis title. In addition to the ease of reporting and data collection title Thesis inventory is easier in searching similarity title Thesis task thus avoiding the same Thesis with no development at all from the previous year. The system can be applied to the majors or courses that have university that can be used as an inventory system and see the similarities Title Thesis Universities and solve the problems of data collection title Thesis so that the data is needed both for reporting easy to do, and the system is very helpful lecturer in accepting the nomination of Title Thesis.


Sign in / Sign up

Export Citation Format

Share Document