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

Letter to the Editor---A Comment on Edie's “Traffic Delays at Toll Booths”

Author

Listed:
  • George B. Dantzig

    (The Rand Corporation, Santa Monica, California)

Abstract

E. W. Paxson of Rand has suggested that linear programming methods could be used as an alternative procedure in the scheduling section of Leslie C. Edie's interesting paper on “Traffic Delays at Toll Booths” (Leslie C. Edie. 1954. Traffic delays at toll booths. J. Opns. Res. Soc. Am. 2 107.). The purpose of this note is to elaborate on this suggestion. Operations Research , ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.

Suggested Citation

  • George B. Dantzig, 1954. "Letter to the Editor---A Comment on Edie's “Traffic Delays at Toll Booths”," Operations Research, INFORMS, vol. 2(3), pages 339-341, August.
    • Handle: RePEc:inm:oropre:v:2:y:1954:i:3:p:339-341
    DOI: 10.1287/opre.2.3.339
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2.3.339
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2.3.339?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. Sana Dahmen & Monia Rekik & François Soumis, 2018. "An implicit model for multi-activity shift scheduling problems," Journal of Scheduling, Springer, vol. 21(3), pages 285-304, June.
    2. Anuj Mehrotra & Kenneth E. Murphy & Michael A. Trick, 2000. "Optimal shift scheduling: A branch‐and‐price approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 185-200, April.
    3. Stephen E. Bechtold & Larry W. Jacobs, 1996. "The equivalence of general set‐covering and implicit integer programming formulations for shift scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(2), pages 233-249, March.
    4. De Bruecker, Philippe & Beliën, Jeroen & Van den Bergh, Jorne & Demeulemeester, Erik, 2018. "A three-stage mixed integer programming approach for optimizing the skill mix and training schedules for aircraft maintenance," European Journal of Operational Research, Elsevier, vol. 267(2), pages 439-452.
    5. S Casado & M Laguna & J Pacheco, 2005. "Heuristical labour scheduling to optimize airport passenger flows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(6), pages 649-658, June.
    6. Hans Corsten & Ferdinand Becker & Hagen Salewski, 2020. "Integrating truck and workforce scheduling in a cross-dock: analysis of different workforce coordination policies," Journal of Business Economics, Springer, vol. 90(2), pages 207-237, March.
    7. He, Fang & Chaussalet, Thierry & Qu, Rong, 2019. "Controlling understaffing with conditional Value-at-Risk constraint for an integrated nurse scheduling problem under patient demand uncertainty," Operations Research Perspectives, Elsevier, vol. 6(C).
    8. Oliver Czibula & Hanyu Gu & Aaron Russell & Yakov Zinder, 2017. "A multi-stage IP-based heuristic for class timetabling and trainer rostering," Annals of Operations Research, Springer, vol. 252(2), pages 305-333, May.
    9. Marie-Claude Côté & Bernard Gendron & Louis-Martin Rousseau, 2013. "Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 461-474, August.
    10. Najmaddin Akhundov & Nail Tahirov & Christoph H. Glock, 2022. "Optimal Scheduling of Waitstaff with Different Experience Levels at a Restaurant Chain," Interfaces, INFORMS, vol. 52(4), pages 324-343, July.

    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:inm:oropre:v:2:y:1954:i:3:p:339-341. 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.