IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v285y2020i1p211-222.html
   My bibliography  Save this article

Optimal selection and release problem in software testing process: A continuous time stochastic control approach

Author

Listed:
  • Cao, Ping
  • Yang, Ke
  • Liu, Ke

Abstract

This paper studies a joint selection of test cases and release problem for a software under test with predetermined classes of test cases and release time deadline. The software test manager can make three alternative choices dynamically during software testing progress before the deadline: continue testing and select a class of test cases, release the software, or scrap the software, with the objective of minimizing the cumulative testing cost plus penalty cost after releasing or scrapping the software. We formulate the problem as a continuous time stochastic control model and provide a mathematically rigorous method to establish the concavity of the optimal cost function. Based on this property, we are able to characterize that the optimal release policy has a threshold structure. Moreover, the thresholds are founded to be monotone in the residual time length in the case of homogeneous release cost. Besides, we put forward a method based on low convex envelope and discover that the optimal selection policy also has a threshold or other simple structure, if the running cost or the removal cost is the same for all classes. Finally, we present an approximation algorithm of computing the optimal cost function, by which some numerical examples are studied to justify our theoretical results and the robustness of our policy. We also conduct a case study to compare our dynamic selection and release testing policy with two other commonly used testing policies and find that our policy is the best in most instances.

