Critical Resource Allocation in Stochastic Project Networks PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Critical Resource Allocation in Stochastic Project Networks PDF full book. Access full book title Critical Resource Allocation in Stochastic Project Networks by Patrick Vance Kauffold. Download full books in PDF and EPUB format.
Author: Patrick Vance Kauffold
Publisher:
ISBN:
Category : Computer simulation
Languages : en
Pages : 758
Get Book Here
Book Description
Author: Patrick Vance Kauffold
Publisher:
ISBN:
Category : Computer simulation
Languages : en
Pages : 758
Get Book Here
Book Description
Author: Klaus Neumann
Publisher: Springer Science & Business Media
ISBN: 9783540526643
Category : Mathematics
Languages : en
Pages : 264
Get Book Here
Book Description
Project planning, scheduling, and control are regularly used in business and the service sector of an economy to accomplish outcomes with limited resources under critical time constraints. To aid in solving these problems, network-based planning methods have been developed that now exist in a wide variety of forms, cf. Elmaghraby (1977) and Moder et al. (1983). The so-called "classical" project networks, which are used in the network techniques CPM and PERT and which represent acyclic weighted directed graphs, are able to describe only projects whose evolution in time is uniquely specified in advance. Here every event of the project is realized exactly once during a single project execution and it is not possible to return to activities previously carried out (that is, no feedback is permitted). Many practical projects, however, do not meet those conditions. Consider, for example, a production process where some parts produced by a machine may be poorly manufactured. If an inspection shows that a part does not conform to certain specifications, it must be repaired or replaced by a new item. This means that we have to return to a preceding stage of the production process. In other words, there is feedback. Note that the result of the inspection is that a certain percentage of the parts tested do not conform. That is, there is a positive probability (strictly less than 1) that any part is defective.
Author: Adam J Rudolph
Publisher:
ISBN:
Category :
Languages : en
Pages : 70
Get Book Here
Book Description
Keywords: activity networks, stochastic optimization, project scheduling, resource allocation, phase type distribution.
Author: Christoph Schwindt
Publisher: Springer Science & Business Media
ISBN: 9783540254102
Category : Business & Economics
Languages : en
Pages : 216
Get Book Here
Book Description
The book is devoted to structural issues, algorithms, and applications of resource allocation problems in project management. Special emphasis is given to a unifying framework within which a large variety of project scheduling problems can be treated. Those problems involve general temporal constraints among project activities, different types of scarce resources, and a broad class of regular and nonregular objective functions ranging from time-based and financial to resource levelling functions. The diversity of the models proposed allows for covering many features arising in scheduling applications beyond the field of project management such as short-term production planning in the manufacturing or process industries.
Author: Clayton David Morgan
Publisher:
ISBN:
Category :
Languages : en
Pages : 80
Get Book Here
Book Description
Keywords: project planning, stochastic activity networks, sample-path optimization, optimal resource allocation, time-cost trade-off.
Author: Edem Okon Peter Akpan
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
Author:
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
Author: Sucharith Vanguri
Publisher:
ISBN:
Category : Discrete-time systems
Languages : en
Pages :
Get Book Here
Book Description
Project management has become a key component for improving organizational performance and is applied in many business areas and industries. Resource-constrained stochastic project networks are quite common. Managing such projects to maximize resource utilization and reduce project duration simultaneously is difficult. Resource loading, assignment rules, and priorities significantly affect project performance, especially in shared-resource, multi-project environments. This thesis provides an approach for using discrete-event simulation to analyze the behavior and performance of project networks that use resource pools. A method to translate project networks into simulation models is developed. The translator is used to convert and evaluate a benchmark test set of resource constrained stochastic project networks. The effect of factors like project network complexity, resource availability and allocation strategies on project performance is analyzed using a completely randomized design with factorial arrangement of the aforementioned factors. The conversion process and results from the analysis are discussed.
Author:
Publisher: Tapir Academic Press
ISBN: 9788251922876
Category :
Languages : en
Pages : 398
Get Book Here
Book Description
Author: Yuan Zhong (Ph.D.)
Publisher:
ISBN:
Category :
Languages : en
Pages : 193
Get Book Here
Book Description
This thesis addresses the design and analysis of resource allocation policies in largescale stochastic systems, motivated by examples such as the Internet, cloud facilities, wireless networks, etc. A canonical framework for modeling many such systems is provided by "stochastic processing networks" (SPN) (Harrison [28, 29]). In this context, the key operational challenge is efficient and timely resource allocation. We consider two important classes of SPNs: switched networks and bandwidth-sharing networks. Switched networks are constrained queueing models that have been used successfully to describe the detailed packet-level dynamics in systems such as input-queued switches and wireless networks. Bandwidth-sharing networks have primarily been used to capture the long-term behavior of the flow-level dynamics in the Internet. In this thesis, we develop novel methods to analyze the performance of existing resource allocation policies, and we design new policies that achieve provably good performance. First, we study performance properties of so-called Maximum-Weight-[alpha] (MW-[alpha]) policies in switched networks, and of a-fair policies in bandwidth-sharing networks, both of which are well-known families of resource allocation policies, parametrized by a positive parameter [alpha] > 0. We study both their transient properties as well as their steady-state behavior. In switched networks, under a MW-a policy with a 2 1, we obtain bounds on the maximum queue size over a given time horizon, by means of a maximal inequality derived from the standard Lyapunov drift condition. As a corollary, we establish the full state space collapse property when [alpha] > 1. In the steady-state regime, for any [alpha] >/= 0, we obtain explicit exponential tail bounds on the queue sizes, by relying on a norm-like Lyapunov function, different from the standard Lyapunov function used in the literature. Methods and results are largely parallel for bandwidth-sharing networks. Under an a-fair policy with [alpha] >/= 1, we obtain bounds on the maximum number of flows in the network over a given time horizon, and hence establish the full state space collapse property when [alpha] >/= 1. In the steady-state regime, using again a norm-like Lyapunov function, we obtain explicit exponential tail bounds on the number of flows, for any a > 0. As a corollary, we establish the validity of the diffusion approximation developed by Kang et al. [32], in steady state, for the case [alpha] = 1. Second, we consider the design of resource allocation policies in switched networks. At a high level, the central performance questions of interest are: what is the optimal scaling behavior of policies in large-scale systems, and how can we achieve it? More specifically, in the context of general switched networks, we provide a new class of online policies, inspired by the classical insensitivity theory for product-form queueing networks, which admits explicit performance bounds. These policies achieve optimal queue-size scaling, in the conventional heavy-traffic regime, for a class of switched networks, thus settling a conjecture (documented in [51]) on queue-size scaling in input-queued switches. In the particular context of input-queued switches, we consider the scaling behavior of queue sizes, as a function of the port number n and the load factor [rho]. In particular, we consider the special case of uniform arrival rates, and we focus on the regime where [rho] = 1 - 1/f(n), with f(n) >/= n. We provide a new class of policies under which the long-run average total queue size scales as O(n1.5 -f(n) log f(n)). As a corollary, when f(n) = n, the long-run average total queue size scales as O(n2.5 log n). This is a substantial improvement upon prior works [44], [52], [48], [39], where the same quantity scales as O(n3 ) (ignoring logarithmic dependence on n).
