A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing
From MaRDI portal
Publication:833427
DOI10.1007/s11081-007-9011-5zbMath1176.90083OpenAlexW2145101431MaRDI QIDQ833427
Mark A. Horowitz, Sunghee Yun, Seung-Jean Kim, Dinesh D. Patil, Stephen P. Boyd
Publication date: 12 August 2009
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.4999
makespanrobust optimizationdesign centeringactivity networkproject networkcircuit optimizationdesign for manufacturedesign for yieldstatistical circuit design
Related Items
Optimal crashing of an activity network with disruptions, Multi-resource allocation in stochastic project scheduling, Sensitivity analysis of ranked data: from order statistics to quantiles, Stochastic geometric optimization with joint probabilistic constraints, A tutorial on geometric programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounding the expected time-cost curve for a stochastic PERT network from below
- Sample-path optimization of convex stochastic performance functions
- Introductory lectures on convex optimization. A basic course.
- Integrating and accelerating tabu search, simulated annealing, and genetic algorithms
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Computing the probability distribution of project duration in a PERT network
- On Uncertainty, Ambiguity, and Complexity in Project Management
- Convex majorization with an application to the length of critical paths
- Approximation Theorems of Mathematical Statistics
- Determining the K Most Critical Paths in PERT Networks
- A Robust Optimization Approach to Inventory Theory
- Bounding the Project Completion Time Distribution in PERT Networks
- Approximating the Criticality Indices of the Activities in PERT Networks
- Stochastic Bounds on Distributions of Optimal Value Functions with Applications to PERT, Network Flows and Reliability
- Inequalities for the Completion Times of Stochastic PERT Networks
- Yield optimization for arbitrary statistical distributions: Part I-Theory
- Yield optimization for arbitrary statistical distributions: Part II-Implementation
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
- The Completion Time of PERT Networks
- Bounding distributions for a stochastic pert network
- Finding the k Shortest Paths
- Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization
- Asymptotic Statistics
- Numerical Optimization
- Robust Solutions to Least-Squares Problems with Uncertain Data
- LOQO user's manual — version 3.10
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- Efficient Estimation of Arc Criticalities in Stochastic Activity Networks
- Bounds on Expected Project Tardiness
- Digital Circuit Optimization via Geometric Programming
- Critical Path Analyses Via Chance Constrained and Stochastic Programming
- Association of Random Variables, with Applications
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis
- A computational study on bounding the makespan distribution in stochastic project networks
