Sequential testing in sparse precedence networks
From MaRDI portal
Cites work
- A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
- A Remark on Search and Sequencing Problems
- A stochastic bi-objective project scheduling model under failure of activities
- An algorithm for the single machine sequencing problem with precedence constraints
- An optimal sequence in multicharacteristic inspection
- Approximation algorithms for sequential batch-testing of series systems
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Diagnosing double regular systems
- Efficient sequential decision-making algorithms for container inspection operations
- Exact algorithms for single-machine scheduling with time windows and precedence constraints
- Exact and heuristic approaches to detect failures in failed \(k\)-out-of-\(n\) systems
- Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations
- Optimal task sequencing with precedence constraints
- Optimal Testing Procedures for Special Structures of Coherent Systems
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
- Project planning with alternative technologies in uncertain environments
- Rangen: A random network generator for activity-on-the-node networks
- Scheduling modular projects on a bottleneck resource
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Sequencing with Series-Parallel Precedence Constraints
- Sequential testing of n-out-of-n systems: precedence theorems and exact methods
- Sequential testing of complex systems: a review
- Some Reliability Fault-Testing Models
- The two-machine flow shop problem with arbitrary precedence relations
- Time-critical testing and search problems
This page was built for publication: Sequential testing in sparse precedence networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325499)