Suggested Citation

  • Cao, Ping & Yang, Ke & Liu, Ke, 2020. "Optimal selection and release problem in software testing process: A continuous time stochastic control approach," European Journal of Operational Research, Elsevier, vol. 285(1), pages 211-222.
  • Handle: RePEc:eee:ejores:v:285:y:2020:i:1:p:211-222
    DOI: 10.1016/j.ejor.2019.01.075
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719301560
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2019.01.075?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Youyi Feng & Baichun Xiao, 2000. "Optimal Policies of Yield Management with Multiple Predetermined Prices," Operations Research, INFORMS, vol. 48(2), pages 332-343, April.
    2. Victor F. Araman & René Caldentey, 2009. "Dynamic Pricing for Nonperishable Products with Demand Learning," Operations Research, INFORMS, vol. 57(5), pages 1169-1188, October.
    3. Vivek F. Farias & Benjamin Van Roy, 2010. "Dynamic Pricing with a Prior on Market Response," Operations Research, INFORMS, vol. 58(1), pages 16-29, February.
    4. Guillermo Gallego & Garrett van Ryzin, 1994. "Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons," Management Science, INFORMS, vol. 40(8), pages 999-1020, August.
    5. Cao, Ping & Li, Jianbin & Yan, Hong, 2012. "Optimal dynamic pricing of inventories with stochastic demand and discounted criterion," European Journal of Operational Research, Elsevier, vol. 217(3), pages 580-588.
    6. Youyi Feng & Baichun Xiao, 2000. "A Continuous-Time Yield Management Model with Multiple Prices and Reversible Price Changes," Management Science, INFORMS, vol. 46(5), pages 644-657, May.
    7. Lin, Kyle Y., 2006. "Dynamic pricing with real-time demand learning," European Journal of Operational Research, Elsevier, vol. 174(1), pages 522-538, October.
    8. Jennifer M. George & J. Michael Harrison, 2001. "Dynamic Control of a Queue with Adjustable Service Rate," Operations Research, INFORMS, vol. 49(5), pages 720-731, October.
    9. P.K. Kapur & Hoang Pham & Udayan Chanda & Vijay Kumar, 2013. "Optimal allocation of testing effort during testing and debugging phases: a control theoretic approach," International Journal of Systems Science, Taylor & Francis Journals, vol. 44(9), pages 1639-1650.
    10. Cai, Kai-Yuan & Li, Yong-Chao & Ning, Wei-Yi, 2005. "Optimal software testing in the setting of controlled Markov chains," European Journal of Operational Research, Elsevier, vol. 162(2), pages 552-579, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rajat Arora & Rubina Mittal & Anu Gupta Aggarwal & P. K. Kapur, 2023. "Investigating the impact of effort slippages in software development project," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 14(3), pages 878-893, June.

    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.
    1. Michael N. Katehakis & Yifeng Liu & Jian Yang, 2022. "A revisit to the markup practice of irreversible dynamic pricing," Annals of Operations Research, Springer, vol. 317(1), pages 77-105, October.
    2. Athanassios N. Avramidis & Arnoud V. Boer, 2021. "Dynamic pricing with finite price sets: a non-parametric approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(1), pages 1-34, August.
    3. Athanassios N. Avramidis, 2020. "A pricing problem with unknown arrival rate and price sensitivity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(1), pages 77-106, August.
    4. Schlosser, Rainer, 2016. "Joint stochastic dynamic pricing and advertising with time-dependent demand," Journal of Economic Dynamics and Control, Elsevier, vol. 73(C), pages 439-452.
    5. Xiao, Baichun & Yang, Wei, 2021. "A Bayesian learning model for estimating unknown demand parameter in revenue management," European Journal of Operational Research, Elsevier, vol. 293(1), pages 248-262.
    6. Yusen Xia & Jian Yang & Tingting Zhou, 2019. "Revenue management under randomly evolving economic conditions," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(1), pages 73-89, February.
    7. Dasci, A. & Karakul, M., 2009. "Two-period dynamic versus fixed-ratio pricing in a capacity constrained duopoly," European Journal of Operational Research, Elsevier, vol. 197(3), pages 945-968, September.
    8. Banerjee, Pradeep K. & Turner, T. Rolf, 2012. "A flexible model for the pricing of perishable assets," Omega, Elsevier, vol. 40(5), pages 533-540.
    9. Wang, Xiubin & Regan, Amelia, 2006. "Dynamic yield management when aircraft assignments are subject to swap," Transportation Research Part B: Methodological, Elsevier, vol. 40(7), pages 563-576, August.
    10. Ghate, Archis, 2015. "Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning," European Journal of Operational Research, Elsevier, vol. 245(2), pages 555-570.
    11. Chew, Ek Peng & Lee, Chulung & Liu, Rujing, 2009. "Joint inventory allocation and pricing decisions for perishable products," International Journal of Production Economics, Elsevier, vol. 120(1), pages 139-150, July.
    12. den Boer, Arnoud V., 2015. "Tracking the market: Dynamic pricing and learning in a changing environment," European Journal of Operational Research, Elsevier, vol. 247(3), pages 914-927.
    13. Arnoud V. den Boer & Bert Zwart, 2014. "Simultaneously Learning and Optimizing Using Controlled Variance Pricing," Management Science, INFORMS, vol. 60(3), pages 770-783, March.
    14. Omar Besbes & Assaf Zeevi, 2012. "Blind Network Revenue Management," Operations Research, INFORMS, vol. 60(6), pages 1537-1550, December.
    15. Alec Morton, 2006. "Structural properties of network revenue management models: An economic perspective," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 748-760, December.
    16. Arnoud V. den Boer & N. Bora Keskin, 2020. "Discontinuous Demand Functions: Estimation and Pricing," Management Science, INFORMS, vol. 66(10), pages 4516-4534, October.
    17. John G. Wilson & Jing Chen, 2018. "On the optimality of coupon books," Annals of Operations Research, Springer, vol. 268(1), pages 405-423, September.
    18. Cao, Ping & Li, Jianbin & Yan, Hong, 2012. "Optimal dynamic pricing of inventories with stochastic demand and discounted criterion," European Journal of Operational Research, Elsevier, vol. 217(3), pages 580-588.
    19. Sentao Miao & Xi Chen & Xiuli Chao & Jiaxi Liu & Yidong Zhang, 2022. "Context‐based dynamic pricing with online clustering," Production and Operations Management, Production and Operations Management Society, vol. 31(9), pages 3559-3575, September.
    20. Doan, Xuan Vinh & Lei, Xiao & Shen, Siqian, 2020. "Pricing of reusable resources under ambiguous distributions of demand and service time with emerging applications," European Journal of Operational Research, Elsevier, vol. 282(1), pages 235-251.

    Corrections

    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:285:y:2020:i:1:p:211-222. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.