1 resultado para GOAL PROGRAMMING APPROACH
em The Scholarly Commons | School of Hotel Administration
Filtro por publicador
- Aberdeen University (2)
- Abertay Research Collections - Abertay University’s repository (1)
- Aberystwyth University Repository - Reino Unido (3)
- Academic Research Repository at Institute of Developing Economies (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (7)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (4)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (40)
- B-Digital - Universidade Fernando Pessoa - Portugal (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (12)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (11)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (24)
- Boston University Digital Common (6)
- Brock University, Canada (12)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (9)
- CaltechTHESIS (8)
- Cambridge University Engineering Department Publications Database (4)
- CentAUR: Central Archive University of Reading - UK (24)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (4)
- Cochin University of Science & Technology (CUSAT), India (3)
- Coffee Science - Universidade Federal de Lavras (2)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (3)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- CUNY Academic Works (1)
- Deakin Research Online - Australia (29)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (2)
- Digital Commons at Florida International University (8)
- Digital Peer Publishing (5)
- DigitalCommons@The Texas Medical Center (5)
- DigitalCommons@University of Nebraska - Lincoln (1)
- DRUM (Digital Repository at the University of Maryland) (3)
- Duke University (4)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (1)
- Helda - Digital Repository of University of Helsinki (3)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (2)
- Indian Institute of Science - Bangalore - Índia (38)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico de Leiria (1)
- Instituto Politécnico do Porto, Portugal (16)
- Instituto Superior de Psicologia Aplicada - Lisboa (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Martin Luther Universitat Halle Wittenberg, Germany (1)
- Massachusetts Institute of Technology (7)
- National Center for Biotechnology Information - NCBI (3)
- Nottingham eTheses (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (24)
- Queensland University of Technology - ePrints Archive (356)
- RepoCLACAI - Consorcio Latinoamericano Contra el Aborto Inseguro (1)
- Repositório Aberto da Universidade Aberta de Portugal (2)
- Repositório Científico da Universidade de Évora - Portugal (19)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (6)
- Repositorio de la Universidad de Cuenca (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (6)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (48)
- Research Open Access Repository of the University of East London. (2)
- 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)
- SAPIENTIA - Universidade do Algarve - Portugal (5)
- Scielo Uruguai (1)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (1)
- Universidad de Alicante (6)
- Universidad Politécnica de Madrid (42)
- Universidade Complutense de Madrid (3)
- Universidade de Lisboa - Repositório Aberto (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (5)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (7)
- Université de Lausanne, Switzerland (1)
- Université de Montréal (2)
- Université de Montréal, Canada (7)
- University of Michigan (1)
- University of Queensland eSpace - Australia (8)
- University of Southampton, United Kingdom (1)
- University of Washington (2)
- WestminsterResearch - UK (1)
- Worcester Research and Publications - Worcester Research and Publications - UK (3)
Resumo:
This paper compares two linear programming (LP) models for shift scheduling in services where homogeneously-skilled employees are available at limited times. Although both models are based on set covering approaches, one explicitly matches employees to shifts, while the other imposes this matching implicitly. Each model is used in three forms—one with complete, another with very limited meal break placement flexibility, and a third without meal breaks—to provide initial schedules to a completion/improvement heuristic. The term completion/improvement heuristic is used to describe a construction/ improvement heuristic operating on a starting schedule. On 80 test problems varying widely in scheduling flexibility, employee staffing requirements, and employee availability characteristics, all six LP-based procedures generated lower cost schedules than a comparison from-scratch construction/improvement heuristic. This heuristic, which perpetually maintains an explicit matching of employees to shifts, consists of three phases which add, drop, and modify shifts. In terms of schedule cost, schedule generation time, and model size, the procedures based on the implicit model performed better, as a group, than those based on the explicit model. The LP model with complete break placement flexibility and implicitly matching employees to shifts generated schedules costing 6.7% less than those developed by the from-scratch heuristic.