Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers

DOI10.1016/J.EJOR.2021.06.028MaRDI QIDQ2077972zbMATH OpenOpenAlexFDO

Authors Hanxiao Zhang, Yan-Fu Li

Publication date 23 February 2022

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

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

zbMATH Keywords

reliabilitybranch-and-pricetest case selectionreliability testing plantest case sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• An integrated approach to redundancy allocation and test planning for reliability growth
• Optimizing testing-resource allocation using architecture-based software reliability model
• Mission-based component testing for series systems
• The design of optimum component test plans for system reliability
• Component testing of repairable systems in multistage missions

Cites work

• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• A review of accelerated test models
• A time indexed formulation of non-preemptive single machine scheduling problems
• An exact algorithm for single-machine scheduling without machine idle time
• An exact algorithm for the precedence-constrained single-machine scheduling problem
• Earliness-tardiness scheduling with setup considerations
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• Exact algorithms for single-machine scheduling with time windows and precedence constraints
• Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
• Near-optimal solutions and large integrality gaps for almost all instances of single-machine precedence-constrained scheduling
• New exact algorithms for one-machine earliness-tardiness scheduling
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Single-Machine Scheduling with Precedence Constraints
• The one-machine problem with earliness and tardiness penalties
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• Time-indexed formulations and the total weighted tardiness problem

This page was built for publication: Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2077972)