IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v32y2023i12p3931-3950.html
   My bibliography  Save this article

Evaluation Timing with Dynamic Information: Optimization and Heuristic

Author

Listed:
  • Lijun Bo
  • Meng Li
  • Tingting Zhang

Abstract

Product evaluation is an essential business process, and digital innovation has made it possible for companies to immediately process available information. We develop a model where a company continuously assesses information that follows a doubly stochastic Poisson process with a mean‐reverting and stochastic intensity. Accordingly, the company faces a two‐dimensional optimal stopping problem in which the company continues to evaluate the product if and only if the product reputation and information intensity remain in a continuation set. We employ a probabilistic approach to prove that the continuation set takes the form of an open interval for any fixed information arrival intensity. Given the complicated nature of the optimal solutions, we develop an asymptotic expansive solution, and numerical studies show that our solution performs well. We also analyze a heuristic solution where the company substitutes the dynamic intensity with a constant intensity. Interestingly, we find that this heuristic company does not necessarily benefit from having a higher product reputation.

Suggested Citation

  • Lijun Bo & Meng Li & Tingting Zhang, 2023. "Evaluation Timing with Dynamic Information: Optimization and Heuristic," Production and Operations Management, Production and Operations Management Society, vol. 32(12), pages 3931-3950, December.
  • Handle: RePEc:bla:popmgt:v:32:y:2023:i:12:p:3931-3950
    DOI: 10.1111/poms.14070
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.14070
    Download Restriction: no

    File URL: https://libkey.io/10.1111/poms.14070?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:bla:popmgt:v:32:y:2023:i:12:p:3931-3950. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    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.