1 resultado para Lot sizing and scheduling problems
em Repositório Científico da Universidade de Évora - Portugal
Filtro por publicador
- Academic Archive On-line (Stockholm University; Sweden) (1)
- Academic Research Repository at Institute of Developing Economies (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (23)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (21)
- Aston University Research Archive (29)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (15)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (36)
- 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 (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (61)
- Brock University, Canada (12)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (4)
- CamPuce - an association for the promotion of science and humanities in African Countries (1)
- CentAUR: Central Archive University of Reading - UK (53)
- Central European University - Research Support Scheme (3)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (1)
- Cochin University of Science & Technology (CUSAT), India (15)
- Coffee Science - Universidade Federal de Lavras (1)
- Collection Of Biostatistics Research Archive (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (27)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (27)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Dalarna University College Electronic Archive (9)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- Digital Archives@Colby (1)
- Digital Commons - Michigan Tech (3)
- Digital Commons @ DU | University of Denver Research (5)
- Digital Commons at Florida International University (7)
- Digital Peer Publishing (5)
- DigitalCommons@The Texas Medical Center (4)
- DigitalCommons@University of Nebraska - Lincoln (6)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (31)
- 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 (5)
- Instituto Politécnico do Porto, Portugal (29)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (4)
- Martin Luther Universitat Halle Wittenberg, Germany (1)
- Massachusetts Institute of Technology (2)
- Ministerio de Cultura, Spain (2)
- National Center for Biotechnology Information - NCBI (5)
- Nottingham eTheses (21)
- Open Access Repository of Indian Theses (1)
- Publishing Network for Geoscientific & Environmental Data (6)
- 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 (4)
- Repositório da Produção Científica e Intelectual da Unicamp (1)
- Repositorio de la Universidad de Cuenca (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (2)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (2)
- Repositório do Centro Hospitalar de Lisboa Central, EPE - Centro Hospitalar de Lisboa Central, EPE, Portugal (2)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (85)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (5)
- Scielo Saúde Pública - SP (18)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (1)
- Universidad de Alicante (4)
- Universidad del Rosario, Colombia (3)
- Universidad Politécnica de Madrid (23)
- Universidade Complutense de Madrid (3)
- Universidade do Minho (8)
- Universidade dos Açores - Portugal (1)
- Universidade Federal do Pará (3)
- Universidade Federal do Rio Grande do Norte (UFRN) (3)
- Universidade Metodista de São Paulo (3)
- Universita di Parma (1)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Lausanne, Switzerland (44)
- Université de Montréal (4)
- Université de Montréal, Canada (14)
- Université Laval Mémoires et thèses électroniques (1)
- University of Connecticut - USA (1)
- University of Michigan (88)
- University of Queensland eSpace - Australia (52)
- University of Southampton, United Kingdom (1)
- University of Washington (3)
- WestminsterResearch - UK (1)
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.