Sequential testing of n-out-of-n systems: Precedence theorems and exact methods
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2018.10.036
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- François Vanderbeck, 2000. "On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm," Operations Research, INFORMS, vol. 48(1), pages 111-128, February.
- Clyde L. Monma & Jeffrey B. Sidney, 1979. "Sequencing with Series-Parallel Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 4(3), pages 215-224, August.
- Rebi Daldal & Iftah Gamzu & Danny Segev & Tonguç Ünlüyurt, 2016. "Approximation algorithms for sequential batch‐testing of series systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(4), pages 275-286, June.
- Martin Savelsbergh, 1997. "A Branch-and-Price Algorithm for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 45(6), pages 831-841, December.
- Brian Gluss, 1959. "An Optimum Policy for Detecting a Fault in a Complex System," Operations Research, INFORMS, vol. 7(4), pages 468-477, August.
- J. J. Kanet, 2007. "New Precedence Theorems for One-Machine Weighted Tardiness," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 579-588, August.
- Creemers, Stefan & De Reyck, Bert & Leus, Roel, 2015. "Project planning with alternative technologies in uncertain environments," European Journal of Operational Research, Elsevier, vol. 242(2), pages 465-476.
- Salim Rostami & Stefan Creemers & Roel Leus, 2019. "Precedence theorems and dynamic programming for the single-machine weighted tardiness problem," Post-Print hal-01914859, HAL.
- Jean-Claude Picard, 1976. "Maximal Closure of a Graph and Applications to Combinatorial Problems," Management Science, INFORMS, vol. 22(11), pages 1268-1272, July.
- S. Creemers & R. Leus & M. Lambrecht, 2010. "Scheduling Markovian PERT networks to maximize the net present value," Post-Print hal-00800198, HAL.
- David Madigan & Sushil Mittal & Fred Roberts, 2011. "Efficient sequential decision‐making algorithms for container inspection operations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(7), pages 637-654, October.
- Stefan Creemers & Bert De Reyck & Roel Leus, 2015. "Project planning with alternative technologies in uncertain environments," Post-Print hal-01563008, HAL.
- N. Samphaiboon & Y. Yamada, 2000. "Heuristic and Exact Algorithms for the Precedence-Constrained Knapsack Problem," Journal of Optimization Theory and Applications, Springer, vol. 105(3), pages 659-676, June.
- F. P. Kelly, 1982. "A Remark on Search and Sequencing Problems," Mathematics of Operations Research, INFORMS, vol. 7(1), pages 154-157, February.
- Yosi Ben-Dov, 1981. "Optimal Testing Procedures for Special Structures of Coherent Systems," Management Science, INFORMS, vol. 27(12), pages 1410-1420, December.
- Rostami, Salim & Creemers, Stefan & Leus, Roel, 2019. "Precedence theorems and dynamic programming for the single-machine weighted tardiness problem," European Journal of Operational Research, Elsevier, vol. 272(1), pages 43-49.
- Richard Butterworth, 1972. "Some Reliability Fault-Testing Models," Operations Research, INFORMS, vol. 20(2), pages 335-343, April.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Fatemeh Rezaei & Amir Abbas Najafi & Erik Demeulemeester & Reza Ramezanian, 2024. "A stochastic bi-objective project scheduling model under failure of activities," Annals of Operations Research, Springer, vol. 338(1), pages 453-476, July.
- Agnetis, Alessandro & Hermans, Ben & Leus, Roel & Rostami, Salim, 2022. "Time-critical testing and search problems," European Journal of Operational Research, Elsevier, vol. 296(2), pages 440-452.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Agnetis, Alessandro & Hermans, Ben & Leus, Roel & Rostami, Salim, 2022. "Time-critical testing and search problems," European Journal of Operational Research, Elsevier, vol. 296(2), pages 440-452.
- Stefan Creemers, 2019. "The preemptive stochastic resource-constrained project scheduling problem," Post-Print hal-02992618, HAL.
- Öncü Hazir & Gündüz Ulusoy, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," Post-Print hal-02898162, HAL.
- Creemers, Stefan, 2018. "Maximizing the expected net present value of a project with phase-type distributed activity durations: An efficient globally optimal solution procedure," European Journal of Operational Research, Elsevier, vol. 267(1), pages 16-22.
- Creemers, Stefan, 2018. "Moments and distribution of the net present value of a serial project," European Journal of Operational Research, Elsevier, vol. 267(3), pages 835-848.
- B. De Reyck & Y. Grushka-Cockayne & R. Leus, 2007. "A New Challenge in Project Scheduling. The Incorporation of Activity Failures," Review of Business and Economic Literature, KU Leuven, Faculty of Economics and Business (FEB), Review of Business and Economic Literature, vol. 0(3), pages 410-435.
- Szmerekovsky, Joseph G. & Venkateshan, Prahalad & Simonson, Peter D., 2023. "Project scheduling under the threat of catastrophic disruption," European Journal of Operational Research, Elsevier, vol. 309(2), pages 784-794.
- Hazır, Öncü & Ulusoy, Gündüz, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," International Journal of Production Economics, Elsevier, vol. 223(C).
- Hermans, Ben & Leus, Roel & Looy, Bart Van, 2023. "Deciding on scheduling, secrecy, and patenting during the new product development process: The relevance of project planning models," Omega, Elsevier, vol. 116(C).
- Creemers, Stefan, 2019. "The preemptive stochastic resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 238-247.
- Fatemeh Rezaei & Amir Abbas Najafi & Erik Demeulemeester & Reza Ramezanian, 2024. "A stochastic bi-objective project scheduling model under failure of activities," Annals of Operations Research, Springer, vol. 338(1), pages 453-476, July.
- Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
- Amy Cohn & Michael Magazine & George Polak, 2009. "Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 215-225, April.
- Zhang, Hanxiao & Li, Yan-Fu, 2022. "Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers," European Journal of Operational Research, Elsevier, vol. 299(1), pages 183-194.
- Robbert Fokkink & Thomas Lidbetter & László A. Végh, 2019. "On Submodular Search and Machine Scheduling," Management Science, INFORMS, vol. 44(4), pages 1431-1449, November.
- Servranckx, Tom & Vanhoucke, Mario, 2019. "A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs," European Journal of Operational Research, Elsevier, vol. 273(3), pages 841-860.
- Jans, Raf, 2010. "Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 251-254, July.
- Daniel Villeneuve & Jacques Desrosiers & Marco Lübbecke & François Soumis, 2005. "On Compact Formulations for Integer Programs Solved by Column Generation," Annals of Operations Research, Springer, vol. 139(1), pages 375-388, October.
- Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
- Goldberg, Noam & Poss, Michael, 2020. "Maximum probabilistic all-or-nothing paths," European Journal of Operational Research, Elsevier, vol. 283(1), pages 279-289.
More about this item
Keywords
Scheduling; System testing; Precedence theorems; Dynamic programming; Branch-and-price;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:274:y:2019:i:3:p:876-885. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.