نتایج جستجو برای: idle time

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

2003
GERHARD HASSLINGER DANIELA FAUSTEN

We show how results known for discrete time GI/GI/1 systems with service time distributions of finite support can be generalized to include arbitrary, especially long-tailed distributions of the service time. Therefore we prove and exploit the property, that the tail of the service time distribution beyond a certain bound has negligible effect on the idle times. This enables to compute the idle...

2002
A. Balluchi L. Benvenuti L. Berardi E. De Santis M. D. Di Benedetto G. Girasole G. Pola

In this paper, the idle speed control problem is addressed via maximal safe set computation. A hybrid model of the engine in idle mode is used. The solution is based on the transformation of the continuous dynamics from the time-domain to the crank-angle domain and on the linearization and discretization of these dynamics. A ‡exible and portable algorithm in the discrete-time domain is proposed...

2005
David R. McDonald

Consider a modified, stable, two node Jackson network where server 2 helps server 1 when server 2 is idle. The probability of a large deviation of the number of customers at node one can be calculated using the flat boundary theory of Schwartz and Weiss [Large Deviations Performance Analysis (1994), Chapman and Hall, New York]. Surprisingly, however, these calculations show that the proportion ...

Journal: :European Journal of Operational Research 2009
Yaroslav Goncharov Sergey Sevastyanov

The makespan minimization problem in flow shops with no-idle constraints on machines is considered. The latter means that each machine, once started, must process all its operations without intermediate idle time until all those operations are completed. The problem is known to be strongly NP-hard already for three machines. While being based on a geometrical approach, we propose several polyno...

2014
Li Wang Xiaoning Zhu

Rail mounted gantry crane (RMGC) scheduling is important in reducing makespan of handling operation and improving container handling efficiency. In this paper, we present an RMGC scheduling optimization model, whose objective is to determine an optimization handling sequence in order to minimize RMGC idle load time in handling tasks. An ant colony optimization is proposed to obtain near optimal...

2013
Mathias Morbitzer Erik Poll Mark Koek

Port scans are done by an attacker to discover which services are o ered by systems on a network and could be attacked. There are various approaches for port scanning, all providing advantages and disadvantages. One of those approaches is the TCP Idle Scan, in which the attacker spoofs messages of a third computer in order to remain undetected. To see the results of the scan, he utilizes the IP...

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

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