1 resultado para Irrigation scheduling
em Universidade Complutense de Madrid
Filtro por publicador
- Repository Napier (3)
- Academic Research Repository at Institute of Developing Economies (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (6)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (9)
- Applied Math and Science Education Repository - Washington - USA (1)
- Aquatic Commons (9)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (5)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (3)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (17)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (10)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (114)
- Boston University Digital Common (14)
- Brock University, Canada (4)
- CaltechTHESIS (2)
- Cambridge University Engineering Department Publications Database (19)
- CentAUR: Central Archive University of Reading - UK (19)
- Center for Jewish History Digital Collections (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (33)
- Cochin University of Science & Technology (CUSAT), India (4)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- Dalarna University College Electronic Archive (5)
- Department of Computer Science E-Repository - King's College London, Strand, London (16)
- Digital Commons - Michigan Tech (1)
- Digital Repository at Iowa State University (1)
- DigitalCommons@University of Nebraska - Lincoln (5)
- Duke University (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (27)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (4)
- Greenwich Academic Literature Archive - UK (47)
- Helda - Digital Repository of University of Helsinki (1)
- Indian Institute of Science - Bangalore - Índia (105)
- Instituto Politécnico do Porto, Portugal (69)
- Massachusetts Institute of Technology (4)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (76)
- Queensland University of Technology - ePrints Archive (70)
- RDBU - Repositório Digital da Biblioteca da Unisinos (1)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (1)
- Repositório Científico da Universidade de Évora - Portugal (4)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (78)
- SAPIENTIA - Universidade do Algarve - Portugal (4)
- Universidad Autónoma de Nuevo León, Mexico (3)
- Universidad de Alicante (2)
- Universidad Politécnica de Madrid (50)
- Universidade Complutense de Madrid (1)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade Federal do Pará (1)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (7)
- University of Michigan (36)
- University of Queensland eSpace - Australia (1)
- University of Southampton, United Kingdom (1)
- University of Washington (1)
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.