1 resultado para lot sizing and scheduling
em Repositório Científico da Universidade de Évora - Portugal
Filtro por publicador
- JISC Information Environment Repository (1)
- Repository Napier (3)
- University of Cagliari UniCA Eprints (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (5)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Aquatic Commons (10)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (1)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (9)
- Aston University Research Archive (20)
- B-Digital - Universidade Fernando Pessoa - Portugal (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (9)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (9)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (5)
- Bioline International (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (59)
- Boston University Digital Common (20)
- Brock University, Canada (15)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (4)
- Cambridge University Engineering Department Publications Database (28)
- CentAUR: Central Archive University of Reading - UK (3)
- Center for Jewish History Digital Collections (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (48)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (1)
- Cochin University of Science & Technology (CUSAT), India (3)
- Collection Of Biostatistics Research Archive (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Dalarna University College Electronic Archive (4)
- Department of Computer Science E-Repository - King's College London, Strand, London (4)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (2)
- Digital Archives@Colby (1)
- Digital Commons - Michigan Tech (4)
- Digital Commons - Montana Tech (1)
- Digital Commons at Florida International University (11)
- Digital Peer Publishing (5)
- DigitalCommons@The Texas Medical Center (2)
- DigitalCommons@University of Nebraska - Lincoln (2)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (9)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (14)
- Greenwich Academic Literature Archive - UK (53)
- Harvard University (10)
- Helda - Digital Repository of University of Helsinki (15)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (117)
- Instituto Politécnico do Porto, Portugal (11)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (5)
- Memorial University Research Repository (1)
- Ministerio de Cultura, Spain (1)
- Nottingham eTheses (8)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Portal de Revistas Científicas Complutenses - Espanha (2)
- Publishing Network for Geoscientific & Environmental Data (1)
- QSpace: Queen's University - Canada (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (38)
- Queensland University of Technology - ePrints Archive (156)
- Repositório Aberto da Universidade Aberta de Portugal (1)
- Repositorio Academico Digital UANL (1)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (5)
- Repositório digital da Fundação Getúlio Vargas - FGV (2)
- Repositório do Centro Hospitalar de Lisboa Central, EPE - Centro Hospitalar de Lisboa Central, EPE, Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (61)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- Universidad de Alicante (1)
- Universidad del Rosario, Colombia (3)
- Universidad Politécnica de Madrid (20)
- Universidade Complutense de Madrid (1)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade dos Açores - Portugal (1)
- Universidade Federal do Pará (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (7)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (3)
- Université Laval Mémoires et thèses électroniques (1)
- University of Michigan (19)
- University of Queensland eSpace - Australia (6)
- University of Washington (2)
- USA Library of Congress (7)
Resumo:
In aircraft components maintenance shops, components are distributed amongst repair groups and their respective technicians based on the type of repair, on the technicians skills and workload, and on the customer required dates. This distribution planning is typically done in an empirical manner based on the group leader’s past experience. Such a procedure does not provide any performance guarantees, leading frequently to undesirable delays on the delivery of the aircraft components. Among others, a fundamental challenge faced by the group leaders is to decide how to distribute the components that arrive without customer required dates. This paper addresses the problems of prioritizing the randomly arriving of aircraft components (with or without pre-assigned customer required dates) and of optimally distributing them amongst the technicians of the repair groups. We proposed a formula for prioritizing the list of repairs, pointing out the importance of selecting good estimators for the interarrival times between repair requests, the turn-around-times and the man hours for repair. In addition, a model for the assignment and scheduling problem is designed and a preliminary algorithm along with a numerical illustration is presented.