Optimal priority ordering in PHP production of multiple part-types in a failure-prone machine

This note deals with the problem of minimising the expected sum of quadratic holding and shortage inventory costs when a single, failure-prone machine produces multiple part-types. Shu and Perkins (2001) introduce the problem and, by restricting the set of control policies to the class of prioritise...

Descripción completa

Detalles Bibliográficos
Autores: Sánchez Granados, Ana María, Corominas Subias, Albert|||0000-0002-4795-7761, Pastor Moreno, Rafael|||0000-0002-6188-4458
Tipo de recurso: artículo
Fecha de publicación:2009
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2099/8483
Acceso en línea:https://hdl.handle.net/2099/8483
Access Level:acceso abierto
Palabra clave:Production control
Scheduling
Cumulative resources
Failure-prone machines
Prioritised hedging point control
Producció -- Control -- Automatització
Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions
id ES_84dffe5eb18ce0bc739852acffd44d67
oai_identifier_str oai:upcommons.upc.edu:2099/8483
network_acronym_str ES
network_name_str España
repository_id_str
spelling Optimal priority ordering in PHP production of multiple part-types in a failure-prone machineSánchez Granados, Ana MaríaCorominas Subias, Albert|||0000-0002-4795-7761Pastor Moreno, Rafael|||0000-0002-6188-4458Production controlSchedulingCumulative resourcesFailure-prone machinesPrioritised hedging point controlProducció -- Control -- AutomatitzacióÀrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacionsThis note deals with the problem of minimising the expected sum of quadratic holding and shortage inventory costs when a single, failure-prone machine produces multiple part-types. Shu and Perkins (2001) introduce the problem and, by restricting the set of control policies to the class of prioritised hedging point (PHP) policies, establish simple, analytical expressions for the optimal hedging points provided that the priority ordering of the part-types is given. However, the determination of an optimal priority ordering is left by the authors as an open question. This leaves an embedded sequencing problem which we focus on in this note. We define a lower bound for the problem, introduce a test bed for future developments, and propose three dynamic programming approaches (with or without the lower bound) for determining the optimal priority orderings for the instances of the test bed. This is an initial step in a research project aimed at solving the optimal priority ordering problem, which will allow evaluating the performance of future heuristic and metaheuristic procedures.Peer ReviewedSchool of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC)20092009-12-0120102010-01-08journal articlehttp://purl.org/coar/resource_type/c_6501NAhttp://purl.org/coar/version/c_be7fb7dd8ff6fe43info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2099/8483reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial 3.0 Spainhttp://creativecommons.org/licenses/by-nc/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2099/84832026-05-27T15:37:01Z
dc.title.none.fl_str_mv Optimal priority ordering in PHP production of multiple part-types in a failure-prone machine
title Optimal priority ordering in PHP production of multiple part-types in a failure-prone machine
spellingShingle Optimal priority ordering in PHP production of multiple part-types in a failure-prone machine
Sánchez Granados, Ana María
Production control
Scheduling
Cumulative resources
Failure-prone machines
Prioritised hedging point control
Producció -- Control -- Automatització
Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions
title_short Optimal priority ordering in PHP production of multiple part-types in a failure-prone machine
title_full Optimal priority ordering in PHP production of multiple part-types in a failure-prone machine
title_fullStr Optimal priority ordering in PHP production of multiple part-types in a failure-prone machine
title_full_unstemmed Optimal priority ordering in PHP production of multiple part-types in a failure-prone machine
title_sort Optimal priority ordering in PHP production of multiple part-types in a failure-prone machine
dc.creator.none.fl_str_mv Sánchez Granados, Ana María
Corominas Subias, Albert|||0000-0002-4795-7761
Pastor Moreno, Rafael|||0000-0002-6188-4458
author Sánchez Granados, Ana María
author_facet Sánchez Granados, Ana María
Corominas Subias, Albert|||0000-0002-4795-7761
Pastor Moreno, Rafael|||0000-0002-6188-4458
author_role author
author2 Corominas Subias, Albert|||0000-0002-4795-7761
Pastor Moreno, Rafael|||0000-0002-6188-4458
author2_role author
author
dc.subject.none.fl_str_mv Production control
Scheduling
Cumulative resources
Failure-prone machines
Prioritised hedging point control
Producció -- Control -- Automatització
Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions
topic Production control
Scheduling
Cumulative resources
Failure-prone machines
Prioritised hedging point control
Producció -- Control -- Automatització
Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions
description This note deals with the problem of minimising the expected sum of quadratic holding and shortage inventory costs when a single, failure-prone machine produces multiple part-types. Shu and Perkins (2001) introduce the problem and, by restricting the set of control policies to the class of prioritised hedging point (PHP) policies, establish simple, analytical expressions for the optimal hedging points provided that the priority ordering of the part-types is given. However, the determination of an optimal priority ordering is left by the authors as an open question. This leaves an embedded sequencing problem which we focus on in this note. We define a lower bound for the problem, introduce a test bed for future developments, and propose three dynamic programming approaches (with or without the lower bound) for determining the optimal priority orderings for the instances of the test bed. This is an initial step in a research project aimed at solving the optimal priority ordering problem, which will allow evaluating the performance of future heuristic and metaheuristic procedures.
publishDate 2009
dc.date.none.fl_str_mv 2009
2009-12-01
2010
2010-01-08
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
NA
http://purl.org/coar/version/c_be7fb7dd8ff6fe43
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2099/8483
url https://hdl.handle.net/2099/8483
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial 3.0 Spain
http://creativecommons.org/licenses/by-nc/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial 3.0 Spain
http://creativecommons.org/licenses/by-nc/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv School of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC)
publisher.none.fl_str_mv School of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC)
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869412257004257280
score 15,300719

Similares en LA Referencia