Results 1  10
of
11
A Computational Study on Bounding the Makespan Distribution in Stochastic Project Networks
 ANNALS OF OPERATIONS RESEARCH
, 1998
"... Given a stochastic project network with independently distributed activity durations, several approaches to bound the distribution function of the project completion time have been proposed. We have implemented the most promising of these algorithms and compare their behavior on a basis of nearly 20 ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Given a stochastic project network with independently distributed activity durations, several approaches to bound the distribution function of the project completion time have been proposed. We have implemented the most promising of these algorithms and compare their behavior on a basis of nearly 2000 instances with up to 1200 activities of different testbeds. We propose a suitable numerical representation of the given distributions which is the basis for excellent computational results.
Finding a Complexity Measure for Business Process Models
, 2001
"... Business processes are complex systems of human activities that are designed and improved to create value for the customer of the process (Hannus 1994). As a result of external requirements, such as globalisation, advancing technology, shorter development cycles and increasing competition, business ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Business processes are complex systems of human activities that are designed and improved to create value for the customer of the process (Hannus 1994). As a result of external requirements, such as globalisation, advancing technology, shorter development cycles and increasing competition, business processes are becoming gradually more complex. To handle this intrinsic complexity of business processes, there are basically two different approaches: reducing unnecessary complexity, and managing the rest of the complexity. The ultimate goal is to improve the business process, and hence to provide increasing utility for its stakeholders.
Task Graph Performance Bounds Through Comparison Methods
, 2001
"... When a parallel computation is represented in a formalism that imposes seriesparallel structure on its task graph, it becomes amenable to automated analysis and scheduling. Unfortunately, its execution time will usually also increase as precedence constraints are added to ensure seriesparallel str ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
When a parallel computation is represented in a formalism that imposes seriesparallel structure on its task graph, it becomes amenable to automated analysis and scheduling. Unfortunately, its execution time will usually also increase as precedence constraints are added to ensure seriesparallel structure. Bounding the slowdown ratio would allow an informed tradeoff between the benefits of a restrictive formalism and its cost in loss of performance. This dissertation deals with seriesparallelising task graphs by adding precedence constraints to a task graph, to make the resulting task graph seriesparallel. The weak bounded slowdown conjecture for seriesparallelising task graphs is introduced. This states that the slowdown is bounded if information about the workload can be used to guide the selection of which precedence constraints to add. A theory of best seriesparallelisations is developed to investigate this conjecture. Partial evidence is presented that the weak slowdown bound is likely to be 4/3, and this bound is shown to be tight.
Abstract Some tractable instances of interval data minmax regret problems
"... In this paper, we provide polynomial and pseudopolynomial algorithms for classes of particular instances of interval data minmax regret graph problems. These classes are defined using a parameter that measures the distance from well known solvable instances. Tractable cases occur when the parameter ..."
Abstract
 Add to MetaCart
In this paper, we provide polynomial and pseudopolynomial algorithms for classes of particular instances of interval data minmax regret graph problems. These classes are defined using a parameter that measures the distance from well known solvable instances. Tractable cases occur when the parameter is bounded by a constant.
Open Problems 17
"... .32> f1; : : : ; lg m and define a combinatorial line to be a set of l distinct vectors agree with each other on some set of coordinates and vary in the same order on the remaining coordinates. The HalesJewett Theorem [11] states that if the number of dimensions is large enough, then any tcolo ..."
Abstract
 Add to MetaCart
.32> f1; : : : ; lg m and define a combinatorial line to be a set of l distinct vectors agree with each other on some set of coordinates and vary in the same order on the remaining coordinates. The HalesJewett Theorem [11] states that if the number of dimensions is large enough, then any tcoloring of the elements of the hypercube will have a monochromatic line. The situation in SET weakens the condition for a line: there is no ordering on the possible symbols, colors, or shadings, so we do not place the three cards in order and ask for the nonconstant coordinates to occur in the same order. We require only that the nonconstant coordinates display all possible values. Call this a canonical set. (In infinite Ramsey theory, again as described in [9], a set is "canonically colored" if the elements have the same color or have distinct colors. We can view the features on the 81 pos
An efficient Activity Network Reduction Algorithm based on the Label Correcting Tracing Algorithm
"... Abstract—When faced with stochastic networks with an uncertain duration for their activities, the securing of network completion time becomes problematical, not only because of the nonidentical pdf of duration for each node, but also because of the interdependence of network paths. As evidenced by ..."
Abstract
 Add to MetaCart
Abstract—When faced with stochastic networks with an uncertain duration for their activities, the securing of network completion time becomes problematical, not only because of the nonidentical pdf of duration for each node, but also because of the interdependence of network paths. As evidenced by Adlakha & Kulkarni [1], many methods and algorithms have been put forward in attempt to resolve this issue, but most have encountered this same largesize network problem. Therefore, in this research, we focus on network reduction through a Series/Parallel combined mechanism. Our suggested algorithm, named the Activity Network Reduction Algorithm (ANRA), can efficiently transfer a largesize network into an S/P Irreducible Network (SPIN). SPIN can enhance stochastic network analysis, as well as serve as the judgment of symmetry for the Graph Theory.
Diffusion Activity Networks
, 1999
"... An activity network (AN) is a directed acyclic graph with n nodes and A arcs. The nodes are numbered from 1 to n so that an arc always leads from a smaller numbered node to a higher numbered node. The graph has only one node with no incident arcs, which is called the starting node and numbered 1. No ..."
Abstract
 Add to MetaCart
An activity network (AN) is a directed acyclic graph with n nodes and A arcs. The nodes are numbered from 1 to n so that an arc always leads from a smaller numbered node to a higher numbered node. The graph has only one node with no incident arcs, which is called the starting node and numbered 1. Node n is the only node with no emanating arcs and is named the terminal node. An arc represents an activity and a node the start or the culmination of that activity. The terminal node represents the end of the project. These kinds ofgraphsarealsoreferredtoasActivity on Arc (AoA) representation of AN. In DiAN the process represented by the arcs is a diffusion process, the state of which is identified with the remaining work content (rwc). The process starts at time ‘0 ’ at rwc = 1 with a negative drift coefficient. An absorbing barrier is placed at rwc = 0 to identify with the end of the process. The completion time of an activity is thus the first passage time of such a diffusion process. The paradigm of DiAN, while offering an enhanced modeling concept, raises many questions regarding computational challenges, definition of project management metrics and applicability of such a tool in areas beyond project management. The thesis primarily focuses
unknown title
"... Computational methods for determining the latest starting times and floats of tasks in intervalvalued activity networks ..."
Abstract
 Add to MetaCart
Computational methods for determining the latest starting times and floats of tasks in intervalvalued activity networks