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

Optimizing version release dates of research and development long-term processes

Author

Listed:
  • Etgar, Ran
  • Gelbard, Roy
  • Cohen, Yuval

Abstract

This paper develops and compares several optimization approaches for the version planning and release problem. This problem is new, challenging for scholars and practitioners, and was not fully addressed in the OR literature. Version releases are part of a wide-spread phenomenon. Mobile phones, operating systems (e.g. MS-Windows) and digital printers are well known examples. However, version release can be found in many other product development fields, such as software products and games, and hardware versions (e.g. TV, screens, communication equipment etc.). In some fields (such as the automotive field) the version release is so well-established that it became an annual routine.

Suggested Citation

  • Etgar, Ran & Gelbard, Roy & Cohen, Yuval, 2017. "Optimizing version release dates of research and development long-term processes," European Journal of Operational Research, Elsevier, vol. 259(2), pages 642-653.
    • Handle: RePEc:eee:ejores:v:259:y:2017:i:2:p:642-653
    DOI: 10.1016/j.ejor.2016.10.029
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716308633
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.10.029?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. Erik L. Demeulemeester & Willy S. Herroelen, 1997. "New Benchmark Results for the Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 43(11), pages 1485-1492, November.
    2. Neumann, K. & Zimmermann, J., 2000. "Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints," European Journal of Operational Research, Elsevier, vol. 127(2), pages 425-443, December.
    3. A. H. Russell, 1970. "Cash Flows in Networks," Management Science, INFORMS, vol. 16(5), pages 357-373, January.
    4. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    5. Tasgetiren, M. Fatih & Liang, Yun-Chia & Sevkli, Mehmet & Gencyilmaz, Gunes, 2007. "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1930-1947, March.
    6. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    7. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
    8. Elmaghraby, Salah E. & Herroelen, Willy S., 1990. "The scheduling of activities to maximize the net present value of projects," European Journal of Operational Research, Elsevier, vol. 49(1), pages 35-49, November.
    9. Wiesemann, Wolfram & Kuhn, Daniel & Rustem, Berç, 2010. "Maximizing the net present value of a project under uncertainty," European Journal of Operational Research, Elsevier, vol. 202(2), pages 356-367, April.
    10. Valls, Vicente & Ballestin, Francisco & Quintanilla, Sacramento, 2005. "Justification and RCPSP: A technique that pays," European Journal of Operational Research, Elsevier, vol. 165(2), pages 375-386, September.
    11. Norman Agin, 1966. "Optimum Seeking with Branch and Bound," Management Science, INFORMS, vol. 13(4), pages 176-185, December.
    12. Taylor, Margaret & Taylor, Andrew, 2012. "The technology life cycle: Conceptualization and managerial implications," International Journal of Production Economics, Elsevier, vol. 140(1), pages 541-553.
    13. Mika, Marek & Waligora, Grzegorz & Weglarz, Jan, 2005. "Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models," European Journal of Operational Research, Elsevier, vol. 164(3), pages 639-668, August.
    14. Etgar, Ran & Shtub, Avraham & LeBlanc, Larry J., 1997. "Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows," European Journal of Operational Research, Elsevier, vol. 96(1), pages 90-96, January.
    15. He, Zhengwen & Liu, Renjing & Jia, Tao, 2012. "Metaheuristics for multi-mode capital-constrained project payment scheduling," European Journal of Operational Research, Elsevier, vol. 223(3), pages 605-613.
    16. Sobel, Matthew J. & Szmerekovsky, Joseph G. & Tilson, Vera, 2009. "Scheduling projects with stochastic activity duration to maximize expected net present value," European Journal of Operational Research, Elsevier, vol. 198(3), pages 697-705, November.
    17. Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
    18. He, Zhengwen & Xu, Yu, 2008. "Multi-mode project payment scheduling problems with bonus-penalty structure," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1191-1207, September.
    19. S. Creemers & R. Leus & M. Lambrecht, 2010. "Scheduling Markovian PERT networks to maximize the net present value," Post-Print hal-00800198, HAL.
    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. Jakubik, Johannes & Binding, Adrian & Feuerriegel, Stefan, 2021. "Directed particle swarm optimization with Gaussian-process-based function forecasting," European Journal of Operational Research, Elsevier, vol. 295(1), pages 157-169.
    2. Mengmeng Zhu & Hoang Pham, 2018. "A multi-release software reliability modeling for open source software incorporating dependent fault detection process," Annals of Operations Research, Springer, vol. 269(1), pages 773-790, October.
    3. Avinash K. Shrivastava & Vivek Kumar & P. K. Kapur & Ompal Singh, 2020. "Software release and testing stop time decision with change point," 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. 11(2), pages 196-207, July.
    4. Avinash K. Shrivastava & Vivek Kumar & P. K. Kapur & Ompal Singh, 0. "Software release and testing stop time decision with change point," 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. 0, pages 1-12.

    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. He, Zhengwen & Liu, Renjing & Jia, Tao, 2012. "Metaheuristics for multi-mode capital-constrained project payment scheduling," European Journal of Operational Research, Elsevier, vol. 223(3), pages 605-613.
    2. Yangyang Liang & Nanfang Cui & Tian Wang & Erik Demeulemeester, 2019. "Robust resource-constrained max-NPV project scheduling with stochastic activity duration," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 219-254, March.
    3. Zhengwen He & Nengmin Wang & Pengxiang Li, 2014. "Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective," Annals of Operations Research, Springer, vol. 213(1), pages 203-220, February.
    4. 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.
    5. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
    6. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    7. Yukang He & Tao Jia & Weibo Zheng, 2024. "Simulated annealing for centralised resource-constrained multiproject scheduling to minimise the maximal cash flow gap under different payment patterns," Annals of Operations Research, Springer, vol. 338(1), pages 115-149, July.
    8. Leyman, Pieter & Vanhoucke, Mario, 2017. "Capital- and resource-constrained project scheduling with net present value optimization," European Journal of Operational Research, Elsevier, vol. 256(3), pages 757-776.
    9. Mika, Marek & Waligora, Grzegorz & Weglarz, Jan, 2005. "Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models," European Journal of Operational Research, Elsevier, vol. 164(3), pages 639-668, August.
    10. Peymankar, Mahboobeh & Davari, Morteza & Ranjbar, Mohammad, 2021. "Maximizing the expected net present value in a project with uncertain cash flows," European Journal of Operational Research, Elsevier, vol. 294(2), pages 442-452.
    11. Bruni, Maria Elena & Hazır, Öncü, 2024. "A risk-averse distributionally robust project scheduling model to address payment delays," European Journal of Operational Research, Elsevier, vol. 318(2), pages 398-407.
    12. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    13. Wenhui Zhao & Nicholas G. Hall & Zhixin Liu, 2020. "Project Evaluation and Selection with Task Failures," Production and Operations Management, Production and Operations Management Society, vol. 29(2), pages 428-446, February.
    14. Mario Vanhoucke & Erik Demeulemeester & Willy Herroelen, 2001. "On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints," Management Science, INFORMS, vol. 47(8), pages 1113-1121, August.
    15. M. Vanhoucke, 2006. "An efficient hybrid search algorithm for various optimization problems," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/365, Ghent University, Faculty of Economics and Business Administration.
    16. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    17. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    18. Wiesemann, Wolfram & Kuhn, Daniel & Rustem, Berç, 2010. "Maximizing the net present value of a project under uncertainty," European Journal of Operational Research, Elsevier, vol. 202(2), pages 356-367, April.
    19. Colvin, Matthew & Maravelias, Christos T., 2011. "R&D pipeline management: Task interdependencies and risk management," European Journal of Operational Research, Elsevier, vol. 215(3), pages 616-628, December.
    20. 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).

    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:259:y:2017:i:2:p:642-653. 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.