Optimal priority ordering in optimal PHP production of multiple part-types on a failure-prone machine with quadratic buffer costs

Shu and Perkins deals with the problem of minimising the expected sum of quadratic buffer cost when a single, failure-prone machine produces multiple part-types. They restrict the set of control policies to the class of prioritised hedging point (PHP) policies and determine simple, analytical expres...

ver descrição completa

Detalhes bibliográficos
Autores: Corominas Subias, Albert|||0000-0002-4795-7761, Griñó Cubero, Robert|||0000-0001-6045-4600, Pastor Moreno, Rafael|||0000-0002-6188-4458
Formato: informe técnico
Fecha de publicación:2004
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/425
Acesso em linha:https://hdl.handle.net/2117/425
Access Level:acceso abierto
Palavra-chave:Production control
Prioritised hedging point control
Scheduling policies
Manufacturing systems
Control de la producció
Control de la producción
Sistemes de fabricació
Sistemas de fabricación
Polítiques de planificació
Políticas de planificación
PHP policies
Producció -- Control -- Informes tècnics
Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d’operacions::Control estadístic de processos
Descrição
Resumo:Shu and Perkins deals with the problem of minimising the expected sum of quadratic buffer cost when a single, failure-prone machine produces multiple part-types. They restrict the set of control policies to the class of prioritised hedging point (PHP) policies and determine simple, analytical expressions for the optimal hedging points, provided that the priority ordering of the part-types is given. This paper addresses the determination of the optimal priority ordering for PHP policies, and reports the results of a computational experiment. The conclusions are that instances of up to approximately twenty-five part-types can be solved to optimality in short computing times, that it is worthwhile to use dominance relations and that the influence of the values of some parameters is insignificant