IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v48y2000i3p351-361.html
   My bibliography  Save this article

Operations Research at Bell Laboratories through the 1970s: Part II

Author

Listed:
  • Cree S. Dawson

    (100 Bent Tree Drive, Lauren Park, North Carolina 28739)

  • Charles J. McCallum

    (First USA Bank, N.A., 201 North Walnut Street, Wilmington, Delaware 19317)

  • R. Bradford Murphy

    (Basking Ridge, New Jersey)

  • Eric Wolman

    (George Mason University, Fairfax, Virginia)

Abstract

This historical account of operations research at Bell Laboratories was drafted in the late 1970s when the authors were part of the Operations Research Center within Bell Laboratories at AT&T; it has not previously appeared in the open literature. We have added a few references to later publications that describe particular aspects of the period covered. Discussions of technological practices and organizational arrangements expressed in the present tense represent a viewpoint of about 1980, before “divestiture” split up the Bell System. A comprehensive table of contents for parts I, II, and III can be found in the Online Collection of the Operations Research Home Page, at www.informs.org/pubs .We describe the work done in the Bell System up to about 1980, mainly at Bell Labs, both in developing the techniques of operations research and in applying them to the telecommunications business. This account does not include military OR or direct support of other federal government activities. Part II covers capacity expansion and operations analysis.

