1 resultado para Executive orders
em Greenwich Academic Literature Archive - UK
Filtro por publicador
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (1)
- Academic Research Repository at Institute of Developing Economies (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Applied Math and Science Education Repository - Washington - USA (1)
- Aquatic Commons (5)
- Archive of European Integration (52)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (2)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- Biodiversity Heritage Library, United States (5)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (89)
- Boston University Digital Common (1)
- Brock University, Canada (26)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Cambridge University Engineering Department Publications Database (11)
- CentAUR: Central Archive University of Reading - UK (39)
- Center for Jewish History Digital Collections (5)
- Central European University - Research Support Scheme (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (1)
- Cochin University of Science & Technology (CUSAT), India (4)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (92)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- CUNY Academic Works (86)
- Dalarna University College Electronic Archive (3)
- Deakin Research Online - Australia (55)
- Digital Commons - Montana Tech (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (2)
- DigitalCommons@The Texas Medical Center (5)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (1)
- Greenwich Academic Literature Archive - UK (1)
- Harvard University (8)
- Helda - Digital Repository of University of Helsinki (5)
- Indian Institute of Science - Bangalore - Índia (4)
- Instituto Politécnico do Porto, Portugal (2)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Ministerio de Cultura, Spain (4)
- National Center for Biotechnology Information - NCBI (4)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- Publishing Network for Geoscientific & Environmental Data (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (62)
- Queensland University of Technology - ePrints Archive (61)
- Repositório digital da Fundação Getúlio Vargas - FGV (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (11)
- School of Medicine, Washington University, United States (7)
- South Carolina State Documents Depository (39)
- Universidad Autónoma de Nuevo León, Mexico (1)
- Universidad del Rosario, Colombia (10)
- Universidad Politécnica de Madrid (2)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Pará (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (2)
- University of Connecticut - USA (3)
- University of Michigan (246)
- WestminsterResearch - UK (5)
Resumo:
The paper deals with the determination of an optimal schedule for the so-called mixed shop problem when the makespan has to be minimized. In such a problem, some jobs have fixed machine orders (as in the job-shop), while the operations of the other jobs may be processed in arbitrary order (as in the open-shop). We prove binary NP-hardness of the preemptive problem with three machines and three jobs (two jobs have fixed machine orders and one may have an arbitrary machine order). We answer all other remaining open questions on the complexity status of mixed-shop problems with the makespan criterion by presenting different polynomial and pseudopolynomial algorithms.