GRAPH PROPERTIES OF MINIMIZATION OF OPEN STACKS PROBLEMS AND A NEW INTEGER PROGRAMMING MODEL

Detalhes bibliográficos
Autor(a) principal: Lopes,Isabel Cristina
Data de Publicação: 2015
Outros Autores: Carvalho,J.M. Valério de
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Pesquisa operacional (Online)
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382015000200213
Resumo: The Minimization of Open Stacks Problem (MOSP) is a Pattern Sequencing Problem that often arises in industry. Besides the MOSP, there are also other related Pattern Sequencing Problems of similar relevance. In this paper, we show that each feasible solution to the MOSP results from an ordering of the vertices of a graph that defines the instance to solve, and that the MOSP can be seen as an edge completion problem that renders that graph an interval graph. We review concepts from graph theory, in particular related to interval graphs, comparability graphs and chordal graphs, to provide insight to the structural properties of the admissible solutions of Pattern Sequencing Problems. Then, using Olariu'scharacterization and other structural properties of interval graphs, we derive an integer programming model for the MOSP. Some computational results for the model are presented.
id SOBRAPO-1_7ab7a4080ac85b211a1829a06651f159
oai_identifier_str oai:scielo:S0101-74382015000200213
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling GRAPH PROPERTIES OF MINIMIZATION OF OPEN STACKS PROBLEMS AND A NEW INTEGER PROGRAMMING MODELinteger programminggraph layout problemsMinimization of Open Stacks ProblemThe Minimization of Open Stacks Problem (MOSP) is a Pattern Sequencing Problem that often arises in industry. Besides the MOSP, there are also other related Pattern Sequencing Problems of similar relevance. In this paper, we show that each feasible solution to the MOSP results from an ordering of the vertices of a graph that defines the instance to solve, and that the MOSP can be seen as an edge completion problem that renders that graph an interval graph. We review concepts from graph theory, in particular related to interval graphs, comparability graphs and chordal graphs, to provide insight to the structural properties of the admissible solutions of Pattern Sequencing Problems. Then, using Olariu'scharacterization and other structural properties of interval graphs, we derive an integer programming model for the MOSP. Some computational results for the model are presented.Sociedade Brasileira de Pesquisa Operacional2015-08-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382015000200213Pesquisa Operacional v.35 n.2 2015reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/0101-7438.2015.035.02.0213info:eu-repo/semantics/openAccessLopes,Isabel CristinaCarvalho,J.M. Valério deeng2015-07-27T00:00:00Zoai:scielo:S0101-74382015000200213Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2015-07-27T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv GRAPH PROPERTIES OF MINIMIZATION OF OPEN STACKS PROBLEMS AND A NEW INTEGER PROGRAMMING MODEL
title GRAPH PROPERTIES OF MINIMIZATION OF OPEN STACKS PROBLEMS AND A NEW INTEGER PROGRAMMING MODEL
spellingShingle GRAPH PROPERTIES OF MINIMIZATION OF OPEN STACKS PROBLEMS AND A NEW INTEGER PROGRAMMING MODEL
Lopes,Isabel Cristina
integer programming
graph layout problems
Minimization of Open Stacks Problem
title_short GRAPH PROPERTIES OF MINIMIZATION OF OPEN STACKS PROBLEMS AND A NEW INTEGER PROGRAMMING MODEL
title_full GRAPH PROPERTIES OF MINIMIZATION OF OPEN STACKS PROBLEMS AND A NEW INTEGER PROGRAMMING MODEL
title_fullStr GRAPH PROPERTIES OF MINIMIZATION OF OPEN STACKS PROBLEMS AND A NEW INTEGER PROGRAMMING MODEL
title_full_unstemmed GRAPH PROPERTIES OF MINIMIZATION OF OPEN STACKS PROBLEMS AND A NEW INTEGER PROGRAMMING MODEL
title_sort GRAPH PROPERTIES OF MINIMIZATION OF OPEN STACKS PROBLEMS AND A NEW INTEGER PROGRAMMING MODEL
author Lopes,Isabel Cristina
author_facet Lopes,Isabel Cristina
Carvalho,J.M. Valério de
author_role author
author2 Carvalho,J.M. Valério de
author2_role author
dc.contributor.author.fl_str_mv Lopes,Isabel Cristina
Carvalho,J.M. Valério de
dc.subject.por.fl_str_mv integer programming
graph layout problems
Minimization of Open Stacks Problem
topic integer programming
graph layout problems
Minimization of Open Stacks Problem
description The Minimization of Open Stacks Problem (MOSP) is a Pattern Sequencing Problem that often arises in industry. Besides the MOSP, there are also other related Pattern Sequencing Problems of similar relevance. In this paper, we show that each feasible solution to the MOSP results from an ordering of the vertices of a graph that defines the instance to solve, and that the MOSP can be seen as an edge completion problem that renders that graph an interval graph. We review concepts from graph theory, in particular related to interval graphs, comparability graphs and chordal graphs, to provide insight to the structural properties of the admissible solutions of Pattern Sequencing Problems. Then, using Olariu'scharacterization and other structural properties of interval graphs, we derive an integer programming model for the MOSP. Some computational results for the model are presented.
publishDate 2015
dc.date.none.fl_str_mv 2015-08-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382015000200213
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382015000200213
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/0101-7438.2015.035.02.0213
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
dc.source.none.fl_str_mv Pesquisa Operacional v.35 n.2 2015
reponame:Pesquisa operacional (Online)
instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
instname_str Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron_str SOBRAPO
institution SOBRAPO
reponame_str Pesquisa operacional (Online)
collection Pesquisa operacional (Online)
repository.name.fl_str_mv Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
repository.mail.fl_str_mv ||sobrapo@sobrapo.org.br
_version_ 1750318017794801664

Registros relacionados