IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v97y1997i1p94-104.html
   My bibliography  Save this article

A combined transportation and scheduling problem

Author

Listed:
  • Equi, Luisa
  • Gallo, Giorgio
  • Marziale, Silvia
  • Weintraub, Andres

Abstract

No abstract is available for this item.

Suggested Citation

  • Equi, Luisa & Gallo, Giorgio & Marziale, Silvia & Weintraub, Andres, 1997. "A combined transportation and scheduling problem," European Journal of Operational Research, Elsevier, vol. 97(1), pages 94-104, February.
    • Handle: RePEc:eee:ejores:v:97:y:1997:i:1:p:94-104
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)00085-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Carraresi, P. & Gallo, G., 1984. "Network models for vehicle and crew scheduling," European Journal of Operational Research, Elsevier, vol. 16(2), pages 139-151, May.
    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. Dall'Orto, Leonardo Campo & Crainic, Teodor Gabriel & Leal, Jose Eugenio & Powell, Warren B., 2006. "The single-node dynamic service scheduling and dispatching problem," European Journal of Operational Research, Elsevier, vol. 170(1), pages 1-23, April.
    2. Guoyou Yue, 2021. "A Review of the Research on Emergency Logistics for Tropical Cyclone Disasters in Guangxi," GATR Journals gjbssr591, Global Academy of Training and Research (GATR) Enterprise.
    3. Joe Naoum-Sawaya & Bissan Ghaddar, 2017. "Cutting plane approach for the maximum flow interdiction problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(12), pages 1553-1569, December.
    4. Jianfeng Lu & Xiaoxia Wang & Jiahong Zhao, 2021. "Optimization of Emergency Supplies Scheduling for Hazardous Chemicals Storage Considering Risk," Sustainability, MDPI, vol. 13(19), pages 1-15, September.
    5. Yanyan Wang & Vicki M. Bier & Baiqing Sun, 2019. "Measuring and Achieving Equity in Multiperiod Emergency Material Allocation," Risk Analysis, John Wiley & Sons, vol. 39(11), pages 2408-2426, November.
    6. Guoyou Yue, 2021. "Building an Awareness Model of Emergency Supplies Dispatching for Tropical Cyclone Disasters," GATR Journals jber195, Global Academy of Training and Research (GATR) Enterprise.
    7. Christina N. Burt & Lou Caccetta, 2014. "Equipment Selection for Surface Mining: A Review," Interfaces, INFORMS, vol. 44(2), pages 143-162, April.

    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. Kulkarni, Sarang & Krishnamoorthy, Mohan & Ranade, Abhiram & Ernst, Andreas T. & Patil, Rahul, 2018. "A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 457-487.
    2. Vaidyanathan, Balachandran, 2007. "Multi-Commodity Network Flow Based Approaches for the Railroad Crew Scheduling Problem," 48th Annual Transportation Research Forum, Boston, Massachusetts, March 15-17, 2007 207928, Transportation Research Forum.
    3. Gábor Maróti & Leo Kroon, 2005. "Maintenance Routing for Train Units: The Transition Model," Transportation Science, INFORMS, vol. 39(4), pages 518-525, November.
    4. Benchimol, Pascal & Desaulniers, Guy & Desrosiers, Jacques, 2012. "Stabilized dynamic constraint aggregation for solving set partitioning problems," European Journal of Operational Research, Elsevier, vol. 223(2), pages 360-371.
    5. Blanco, Víctor & Conde, Eduardo & Hinojosa, Yolanda & Puerto, Justo, 2020. "An optimization model for line planning and timetabling in automated urban metro subway networks. A case study," Omega, Elsevier, vol. 92(C).
    6. Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.
    7. Carraresi, Paolo & Malucelli, Federico & Pallottino, Stefano, 1996. "Regional mass transit assignment with resource constraints," Transportation Research Part B: Methodological, Elsevier, vol. 30(2), pages 81-98, April.
    8. Ching-Chung Kuo, 2011. "Optimal assignment of resources to strengthen the weakest link in an uncertain environment," Annals of Operations Research, Springer, vol. 186(1), pages 159-173, June.
    9. Ahuja, Ravindra K., 1956-, 1997. "Algorithms for the simple equal flow problem," Working papers WP 3960-97., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    10. Niu, Huimin & Zhou, Xuesong & Tian, Xiaopeng, 2018. "Coordinating assignment and routing decisions in transit vehicle schedules: A variable-splitting Lagrangian decomposition approach for solution symmetry breaking," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 70-101.
    11. Chu, Sydney C.K., 2007. "Generating, scheduling and rostering of shift crew-duties: Applications at the Hong Kong International Airport," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1764-1778, March.
    12. Haghani, Ali & Banihashemi, Mohamadreza & Chiang, Kun-Hung, 2003. "A comparative analysis of bus transit vehicle scheduling models," Transportation Research Part B: Methodological, Elsevier, vol. 37(4), pages 301-322, May.
    13. Haghani, Ali & Banihashemi, Mohamadreza, 2002. "Heuristic approaches for solving large-scale bus transit vehicle scheduling problem with route time constraints," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(4), pages 309-333, May.
    14. 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.
    15. Heil, Julia & Hoffmann, Kirsten & Buscher, Udo, 2020. "Railway crew scheduling: Models, methods and applications," European Journal of Operational Research, Elsevier, vol. 283(2), pages 405-425.
    16. Ravindra K. Ahuja & James B. Orlin & Giovanni M. Sechi & Paola Zuddas, 1999. "Algorithms for the Simple Equal Flow Problem," Management Science, INFORMS, vol. 45(10), pages 1440-1455, October.
    17. Neufeld, Janis S. & Scheffler, Martin & Tamke, Felix & Hoffmann, Kirsten & Buscher, Udo, 2021. "An efficient column generation approach for practical railway crew scheduling with attendance rates," European Journal of Operational Research, Elsevier, vol. 293(3), pages 1113-1130.
    18. Wark, Peter & Holt, John & Ronnqvist, Mikael & Ryan, David, 1997. "Aircrew schedule generation using repeated matching," European Journal of Operational Research, Elsevier, vol. 102(1), pages 21-35, October.
    19. Christina Büsing & Arie M. C. A. Koster & Sabrina Schmitz, 2022. "Robust minimum cost flow problem under consistent flow constraints," Annals of Operations Research, Springer, vol. 312(2), pages 691-722, May.

    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:eee:ejores:v:97:y:1997:i:1:p:94-104. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.