1 resultado para Closure flexibility
em Greenwich Academic Literature Archive - UK
Filtro por publicador
- Aberdeen University (6)
- Academic Archive On-line (Stockholm University; Sweden) (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (3)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (7)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (1)
- Archive of European Integration (18)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (5)
- Aston University Research Archive (28)
- 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 (6)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (2)
- Bioline International (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (135)
- Brock University, Canada (4)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- Cambridge University Engineering Department Publications Database (73)
- CentAUR: Central Archive University of Reading - UK (33)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (19)
- Cochin University of Science & Technology (CUSAT), India (3)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (6)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Deakin Research Online - Australia (44)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Archives@Colby (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (3)
- DigitalCommons@The Texas Medical Center (2)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- Duke University (2)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (1)
- Helda - Digital Repository of University of Helsinki (3)
- Hospitais da Universidade de Coimbra (1)
- Indian Institute of Science - Bangalore - Índia (56)
- Instituto Politécnico do Porto, Portugal (2)
- Massachusetts Institute of Technology (2)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (15)
- Nottingham eTheses (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (3)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (49)
- Queensland University of Technology - ePrints Archive (279)
- 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 (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (29)
- Research Open Access Repository of the University of East London. (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)
- Scientific Open-access Literature Archive and Repository (2)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (1)
- Universidad de Alicante (1)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (6)
- Universitat de Girona, Spain (2)
- Université de Lausanne, Switzerland (4)
- Université de Montréal, Canada (2)
- University of Connecticut - USA (1)
- University of Michigan (25)
- University of Queensland eSpace - Australia (28)
Resumo:
In this paper, we consider the problem of providing flexibility to solutions of two-machine shop scheduling problems. We use the concept of group-scheduling to characterize a whole set of schedules so as to provide more choice to the decision-maker at any decision point. A group-schedule is a sequence of groups of permutable operations defined on each machine where each group is such that any permutation of the operations inside the group leads to a feasible schedule. Flexibility of a solution and its makespan are often conflicting, thus we search for a compromise between a low number of groups and a small value of makespan. We resolve the complexity status of the relevant problems for the two-machine flow shop, job shop and open shop. A number of approximation algorithms are developed and their worst-case performance is analyzed. For the flow shop, an effective heuristic algorithm is proposed and the results of computational experiments are reported.