Aplicação de modelos de redes de filas abertas no projeto e planejamento de sistemas discretos de manufatura.

Detalhes bibliográficos
Autor(a) principal: Silva, Claudio Rogerio Negri da
Data de Publicação: 2005
Tipo de documento: Tese
Idioma: por
Título da fonte: Repositório Institucional da UFSCAR
Texto Completo: https://repositorio.ufscar.br/handle/ufscar/3465
Resumo: The management of manufacturing systems have become more complex, once that new products are arising, product demands are uncertain, life cycles get shorter, and a wide variety of products compete for common resources. This thesis deals with the design and planning of discrete manufacturing systems, based on open queueing network models to support the decision making of capacity allocation. As manufacturing systems may be represented by generalized queueing networks, and there are no exact solution methods, here is employed the decomposition approximate method to evaluate the performance of systems under different configurations. It is shown in the thesis how these approximations are suitable and effective to estimate the work-in-process (WIP) and the production leadtime of an actual metallurgical industry queueing network. It is also shown that discrete capacity allocation models, based on the approximations, are effective to evaluate and optimize the performance of the case study under different configurations. Trade-off curves between capacity investment and WIP are generated and are useful not only to support a manager to estimate how much capacity he/she should allocate, but also to decide where it should be allocated in the queueing network. These curves also support the decision making in terms of capacity, if the variability of the external arrivals, the product mix and/or the throughput for the network change. Besides adding capacity, partitioning the facility is another alternative to reduce the system complexity. This thesis also approaches the focused factory design problem, involving the partition of the facility into smaller shops and the capacity allocation in each shop. Again, the decomposition approximations were employed to evaluate the system performance. Despite its importance, this problem has rarely been reported in the literature. In this thesis, the goal is to reduce the system complexity either from the product management point of view or from the workstation management point of view. From the product management point of view, a model whose complexity constraint is na upper limit on the production leadtime variance of the products passing through the network was studied. From the workstation management point of view, the complexity constraint of the model keeps constant the expected waiting time of a product at a workstation, once it waits for being served. It is shown through these models for some instances that the partition of the facility into smaller shops decreases the complexity system without necessary capacity additional investments. Futhermore, sometimes it is possible to keep the network performance (or even to improve it), partitioning the network into smaller shops which need less capacity than the original configuration with a single shop.
id SCAR_7f2f9bf5fba9623343494228eb4ce391
oai_identifier_str oai:repositorio.ufscar.br:ufscar/3465
network_acronym_str SCAR
network_name_str Repositório Institucional da UFSCAR
repository_id_str 4322
spelling Silva, Claudio Rogerio Negri daMorabito Neto, Reinaldohttp://genos.cnpq.br:12010/dwlattes/owa/prc_imp_cv_int?f_cod=K4723157U6163406b5-cec7-418c-8a37-ba3e416357442016-06-02T19:50:27Z2005-07-072016-06-02T19:50:27Z2005-04-29SILVA, Claudio Rogerio Negri da. Application of open queueing network models for the design and planning of discrete manufacturing systems.. 2005. 274 f. Tese (Doutorado em Ciências Exatas e da Terra) - Universidade Federal de São Carlos, São Carlos, 2005.https://repositorio.ufscar.br/handle/ufscar/3465The management of manufacturing systems have become more complex, once that new products are arising, product demands are uncertain, life cycles get shorter, and a wide variety of products compete for common resources. This thesis deals with the design and planning of discrete manufacturing systems, based on open queueing network models to support the decision making of capacity allocation. As manufacturing systems may be represented by generalized queueing networks, and there are no exact solution methods, here is employed the decomposition approximate method to evaluate the performance of systems under different configurations. It is shown in the thesis how these approximations are suitable and effective to estimate the work-in-process (WIP) and the production leadtime of an actual metallurgical industry queueing network. It is also shown that discrete capacity allocation models, based on the approximations, are effective to evaluate and optimize the performance of the case study under different configurations. Trade-off curves between capacity investment and WIP are generated and are useful not only to support a manager to estimate how much capacity he/she should allocate, but also to decide where it should be allocated in the queueing network. These curves also support the decision making in terms of capacity, if the variability of the external arrivals, the product mix and/or the throughput for the network change. Besides adding capacity, partitioning the facility is another alternative to reduce the system complexity. This thesis also approaches the focused factory design problem, involving the partition of the facility into smaller shops and the capacity allocation in each shop. Again, the decomposition approximations were employed to evaluate the system performance. Despite its importance, this problem has rarely been reported in the literature. In this thesis, the goal is to reduce the system complexity either from the product management point of view or from the workstation management point of view. From the product management point of view, a model whose complexity constraint is na upper limit on the production leadtime variance of the products passing through the network was studied. From the workstation management point of view, the complexity constraint of the model keeps constant the expected waiting time of a product at a workstation, once it waits for being served. It is shown through these models for some instances that the partition of the facility into smaller shops decreases the complexity system without necessary capacity additional investments. Futhermore, sometimes it is possible to keep the network performance (or even to improve it), partitioning the network into smaller shops which need less capacity than the original configuration with a single shop.A gestão de sistemas de manufatura tem se tornado mais complexa na medida em que novos produtos estão surgindo, a demanda de produtos é incerta, os ciclos de vida são mais curtos e uma grande variedade de produtos competem pelos mesmos recursos. Esta tese trata o projeto e planejamento de sistemas discretos de manufatura, baseados em modelos de redes de filas abertas, para auxiliar no processo de tomada de decisões. Porque sistemas de manufatura podem ser representados por redes de filas genéricas, e não existem métodos exatos de solução, aqui é empregado o método aproximado de decomposição para avaliar o desempenho dos sistemas em diferentes configurações. Mostra-se nesta tese que estas aproximações são adequadas e efetivas para estimar os estoques em processo (WIP) e o leadtime de produção de uma rede de manufatura real de uma indústria metal-mecânica. Mostra-se ainda que os modelos de alocação de capacidade discreta, baseados nestas aproximações, também são efetivos para avaliar e otimizar o desempenho da rede do estudo de caso em diferentes configurações. Curvas de trade-off entre investimento em capacidade e WIP são geradas e são úteis não somente para auxiliar um gerente a estimar quanto alocar de capacidade, mas também para decidir onde alocá-la na rede de filas. As curvas também auxiliam a tomada de decisões em termos de capacidade, se a variabilidade das chegadas externas, o mix de produtos e/ou a taxa de produção da rede mudam. Além de adicionar capacidade, a partição da instalação é outra alternativa para reduzir a complexidade do sistema. Esta tese também aborda o problema de projeto de fábrica focalizada, envolvendo a partição da instalação em subplantas e a alocação de capacidade em cada estação das subplantas. Novamente, as aproximações por decomposição foram utilizadas para avaliar e otimizar o desempenho do sistema. Apesar de sua importância, este problema tem sido muito pouco reportado em literatura. Nesta tese, o objetivo é reduzir a complexidade do sistema do ponto de vista da gestão do produto, ou do ponto de vista da gestão da estação. Do ponto de vista da gestão do produto, é apresentado um modelo cuja restrição de complexidade é um limitante superior para a variância do leadtime dos produtos na rede. Do ponto de vista da gestão da estação, a restrição de complexidade do modelo fixa o tempo médio de espera de um produto na estação, quando há espera. Mostra-se, por meio destes modelos para alguns casos que, a partição da instalação em subplantas reduz a complexidade do sistema, sem necessidade de investimentos adicionais em capacidade. Além disso, algumas vezes, é possível manter (ou até melhorar) o desempenho da rede, particionando-a em subplantas que necessitam de menos capacidade do que a configuração original com uma planta única.Universidade Federal de Minas Geraisapplication/pdfporUniversidade Federal de São CarlosPrograma de Pós-Graduação em Engenharia de Produção - PPGEPUFSCarBRPesquisa operacionalFábrica focalizadaRede de filas abertaModelos de otimizaçãoProjeto de sistema de manufaturaFocused FactoryManufacturing System DesignPerformance Evaluation ModelsOpen Queueing NetworkOptimization ModelsTrade-off CurvesENGENHARIAS::ENGENHARIA DE PRODUCAOAplicação de modelos de redes de filas abertas no projeto e planejamento de sistemas discretos de manufatura.Application of open queueing network models for the design and planning of discrete manufacturing systems.info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesis-1-1ab73fe2d-ae49-4b7d-915b-b256b3c2d946info:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFSCARinstname:Universidade Federal de São Carlos (UFSCAR)instacron:UFSCARORIGINALTeseCRNS.pdfapplication/pdf1772351https://repositorio.ufscar.br/bitstream/ufscar/3465/1/TeseCRNS.pdf17b2dc82dae0e985204bfa2fd68f873bMD51THUMBNAILTeseCRNS.pdf.jpgTeseCRNS.pdf.jpgIM Thumbnailimage/jpeg6258https://repositorio.ufscar.br/bitstream/ufscar/3465/2/TeseCRNS.pdf.jpg0e620b5d0bc0026681166b2d52058e57MD52ufscar/34652023-09-18 18:30:55.272oai:repositorio.ufscar.br:ufscar/3465Repositório InstitucionalPUBhttps://repositorio.ufscar.br/oai/requestopendoar:43222023-09-18T18:30:55Repositório Institucional da UFSCAR - Universidade Federal de São Carlos (UFSCAR)false
dc.title.por.fl_str_mv Aplicação de modelos de redes de filas abertas no projeto e planejamento de sistemas discretos de manufatura.
dc.title.alternative.eng.fl_str_mv Application of open queueing network models for the design and planning of discrete manufacturing systems.
title Aplicação de modelos de redes de filas abertas no projeto e planejamento de sistemas discretos de manufatura.
spellingShingle Aplicação de modelos de redes de filas abertas no projeto e planejamento de sistemas discretos de manufatura.
Silva, Claudio Rogerio Negri da
Pesquisa operacional
Fábrica focalizada
Rede de filas aberta
Modelos de otimização
Projeto de sistema de manufatura
Focused Factory
Manufacturing System Design
Performance Evaluation Models
Open Queueing Network
Optimization Models
Trade-off Curves
ENGENHARIAS::ENGENHARIA DE PRODUCAO
title_short Aplicação de modelos de redes de filas abertas no projeto e planejamento de sistemas discretos de manufatura.
title_full Aplicação de modelos de redes de filas abertas no projeto e planejamento de sistemas discretos de manufatura.
title_fullStr Aplicação de modelos de redes de filas abertas no projeto e planejamento de sistemas discretos de manufatura.
title_full_unstemmed Aplicação de modelos de redes de filas abertas no projeto e planejamento de sistemas discretos de manufatura.
title_sort Aplicação de modelos de redes de filas abertas no projeto e planejamento de sistemas discretos de manufatura.
author Silva, Claudio Rogerio Negri da
author_facet Silva, Claudio Rogerio Negri da
author_role author
dc.contributor.author.fl_str_mv Silva, Claudio Rogerio Negri da
dc.contributor.advisor1.fl_str_mv Morabito Neto, Reinaldo
dc.contributor.advisor1Lattes.fl_str_mv http://genos.cnpq.br:12010/dwlattes/owa/prc_imp_cv_int?f_cod=K4723157U6
dc.contributor.authorID.fl_str_mv 163406b5-cec7-418c-8a37-ba3e41635744
contributor_str_mv Morabito Neto, Reinaldo
dc.subject.por.fl_str_mv Pesquisa operacional
Fábrica focalizada
Rede de filas aberta
Modelos de otimização
Projeto de sistema de manufatura
topic Pesquisa operacional
Fábrica focalizada
Rede de filas aberta
Modelos de otimização
Projeto de sistema de manufatura
Focused Factory
Manufacturing System Design
Performance Evaluation Models
Open Queueing Network
Optimization Models
Trade-off Curves
ENGENHARIAS::ENGENHARIA DE PRODUCAO
dc.subject.eng.fl_str_mv Focused Factory
Manufacturing System Design
Performance Evaluation Models
Open Queueing Network
Optimization Models
Trade-off Curves
dc.subject.cnpq.fl_str_mv ENGENHARIAS::ENGENHARIA DE PRODUCAO
description The management of manufacturing systems have become more complex, once that new products are arising, product demands are uncertain, life cycles get shorter, and a wide variety of products compete for common resources. This thesis deals with the design and planning of discrete manufacturing systems, based on open queueing network models to support the decision making of capacity allocation. As manufacturing systems may be represented by generalized queueing networks, and there are no exact solution methods, here is employed the decomposition approximate method to evaluate the performance of systems under different configurations. It is shown in the thesis how these approximations are suitable and effective to estimate the work-in-process (WIP) and the production leadtime of an actual metallurgical industry queueing network. It is also shown that discrete capacity allocation models, based on the approximations, are effective to evaluate and optimize the performance of the case study under different configurations. Trade-off curves between capacity investment and WIP are generated and are useful not only to support a manager to estimate how much capacity he/she should allocate, but also to decide where it should be allocated in the queueing network. These curves also support the decision making in terms of capacity, if the variability of the external arrivals, the product mix and/or the throughput for the network change. Besides adding capacity, partitioning the facility is another alternative to reduce the system complexity. This thesis also approaches the focused factory design problem, involving the partition of the facility into smaller shops and the capacity allocation in each shop. Again, the decomposition approximations were employed to evaluate the system performance. Despite its importance, this problem has rarely been reported in the literature. In this thesis, the goal is to reduce the system complexity either from the product management point of view or from the workstation management point of view. From the product management point of view, a model whose complexity constraint is na upper limit on the production leadtime variance of the products passing through the network was studied. From the workstation management point of view, the complexity constraint of the model keeps constant the expected waiting time of a product at a workstation, once it waits for being served. It is shown through these models for some instances that the partition of the facility into smaller shops decreases the complexity system without necessary capacity additional investments. Futhermore, sometimes it is possible to keep the network performance (or even to improve it), partitioning the network into smaller shops which need less capacity than the original configuration with a single shop.
publishDate 2005
dc.date.available.fl_str_mv 2005-07-07
2016-06-02T19:50:27Z
dc.date.issued.fl_str_mv 2005-04-29
dc.date.accessioned.fl_str_mv 2016-06-02T19:50:27Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/doctoralThesis
format doctoralThesis
status_str publishedVersion
dc.identifier.citation.fl_str_mv SILVA, Claudio Rogerio Negri da. Application of open queueing network models for the design and planning of discrete manufacturing systems.. 2005. 274 f. Tese (Doutorado em Ciências Exatas e da Terra) - Universidade Federal de São Carlos, São Carlos, 2005.
dc.identifier.uri.fl_str_mv https://repositorio.ufscar.br/handle/ufscar/3465
identifier_str_mv SILVA, Claudio Rogerio Negri da. Application of open queueing network models for the design and planning of discrete manufacturing systems.. 2005. 274 f. Tese (Doutorado em Ciências Exatas e da Terra) - Universidade Federal de São Carlos, São Carlos, 2005.
url https://repositorio.ufscar.br/handle/ufscar/3465
dc.language.iso.fl_str_mv por
language por
dc.relation.confidence.fl_str_mv -1
-1
dc.relation.authority.fl_str_mv ab73fe2d-ae49-4b7d-915b-b256b3c2d946
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universidade Federal de São Carlos
dc.publisher.program.fl_str_mv Programa de Pós-Graduação em Engenharia de Produção - PPGEP
dc.publisher.initials.fl_str_mv UFSCar
dc.publisher.country.fl_str_mv BR
publisher.none.fl_str_mv Universidade Federal de São Carlos
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFSCAR
instname:Universidade Federal de São Carlos (UFSCAR)
instacron:UFSCAR
instname_str Universidade Federal de São Carlos (UFSCAR)
instacron_str UFSCAR
institution UFSCAR
reponame_str Repositório Institucional da UFSCAR
collection Repositório Institucional da UFSCAR
bitstream.url.fl_str_mv https://repositorio.ufscar.br/bitstream/ufscar/3465/1/TeseCRNS.pdf
https://repositorio.ufscar.br/bitstream/ufscar/3465/2/TeseCRNS.pdf.jpg
bitstream.checksum.fl_str_mv 17b2dc82dae0e985204bfa2fd68f873b
0e620b5d0bc0026681166b2d52058e57
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFSCAR - Universidade Federal de São Carlos (UFSCAR)
repository.mail.fl_str_mv
_version_ 1813715527863894016