IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v208y2013i1p5-2610.1007-s10479-013-1429-x.html
   My bibliography  Save this article

On the life and work of Cyrus Derman

Author

Listed:
  • Michael Katehakis
  • Ingram Olkin
  • Sheldon Ross
  • Jian Yang

Abstract

This article provides a brief biographical synopsis of the life of Cyrus Derman and a comprehensive summary of his research. Professor Cyrus Derman was known among his friends as Cy. Copyright The Author(s) 2013

Suggested Citation

  • Michael Katehakis & Ingram Olkin & Sheldon Ross & Jian Yang, 2013. "On the life and work of Cyrus Derman," Annals of Operations Research, Springer, vol. 208(1), pages 5-26, September.
    • Handle: RePEc:spr:annopr:v:208:y:2013:i:1:p:5-26:10.1007/s10479-013-1429-x
    DOI: 10.1007/s10479-013-1429-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-013-1429-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-013-1429-x?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. Cyrus Derman & Edward Ignall, 1975. "Technical Note—On the Stochastic Ordering of Markov Chains," Operations Research, INFORMS, vol. 23(3), pages 574-576, June.
    2. C. Derman & G. J. Lieberman & S. M. Ross, 1976. "Optimal System Allocations with Penalty Costs," Management Science, INFORMS, vol. 23(4), pages 399-403, December.
    3. Michael N. Katehakis & Cyrus Derman, 1989. "On the Maintenance of Systems Composed of Highly Reliable Components," Management Science, INFORMS, vol. 35(5), pages 551-560, May.
    4. Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1972. "A Sequential Stochastic Assignment Problem," Management Science, INFORMS, vol. 18(7), pages 349-355, March.
    5. Eric Brodheim & Cyrus Derman & Gregory Prastacos, 1975. "On the Evaluation of a Class of Inventory Policies for Perishable Products Such as Blood," Management Science, INFORMS, vol. 21(11), pages 1320-1325, July.
    6. C. Derman & G. J. Lieberman, 1967. "A Markovian Decision Model for a Joint Replacement and Stocking Problem," Management Science, INFORMS, vol. 13(9), pages 609-617, May.
    7. Michael N. Katehakis & Cyrus Derman, 1984. "Optimal Repair Allocation in a Series System," Mathematics of Operations Research, INFORMS, vol. 9(4), pages 615-623, November.
    8. C. Derman & G. J. Lieberman & S. M. Ross, 1979. "Adaptive disposal models," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 26(1), pages 33-40, March.
    9. C. Derman & H. Solomon, 1958. "Development and Evaluation of Surveillance Sampling Plans," Management Science, INFORMS, vol. 5(1), pages 72-88, October.
    10. Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1974. "Assembly of systems having maximum reliability," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 21(1), pages 1-12, March.
    11. C. Derman & G. J. Lieberman & S. M. Ross, 1984. "On the Use of Replacements to Extend System Life," Operations Research, INFORMS, vol. 32(3), pages 616-627, June.
    12. C. Derman & D. R. Smith, 1980. "An alternative proof of the IFRA property of some shock models," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(4), pages 703-707, December.
    13. C. Derman, 1961. "On minimax surveillance schedules," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 8(4), pages 415-419, December.
    14. Cyrus Derman, 1959. "A Simple Allocation Problem," Management Science, INFORMS, vol. 5(4), pages 453-459, July.
    15. C. Derman & M. Klein, 1959. "Discussion--A Note on the Optimal Depletion of Inventory," Management Science, INFORMS, vol. 5(2), pages 210-213, January.
    16. Cyrus Derman, 1963. "Optimal Replacement and Maintenance Under Markovian Deterioration with Probability Bounds on Failure," Management Science, INFORMS, vol. 9(3), pages 478-481, April.
    17. C. Derman & J. Sacks, 1960. "Replacement of periodically inspected equipment. (An optimal optional stopping rule)," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 7(4), pages 597-607, December.
    18. Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1972. "On optimal assembly of systems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 19(4), pages 569-574, December.
    19. C. Derman & G. J. Lieberman & S. M. Ross, 1974. "Optimal Allocations in the Construction of k-Out-of-n Reliability Systems," Management Science, INFORMS, vol. 21(3), pages 241-250, November.
    20. Chris Albright & Cyrus Derman, 1972. "Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem," Management Science, INFORMS, vol. 19(1), pages 46-51, September.
    21. Cyrus Derman & Arthur F. Veinott, Jr., 1972. "Constrained Markov Decision Chains," Management Science, INFORMS, vol. 19(4-Part-1), pages 389-390, December.
    22. Cyrus Derman & Morton Klein, 1966. "Surveillance of multi‐component systems: A stochastic traveling salesman's problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 13(2), pages 103-111, June.
    23. Cyrus Derman & Morton Klein, 1958. "Inventory Depletion Management," Management Science, INFORMS, vol. 4(4), pages 450-456, July.
    24. Cyrus Derman & Sheldon M. Ross & Zvi Schechner, 1983. "A note on first passage times in birth and death and nonnegative diffusion processes," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 30(2), pages 283-285, June.
    25. Cyrus Derman, 1962. "On Sequential Decisions and Markov Chains," Management Science, INFORMS, vol. 9(1), pages 16-24, October.
    26. C. Derman & D. R. Smith, 1979. "Renewal Decision Problem-Random Horizon," Mathematics of Operations Research, INFORMS, vol. 4(3), pages 225-232, August.
    27. C. Derman & G. J. Lieberman & S. M. Ross, 1978. "A Renewal Decision Problem," Management Science, INFORMS, vol. 24(5), pages 554-561, January.
    28. C. Derman & G. J. Lieberman & S. M. Ross, 1975. "A Stochastic Sequential Allocation Model," Operations Research, INFORMS, vol. 23(6), pages 1120-1130, December.
    29. Cyrus Derman & Morton Klein, 1965. "Some Remarks on Finite Horizon Markovian Decision Models," Operations Research, INFORMS, vol. 13(2), pages 272-278, April.
    Full references (including those not matched with items on IDEAS)

    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. Yeek-Hyun Kim & Lyn Thomas, 2013. "Training and repair policies for stand-by systems," Annals of Operations Research, Springer, vol. 208(1), pages 469-487, September.
    2. David T. Wu & Sheldon M. Ross, 2015. "A stochastic assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(1), pages 23-31, February.
    3. Arash Khatibi & Sheldon H. Jacobson, 2016. "Doubly Stochastic Sequential Assignment Problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(2), pages 124-137, March.
    4. V.D. Dinopoulou & C. Melolidakis, 2001. "Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(8), pages 732-746, December.
    5. Járai, Antal A., 2022. "Asymptotics of the optimum in discrete sequential assignment," Stochastic Processes and their Applications, Elsevier, vol. 148(C), pages 267-277.
    6. Nielsen, Lars Relund & Kristensen, Anders Ringgaard, 2006. "Finding the K best policies in a finite-horizon Markov decision process," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1164-1179, December.
    7. Sheldon Ross & David Wu, 2013. "A generalized coupon collecting model as a parsimonious optimal stochastic assignment model," Annals of Operations Research, Springer, vol. 208(1), pages 133-146, September.
    8. Coit, David W. & Zio, Enrico, 2019. "The evolution of system reliability optimization," Reliability Engineering and System Safety, Elsevier, vol. 192(C).
    9. Mark Brown, 2013. "Sharp bounds for NBUE distributions," Annals of Operations Research, Springer, vol. 208(1), pages 245-250, September.
    10. Rebecca Dizon-Ross & Sheldon M. Ross, 2020. "Dynamic search models with multiple items," Annals of Operations Research, Springer, vol. 288(1), pages 223-245, May.
    11. Xiaoyan Zhu & Way Kuo, 2014. "Importance measures in reliability and mathematical programming," Annals of Operations Research, Springer, vol. 212(1), pages 241-267, January.
    12. Florio, Alexandre M. & Hartl, Richard F. & Minner, Stefan, 2020. "Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 285(1), pages 172-182.
    13. Laura A. McLay & Adrian J. Lee & Sheldon H. Jacobson, 2010. "Risk-Based Policies for Airport Security Checkpoint Screening," Transportation Science, INFORMS, vol. 44(3), pages 333-349, August.
    14. Xuanming Su & Stefanos A. Zenios, 2005. "Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model," Operations Research, INFORMS, vol. 53(3), pages 443-455, June.
    15. Oguzhan Alagoz & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2007. "Determining the Acceptance of Cadaveric Livers Using an Implicit Model of the Waiting List," Operations Research, INFORMS, vol. 55(1), pages 24-36, February.
    16. Adrian Lee & Sheldon Jacobson, 2011. "Sequential stochastic assignment under uncertainty: estimation and convergence," Statistical Inference for Stochastic Processes, Springer, vol. 14(1), pages 21-46, February.
    17. Xuhan Tian & Junmin (Jim) Shi & Xiangtong Qi, 2022. "Stochastic Sequential Allocations for Creative Crowdsourcing," Production and Operations Management, Production and Operations Management Society, vol. 31(2), pages 697-714, February.
    18. Alexander G. Nikolaev & Sheldon H. Jacobson, 2010. "Technical Note ---Stochastic Sequential Decision-Making with a Random Number of Jobs," Operations Research, INFORMS, vol. 58(4-part-1), pages 1023-1027, August.
    19. Hak Chun, Young, 1996. "Selecting the best choice in the weighted secretary problem," European Journal of Operational Research, Elsevier, vol. 92(1), pages 135-147, July.
    20. Arash Khatibi & Golshid Baharian & Banafsheh Behzad & Sheldon Jacobson, 2015. "Extensions of the sequential stochastic assignment problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(3), pages 317-340, December.

    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:spr:annopr:v:208:y:2013:i:1:p:5-26:10.1007/s10479-013-1429-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.