نتایج جستجو برای: arbitrary service time

تعداد نتایج: 2217406  

2009
Daniel M. Kane Gregory N. Price Erik D. Demaine

Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedron. Recent work by Bobenko and Izmestiev describes a differential equation whose solution is the polyhedron corresponding to a given metric. We describe an algorithm based on this differential equation to compute the pol...

2009
Kane Daniel Gregory N. Price Erik D. Demaine Daniel Kane

Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedron. Recent work by Bobenko and Izmestiev describes a differential equation whose solution is the polyhedron corresponding to a given metric. We describe an algorithm based on this differential equation to compute the pol...

2009
Alexandre Brandwajn Thomas Begin

In this paper we consider a multi-server queue with a near general arrival process (represented as an arbitrary state-dependent Coxian distribution), a near general state-dependent Coxian service time distribution and a possibly finite queueing room. In addition to the dependence on the current number of customers in the system, the rate of arrivals and the progress of the service may depend on...

Journal: :journal of industrial engineering, international 2009
m.t taghavi-fard h.r dehnar saidy

in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...

2013
Vijaya Laxmi

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discrete Markovian service process. The server terminates service whenever the system becomes empty, and recommences service as soon as the number of waiting customers in the queue is N . We obtain the system-length distributions at prearrival and arbitrary epochs using the supplement...

Journal: :journal of emergency practice and trauma 0
afsaneh esmaeili ranjbar department of emergency medicine, kerman university of medical sciences, kerman, iran masoud mayel department of emergency medicine, kerman university of medical sciences, kerman, iran mitra movahedi department of emergency medicine, kerman university of medical sciences, kerman, iran faezeh emaeili ranjbar department of biology, kerman branch of islamic azad university, kerman, iran amirhossein mirafzal department of emergency medicine, kerman university of medical sciences, kerman, iran

objective: most previous retrospective studies failed to show a consistent association between pre-hospital time intervals and mortality in trauma patients, bringing the recommendation of “transport fast to increase survival” under question. the aim of this study was to evaluate the association of response time, scene time, and transport time with 24-hour in-hospital mortality.   methods: in th...

Journal: :Queueing Syst. 2004
Ho Woo Lee Sahng Hoon Cheon Eui Yong Lee Kyung C. Chae

We study the workload (unfinished work) and the waiting time of the queueing system with MAP arrivals under D-policy. The D-policy stipulates that the idle server begin to serve the customers only when the sum of the service times of all waiting customers exceeds some fixed threshold D. We first set up the system equations for workload and obtain the steady-state distributions of workloads at a...

Journal: :Concurrency and Computation: Practice and Experience 2008
Galip Aydin Ahmet Sayar Harshawardhan Gadgil Mehmet S. Aktas Geoffrey C. Fox Sung Hoon Ko Hasan Bulut Marlon E. Pierce

We discuss the development and application of Web Service-based Geographical Information System Grids. Following the WS-I+ approach of building Grids on Web Service standards, we have developed Data Grid components for archival and real-time data, map generating services that can be used to build user interfaces, information services for storing both stateless and stateful metadata, and service...

2011
Shan Gao

This paper treats a discrete-time finite buffer batch arrival queue with a single working vacation and partial batch rejection in which the inter-arrival and service times are, respectively, arbitrary and geometrically distributed. The queue is analyzed by using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at prearrival,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید