Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods

DOI10.1016/j.ejor.2018.10.036zbMath1430.90289OpenAlexW2898187057WikidataQ129078515 ScholiaQ129078515MaRDI QIDQ1755382

Wenchao Wei, Stefan Creemers, Salim Rostami, Roel Leus

Publication date: 9 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.10.036

zbMATH Keywords

schedulingdynamic programmingbranch-and-pricesystem testingprecedence theorems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Dynamic programming (90C39)

Related Items (2)

Time-critical testing and search problems ⋮ Exact and heuristic approaches to detect failures in failed \(k\)-out-of-\(n\) systems

Uses Software

• RanGen

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling modular projects on a bottleneck resource
• An optimal sequence in multicharacteristic inspection
• Heuristic and exact algorithms for the precedence-constrained knapsack problem
• Greedy randomized adaptive search procedures
• Sequential testing of complex systems: a review
• Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraints
• Diagnosing double regular systems
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
• Scheduling Markovian PERT networks to maximize the net present value
• Rangen: A random network generator for activity-on-the-node networks
• Optimal task sequencing with precedence constraints
• Project planning with alternative technologies in uncertain environments
• Efficient sequential decision-making algorithms for container inspection operations
• Sequencing with Series-Parallel Precedence Constraints
• An algorithm for the single machine sequencing problem with precedence constraints
• Optimal Testing Procedures for Special Structures of Coherent Systems
• A Remark on Search and Sequencing Problems
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• Approximation algorithms for sequential batch‐testing of series systems
• Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations
• New Precedence Theorems for One-Machine Weighted Tardiness
• Some Reliability Fault-Testing Models

This page was built for publication: Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods