1 resultado para SCHEDULING PROBLEMS
em Universidade Complutense de Madrid
Filtro por publicador
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (6)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archive of European Integration (53)
- Aston University Research Archive (6)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (25)
- Biblioteca Virtual del Sistema Sanitario Público de Andalucía (BV-SSPA), Junta de Andalucía. Consejería de Salud y Bienestar Social, Spain (1)
- Biodiversity Heritage Library, United States (7)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (10)
- Brock University, Canada (11)
- Bulgarian Digital Mathematics Library at IMI-BAS (3)
- CentAUR: Central Archive University of Reading - UK (76)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (4)
- Cochin University of Science & Technology (CUSAT), India (40)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (95)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Dalarna University College Electronic Archive (3)
- Digital Commons at Florida International University (3)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (57)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (1)
- Greenwich Academic Literature Archive - UK (3)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Institute of Public Health in Ireland, Ireland (8)
- Instituto Politécnico do Porto, Portugal (184)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (8)
- Martin Luther Universitat Halle Wittenberg, Germany (6)
- Massachusetts Institute of Technology (4)
- Ministerio de Cultura, Spain (15)
- Nottingham eTheses (28)
- Portal do Conhecimento - Ministerio do Ensino Superior Ciencia e Inovacao, Cape Verde (1)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (2)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (14)
- Repositório da Produção Científica e Intelectual da Unicamp (4)
- Repositório da Universidade Federal do Espírito Santo (UFES), Brazil (1)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (7)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (11)
- School of Medicine, Washington University, United States (5)
- Scielo Saúde Pública - SP (35)
- Scottish Institute for Research in Economics (SIRE) (SIRE), United Kingdom (1)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (3)
- Universidad Autónoma de Nuevo León, Mexico (1)
- Universidad del Rosario, Colombia (8)
- Universidad Politécnica de Madrid (4)
- Universidade Complutense de Madrid (1)
- Universidade do Minho (9)
- Universidade dos Açores - Portugal (1)
- Universitat de Girona, Spain (10)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (10)
- Université de Lausanne, Switzerland (87)
- Université de Montréal, Canada (20)
- Université Laval Mémoires et thèses électroniques (1)
- University of Queensland eSpace - Australia (83)
- University of Southampton, United Kingdom (3)
Resumo:
In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort.