1 resultado para Just-in-time (manufacturing system)
em Repository Napier
Filtro por publicador
- KUPS-Datenbank - Universität zu Köln - Kölner UniversitätsPublikationsServer (1)
- Repository Napier (1)
- Aberystwyth University Repository - Reino Unido (2)
- Academic Archive On-line (Jönköping University; Sweden) (1)
- Academic Research Repository at Institute of Developing Economies (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (4)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (3)
- Aquatic Commons (10)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (3)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (3)
- Archive of European Integration (17)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (2)
- Aston University Research Archive (67)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (7)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (4)
- Biodiversity Heritage Library, United States (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (39)
- Boston University Digital Common (3)
- Brock University, Canada (9)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- Cambridge University Engineering Department Publications Database (70)
- CentAUR: Central Archive University of Reading - UK (49)
- Center for Jewish History Digital Collections (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (38)
- Cochin University of Science & Technology (CUSAT), India (11)
- Coffee Science - Universidade Federal de Lavras (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (21)
- CORA - Cork Open Research Archive - University College Cork - Ireland (4)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (3)
- Dalarna University College Electronic Archive (4)
- Deakin Research Online - Australia (74)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Archives@Colby (1)
- Digital Commons - Montana Tech (1)
- Digital Commons @ Winthrop University (2)
- Digital Commons at Florida International University (3)
- Digital Peer Publishing (4)
- DigitalCommons@The Texas Medical Center (3)
- DigitalCommons@University of Nebraska - Lincoln (3)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- Duke University (2)
- Ecology and Society (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- Fachlicher Dokumentenserver Paedagogik/Erziehungswissenschaften (2)
- FUNDAJ - Fundação Joaquim Nabuco (2)
- Glasgow Theses Service (2)
- Greenwich Academic Literature Archive - UK (2)
- Harvard University (2)
- Helda - Digital Repository of University of Helsinki (7)
- Indian Institute of Science - Bangalore - Índia (63)
- Instituto Politécnico do Porto, Portugal (5)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (3)
- Massachusetts Institute of Technology (4)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- Ministerio de Cultura, Spain (2)
- National Center for Biotechnology Information - NCBI (17)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (4)
- Portal de Revistas Científicas Complutenses - Espanha (2)
- Publishing Network for Geoscientific & Environmental Data (9)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (76)
- Queensland University of Technology - ePrints Archive (47)
- Repositorio Académico de la Universidad Nacional de Costa Rica (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (7)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (2)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (73)
- Repositorio Institucional Universidad EAFIT - Medelin - Colombia (1)
- Royal College of Art Research Repository - Uninet Kingdom (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- School of Medicine, Washington University, United States (2)
- Scielo Uruguai (1)
- Universidad de Alicante (2)
- Universidad del Rosario, Colombia (7)
- Universidad Politécnica de Madrid (15)
- Universidade Federal do Pará (1)
- Universita di Parma (2)
- Universitat de Girona, Spain (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Lausanne, Switzerland (1)
- Université de Montréal (1)
- Université de Montréal, Canada (5)
- University of Connecticut - USA (2)
- University of Michigan (43)
- University of Queensland eSpace - Australia (24)
- University of Washington (2)
- WestminsterResearch - UK (8)
Resumo:
The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.