10 search results - page 1 / 2 » Longest path analysis in networks of queues: Dynamic schedul... |
EOR
2006
13 years 4 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
AMC
2006
13 years 4 months ago
2006
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and t...
EOR
2006
13 years 4 months ago
2006
In this paper we develop an open queueing network for optimal design of multi-stage assemblies, in which each service station represents a manufacturing or assembly operation. The...
HIPC
2007
Springer
13 years 8 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
CDC
2010
IEEE
12 years 11 months ago
2010
IEEE
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...