NDLI: Distribution function of the shortest path in networks of queues

Content Provider	Springer Nature Link
Author	Azaron, Amir Modarres, Mohammad
Copyright Year	2005
Abstract	In this paper, we consider acyclic networks of queues as a model to support the design of a dynamic production system. Each service station in the network represents a manufacturing or assembly operation. Only one type of product is produced by the system, but there exist several distinct production processes for manufacturing this product, each one corresponding with a directed path in the network of queues. In each network node, the number of servers in the corresponding service station is either one or infinity. The service time in each station is either exponentially distributed or belongs to a special class of Coxian distribution. Only in the source node, the service system may be modeled by an $M/G/\infty $ queue. The transport times between every pair of service stations are independent random variables with exponential distributions. In method proposed in this paper, the network of queues is transformed into an equivalent stochastic network. Next, we develop a method for approximating the distribution function of the length of the shortest path of the transformed stochastic network, from the source to the sink node. Hence, the method leads to determining the distribution function of the time required to complete a product in this system (called the manufacturing lead time). This is done through solving a system of linear differential equations with non-constant coefficients, which is obtained from a related continuous-time Markov process. The results are verified by simulation.
Starting Page	123
Ending Page	144
Page Count	22
File Format	PDF
ISSN	01716468
Journal	OR Spectrum
Volume Number	27
Issue Number	1
e-ISSN	14366304
Language	English
Publisher	Springer-Verlag
Publisher Date	2005-01-01
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Queueing Stochastic processes Graph theory Shortest path Calculus of Variations and Optimal Control Optimization Business/Management Science Operation Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Management Science and Operations Research Business, Management and Accounting

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Shortest path calculation in large road networks

A multi-objective discrete reliability optimization problem for dissimilar-unit standby systems

K-Shortest routing of trains on shunting yards

Solving elementary shortest-path problems as mixed-integer programs

Minimality of EDF networks with resource sharing

On product form tandem structures

Optimal stochastic scheduling in a single server biclass retrial queueing system

State space collapse and stability of queueing networks

A multi-objective shortest path problem

Distribution function of the shortest path in networks of queues

Similar Documents

Shortest path calculation in large road networks

A multi-objective discrete reliability optimization problem for dissimilar-unit standby systems

K-Shortest routing of trains on shunting yards

Solving elementary shortest-path problems as mixed-integer programs

Minimality of EDF networks with resource sharing

On product form tandem structures

Optimal stochastic scheduling in a single server biclass retrial queueing system

State space collapse and stability of queueing networks

A multi-objective shortest path problem

Distribution function of the shortest path in networks of queues