-
作者：DellAmico, M
摘要：We consider Job-Shop and Flow-Shop scheduling problems with two machines, no more than two operations per job, and Time Lags, i.e., a minimum time interval between the completion rime of the first operation and the starting time of the second one. We give complexity results for the preemptive and nonpreemptive cases and study the relationship between the two problems. For the Flow-Shop problem we give lower bounds and upper bounds and analyze their worst-case performances. Finally we define a ...
-
作者：Hazen, GB; Pellissier, JM
作者单位：Loyola University Chicago
摘要：Stochastic trees are semi-Markov processes represented using tree diagrams. Such trees have been found useful for prescriptive modeling of temporal medical treatment choice. We consider utility functions over stochastic trees which permit recursive evaluation In a graphically intuitive manner analogous to decision tree rollback. Such rollback is computationally intractable unless a low-dimensional preference summary exists. We present the most general classes of utility functions having specif...
-
作者：Hu, JQ
摘要：In this paper, we study the departure process of the GI/G/1 queue. We develop a simple recursive procedure to calculate the MacLaurin series of its moments and covariances with respect to a parameter in the service time. Based on this recursive procedure the explicit formulas of the coefficients of these MacLaurin series can be obtained in terms of derivatives of the probability density function of the interarrival time evaluated at zero and the moments of the interarrival time and the service...
-
作者：LEcuyer, P
摘要：We analyze the random number generators obtained by combining two or more multiple recursive generators. We study the lattice structure of such combined generators and argue that combination is a good way of obtaining robust generators, based on a recurrence with many nonzero coefficients, and which also possess a fast implementation.
-
作者：Tassiulas, L
作者单位：University System of Maryland; University of Maryland College Park
摘要：Demands for service arrive at random times, in random locations, in a region of the plane. The service time of each demand is random. A server that travels with constant speed moves from demand to demand providing service. The server spends its time either in providing service or in traveling. The objective is to route the server, based on the location of the current demands on the plane and the anticipated demand arrivals, such that the time spent in traveling is minimal and the service is pr...
