1 resultado para Needs model
em Massachusetts Institute of Technology
Filtro por publicador
- Repository Napier (3)
- ABACUS. Repositorio de Producción Científica - Universidad Europea (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (1)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (18)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (3)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (7)
- Brock University, Canada (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (1)
- Cambridge University Engineering Department Publications Database (4)
- CentAUR: Central Archive University of Reading - UK (16)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (6)
- Cochin University of Science & Technology (CUSAT), India (3)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (4)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (2)
- Digital Commons - Michigan Tech (2)
- Digital Commons at Florida International University (16)
- Digital Peer Publishing (1)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (6)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (2)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Helda - Digital Repository of University of Helsinki (2)
- Indian Institute of Science - Bangalore - Índia (8)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (1)
- Nottingham eTheses (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (3)
- Publishing Network for Geoscientific & Environmental Data (2)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (20)
- Queensland University of Technology - ePrints Archive (688)
- Repositório Científico da Universidade de Évora - Portugal (3)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (2)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (6)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- SAPIENTIA - Universidade do Algarve - Portugal (3)
- Universidad de Alicante (1)
- Universidad Politécnica de Madrid (21)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (3)
- University of Queensland eSpace - Australia (6)
- University of Washington (2)
- WestminsterResearch - UK (1)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
We develop an extension to the tactical planning model (TPM) for a job shop by the third author. The TPM is a discrete-time model in which all transitions occur at the start of each time period. The time period must be defined appropriately in order for the model to be meaningful. Each period must be short enough so that a job is unlikely to travel through more than one station in one period. At the same time, the time period needs to be long enough to justify the assumptions of continuous workflow and Markovian job movements. We build an extension to the TPM that overcomes this restriction of period sizing by permitting production control over shorter time intervals. We achieve this by deriving a continuous-time linear control rule for a single station. We then determine the first two moments of the production level and queue length for the workstation.