1 resultado para Maintenance scheduling problem
em Universidade Federal do Rio Grande do Norte(UFRN)
Filtro por publicador
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (6)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (3)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Aston University Research Archive (14)
- 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) (49)
- 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 (6)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (27)
- Bulgarian Digital Mathematics Library at IMI-BAS (9)
- CentAUR: Central Archive University of Reading - UK (3)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (4)
- Cochin University of Science & Technology (CUSAT), India (5)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (90)
- Cor-Ciencia - Acuerdo de Bibliotecas Universitarias de Córdoba (ABUC), Argentina (2)
- 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 (6)
- Department of Computer Science E-Repository - King's College London, Strand, London (3)
- Digital Commons at Florida International University (15)
- Digital Peer Publishing (1)
- DigitalCommons@University of Nebraska - Lincoln (2)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (8)
- DRUM (Digital Repository at the University of Maryland) (1)
- Galway Mayo Institute of Technology, Ireland (1)
- Greenwich Academic Literature Archive - UK (1)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Institute of Public Health in Ireland, Ireland (8)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico do Porto, Portugal (241)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (23)
- Martin Luther Universitat Halle Wittenberg, Germany (6)
- Massachusetts Institute of Technology (2)
- Memorial University Research Repository (1)
- Nottingham eTheses (30)
- Portal do Conhecimento - Ministerio do Ensino Superior Ciencia e Inovacao, Cape Verde (4)
- RDBU - Repositório Digital da Biblioteca da Unisinos (2)
- Repositorio Academico Digital UANL (1)
- Repositório Científico da Universidade de Évora - Portugal (4)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (36)
- Repositório da Produção Científica e Intelectual da Unicamp (3)
- Repositório da Universidade Federal do Espírito Santo (UFES), Brazil (1)
- Repositório do Centro Hospitalar de Lisboa Central, EPE - Centro Hospitalar de Lisboa Central, EPE, Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (30)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (20)
- Scielo Saúde Pública - SP (33)
- Scottish Institute for Research in Economics (SIRE) (SIRE), United Kingdom (1)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (2)
- Universidad de Alicante (1)
- Universidad Politécnica de Madrid (11)
- Universidade Complutense de Madrid (2)
- Universidade do Minho (20)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (95)
- Université de Montréal, Canada (4)
- Université Laval Mémoires et thèses électroniques (2)
- University of Michigan (3)
- University of Queensland eSpace - Australia (99)
Resumo:
This work aims to "build" rostering urban bus crews to minimize the cost of overtime. For this purpose a mathematical model was developed based on case study in an urban transport company in the metropolitan region of Natal. This problem is usually known in the literature as the Crew Scheduling Problem (CSP) and classified as NP-hard. The mathematical programming takes into account constraints such as: completion of all trips, daily and maximum allowable range of home and / or food. We used the Xpress-MP software to implement and validate the proposed model. For the tested instances the application of the model allowed a reduction in overtime from 38% to 84%