IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v10y1976i2p149-168.html
   My bibliography  Save this article

Route Constrained Fleet Scheduling

Author

Listed:
  • Clifford S. Orloff

    (Princeton University, Princeton, New Jersey)

Abstract

This paper attempts to provide some insight into the structure of a large class of fleet scheduling problems. Scheduling under fixed due date constraints is shown to be easily solved using a new formulation of the problem. Scheduling under flexible due date constraints is shown to be inherently complex, and strong evidence is given for asserting that no efficient (polynomial bounded) algorithm exists for solving this problem exactly. A fast heuristic approach is described which has worked well in some school bus scheduling applications.

Suggested Citation

  • Clifford S. Orloff, 1976. "Route Constrained Fleet Scheduling," Transportation Science, INFORMS, vol. 10(2), pages 149-168, May.
    • Handle: RePEc:inm:ortrsc:v:10:y:1976:i:2:p:149-168
    DOI: 10.1287/trsc.10.2.149
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.10.2.149
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.10.2.149?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. Mathias Michaelis & Anita Schöbel, 2009. "Integrating line planning, timetabling, and vehicle scheduling: a customer-oriented heuristic," Public Transport, Springer, vol. 1(3), pages 211-232, August.
    2. Ishwar Murthy & Shenq‐Shyong Her, 1992. "Solving min‐max shortest‐path problems on a network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 669-683, August.
    3. Carlsson, John Gunnar & Behroozi, Mehdi, 2017. "Worst-case demand distributions in vehicle routing," European Journal of Operational Research, Elsevier, vol. 256(2), pages 462-472.
    4. Kim, Byung-In & Kim, Seongbae & Park, Junhyuk, 2012. "A school bus scheduling problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 577-585.
    5. Kuo, Yong-Hong & Leung, Janny M.Y. & Yan, Yimo, 2023. "Public transport for smart cities: Recent innovations and future challenges," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1001-1026.
    6. Seyed Mahdi Homayouni & Dalila B. M. M. Fontes, 2021. "Production and transport scheduling in flexible job shop manufacturing systems," Journal of Global Optimization, Springer, vol. 79(2), pages 463-502, February.
    7. Wang, Zhongxiang & Haghani, Ali, 2020. "Column generation-based stochastic school bell time and bus scheduling optimization," European Journal of Operational Research, Elsevier, vol. 286(3), pages 1087-1102.
    8. Mancini, Simona & Gansterer, Margaretha, 2021. "Vehicle scheduling for rental-with-driver services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).

    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:ortrsc:v:10:y:1976:i:2:p:149-168. 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.