IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v9y1979i5p135-141.html
   My bibliography  Save this article

The Last Mohicans of OR: OR, it Might Be in the “Genes”

Author

Listed:
  • Milan Zeleny

    (Graduate School of Business, 419 Uris Hall, Columbia University, New York, New York 10027)

Abstract

The recent exchange of opinions among Byrd [Byrd, J., Jr. 1978. The value of queueing theory. Interfaces 8 (3) 22--26.], Kolesar [Kolesar, P. 1979. A quick and dirty response to the quick and dirty crowd: Particularly to Jack Byrd's ‘The value of queueing theory’. Interfaces 9 (2) 77--82.], and Vazsonyi [Vazsonyi, A. 1979. To queue or not to queue: A rejoinder. Interfaces 9 (2) 83--86.], although apparently significant and undoubtedly intense, deals only with the symptoms and not with the causes of a deeply felt crisis of identity emerging within the Operations Research and Management Sciences community. Queueing theory and its applications has played the role of an unfortunate scapegoat for the real issue: OR/MS is being challenged and its usefulness in modern society is questioned .One of the most serious and also most merciless challenges to OR/MS comes from one of its “founding fathers,” Russell Ackoff [Ackoff, R. L. 1979. The future of operational research is past. J. Oper. Res. Soc. 30 (2) 93--104.]. It is the issue of OR/MS as a whole , not queueing theory, which should be debated on the pages of Interfaces . Ackoff declares: American Operations Research is dead even though it has yet to be buried .

Suggested Citation

  • Milan Zeleny, 1979. "The Last Mohicans of OR: OR, it Might Be in the “Genes”," Interfaces, INFORMS, vol. 9(5), pages 135-141, November.
  • Handle: RePEc:inm:orinte:v:9:y:1979:i:5:p:135-141
    DOI: 10.1287/inte.9.5.135
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.9.5.135
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.9.5.135?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
    ---><---

    Citations

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


    Cited by:

    1. Tsionas, Mike G., 2018. "A Bayesian approach to find Pareto optima in multiobjective programming problems using Sequential Monte Carlo algorithms," Omega, Elsevier, vol. 77(C), pages 73-79.

    More about this item

    Keywords

    professional: OR/MS philosophy;

    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:inm:orinte:v:9:y:1979:i:5:p:135-141. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.