Suggested Citation

  • Cree S. Dawson & Charles J. McCallum & R. Bradford Murphy & Eric Wolman, 2000. "Operations Research at Bell Laboratories through the 1970s: Part II," Operations Research, INFORMS, vol. 48(3), pages 351-361, June.
    • Handle: RePEc:inm:oropre:v:48:y:2000:i:3:p:351-361
    DOI: 10.1287/opre.48.3.351.12426
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.48.3.351.12426
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.48.3.351.12426?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
    ---><---

    References listed on IDEAS

    as
    1. Cree S. Dawson & Charles J. McCallum & R. Bradford Murphy & Eric Wolman, 2000. "Operations Research at Bell Laboratories Through the 1970s: Part I," Operations Research, INFORMS, vol. 48(2), pages 205-215, April.
    2. M. Segal, 1970. "A Multiserver System with Preemptive Priorities," Operations Research, INFORMS, vol. 18(2), pages 316-323, April.
    3. Stephen Chen & Charles J. McCallum, 1977. "The Application of Management Science to the Design of Telephone Directories," Interfaces, INFORMS, vol. 8(1-part-2), pages 58-69, November.
    4. John H. Rath & Diane Sheng, 1979. "Technical Note—Approximations for Overflows from Queues with a Finite Waiting Room," Operations Research, INFORMS, vol. 27(6), pages 1208-1216, December.
    5. Cree S. Dawson & Charles J. McCallum & R. Bradford Murphy & Eric Wolman, 2000. "Operations Research at Bell Laboratories through the 1970s: Part III," Operations Research, INFORMS, vol. 48(4), pages 517-526, August.
    6. M. Segal, 1974. "The Operator-Scheduling Problem: A Network-Flow Approach," Operations Research, INFORMS, vol. 22(4), pages 808-823, August.
    7. B. Avi-Itzhak & D. P. Heyman, 1973. "Approximate Queuing Models for Multiprogramming Computer Systems," Operations Research, INFORMS, vol. 21(6), pages 1212-1230, December.
    8. Kochman, G. A. & McCallum, C. J., 1981. "Facility location models for planning a transatlantic communications network," European Journal of Operational Research, Elsevier, vol. 6(2), pages 205-211, February.
    9. D. P. Heyman & M. Segal, 1974. "Technical Note—Conditional Delays Measured in Events for the M / M / c Queue," Operations Research, INFORMS, vol. 22(3), pages 575-581, June.
    10. Daniel P. Heyman & Kneale T. Marshall, 1968. "Bounds on the Optimal Operating Policy for a Class of Single-Server Queues," Operations Research, INFORMS, vol. 16(6), pages 1138-1146, December.
    11. Daniel P. Heyman, 1968. "Optimal Operating Policies for M / G /1 Queuing Systems," Operations Research, INFORMS, vol. 16(2), pages 362-382, April.
    12. J. L. Showers & L. M. Chakrin, 1981. "Reducing Uncollectible Revenue from Residential Telephone Customers," Interfaces, INFORMS, vol. 11(6), pages 21-34, December.
    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. ManMohan S. Sodhi & Christopher S. Tang, 2008. "The OR/MS Ecosystem: Strengths, Weaknesses, Opportunities, and Threats," Operations Research, INFORMS, vol. 56(2), pages 267-277, April.
    2. Valentiny, Pál, 2024. "Mennyire innovatívak a Big Tech vállalatok? [How innovative are Big Tech companies?]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(1), pages 22-56.

    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. Valentiny, Pál, 2024. "Mennyire innovatívak a Big Tech vállalatok? [How innovative are Big Tech companies?]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(1), pages 22-56.
    2. ManMohan S. Sodhi & Christopher S. Tang, 2008. "The OR/MS Ecosystem: Strengths, Weaknesses, Opportunities, and Threats," Operations Research, INFORMS, vol. 56(2), pages 267-277, April.
    3. A. Baykal Hafızoğlu & Esma S. Gel & Pınar Keskinocak, 2013. "Expected Tardiness Computations in Multiclass Priority M / M / c Queues," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 364-376, May.
    4. Tayfur Altiok & Goang An Shiue, 1995. "Single‐stage, multi‐product production/inventory systems with lost sales," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 889-913, September.
    5. Aykin, Turgut, 2000. "A comparative evaluation of modeling approaches to the labor shift scheduling problem," European Journal of Operational Research, Elsevier, vol. 125(2), pages 381-397, September.
    6. Dietz, Dennis C., 2011. "Practical scheduling for call center operations," Omega, Elsevier, vol. 39(5), pages 550-557, October.
    7. Dong-Yuh Yang & Po-Kai Chang, 2015. "A parametric programming solution to the -policy queue with fuzzy parameters," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(4), pages 590-598, March.
    8. Saravanan Kesavan & Susan J. Lambert & Joan C. Williams & Pradeep K. Pendem, 2022. "Doing Well by Doing Good: Improving Retail Store Performance with Responsible Scheduling Practices at the Gap, Inc," Management Science, INFORMS, vol. 68(11), pages 7818-7836, November.
    9. Martin J. Fischer & Carl M. Harris, 1991. "Heterogeneous multitrunking queueing systems with thresholds," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 579-597, August.
    10. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    11. Brusco, Michael J. & Johns, Tony R., 1996. "A sequential integer programming method for discontinuous labor tour scheduling," European Journal of Operational Research, Elsevier, vol. 95(3), pages 537-548, December.
    12. Gary M. Thompson, 1997. "Labor staffing and scheduling models for controlling service levels," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(8), pages 719-740, December.
    13. Banu Sungur & Cemal Özgüven & Yasemin Kariper, 2017. "Shift scheduling with break windows, ideal break periods, and ideal waiting times," Flexible Services and Manufacturing Journal, Springer, vol. 29(2), pages 203-222, June.
    14. İlker Baybars & Richard H. Edahl, 1988. "A heuristic method for facility planning in telecommunications networks with multiple alternate routes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(4), pages 503-528, August.
    15. Attila Tóth & Miklós Krész, 2013. "An efficient solution approach for real-world driver scheduling problems in urban bus transportation," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(1), pages 75-94, June.
    16. Giovanni Felici & Claudio Gentile, 2004. "A Polyhedral Approach for the Staff Rostering Problem," Management Science, INFORMS, vol. 50(3), pages 381-393, March.
    17. Jing Jia & Sunderesh S. Heragu, 2009. "Solving Semi-Open Queuing Networks," Operations Research, INFORMS, vol. 57(2), pages 391-401, April.
    18. Wei Li & Attahiru Sule Alfa, 2000. "Optimal policies for M/M/m queue with two different kinds of (N, T)‐policies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 240-258, April.
    19. Boronico, Jess S. & Siegel, Philip H., 1998. "Capacity planning for toll roadways incorporating consumer wait time costs," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(4), pages 297-310, May.
    20. Brusco, Michael J. & Jacobs, Larry W., 1995. "Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations," European Journal of Operational Research, Elsevier, vol. 86(2), pages 249-261, October.

    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:oropre:v:48:y:2000:i:3:p:351-361. 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: 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.