Publicação
Pattern sequencing models in cutting stock problems
| Resumo: | In this thesis, we address an optimization problem that appears in cutting stock operations research called the minimization of the maximum number of open stacks (MOSP) and we put forward a new integer programming formulation for the MOSP. By associating the duration of each stack with an interval of time, it is possible to use the rich theory that exists in interval graphs in order to create a model based on the completion of a graph with edges. The structure of this type of graphs admits a linear ordering of the vertices that de nes an ordering of the stacks, and consequently decides a sequence for the cutting patterns. The polytope de ned by this formulation is full-dimensional and the main inequalities in the model are proved to be facets. Additional inequalities are derived based on the properties of chordal graphs and comparability graphs. The maximum number of open stacks is related with the chromatic number of the solution graph; thus the formulation is strengthened by adding the representatives formulation for the vertex coloring problem. The model is applied to the minimization of open stacks, and also to the minimum interval graph completion problem and other pattern sequencing problems such as the minimization of the order spread (MORP) and the minimization of the number of tool switches (MTSP). Computational tests of the model are presented. |
|---|---|
| Autores principais: | Lopes, Isabel da Silva |
| Assunto: | Cutting stock Pattern sequencing Minimization of open stacks Interval graphs Linear ordering Minimum interval graph completion Corte de stock Sequenciação de padrões Minimização Grafo de intervalos Ordenação linear Completamento mínimo |
| Ano: | 2011 |
| País: | Portugal |
| Tipo de documento: | tese de doutoramento |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| _version_ | 1866877060935319552 |
|---|---|
| author | Lopes, Isabel da Silva |
| author_facet | Lopes, Isabel da Silva |
| author_role | author |
| contributor_name_str_mv | Carvalho, J. M. Valério de Universidade do Minho |
| country_str | PT |
| creators_json_txt | [{\"Person.name\":\"Lopes, Isabel da Silva\"}] |
| datacite.contributors.contributor.contributorName.fl_str_mv | Carvalho, J. M. Valério de Universidade do Minho |
| datacite.creators.creator.creatorName.fl_str_mv | Lopes, Isabel da Silva |
| datacite.date.Accepted.fl_str_mv | 2011-04-26T00:00:00Z |
| datacite.date.available.fl_str_mv | 2011-06-02T16:04:07Z |
| datacite.date.embargoed.fl_str_mv | 2011-06-02T16:04:07Z |
| datacite.rights.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| datacite.subjects.subject.fl_str_mv | Cutting stock Pattern sequencing Minimization of open stacks Interval graphs Linear ordering Minimum interval graph completion Corte de stock Sequenciação de padrões Minimização Grafo de intervalos Ordenação linear Completamento mínimo |
| datacite.titles.title.fl_str_mv | Pattern sequencing models in cutting stock problems Modelos para sequenciação de padrões em problemas de corte de stock |
| dc.contributor.none.fl_str_mv | Carvalho, J. M. Valério de Universidade do Minho |
| dc.creator.none.fl_str_mv | Lopes, Isabel da Silva |
| dc.date.Accepted.fl_str_mv | 2011-04-26T00:00:00Z |
| dc.date.available.fl_str_mv | 2011-06-02T16:04:07Z |
| dc.date.embargoed.fl_str_mv | 2011-06-02T16:04:07Z |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://hdl.handle.net/1822/12502 |
| dc.language.none.fl_str_mv | eng |
| dc.rights.none.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| dc.subject.none.fl_str_mv | Cutting stock Pattern sequencing Minimization of open stacks Interval graphs Linear ordering Minimum interval graph completion Corte de stock Sequenciação de padrões Minimização Grafo de intervalos Ordenação linear Completamento mínimo |
| dc.title.fl_str_mv | Pattern sequencing models in cutting stock problems Modelos para sequenciação de padrões em problemas de corte de stock |
| dc.type.none.fl_str_mv | http://purl.org/coar/resource_type/c_db06 |
| description | In this thesis, we address an optimization problem that appears in cutting stock operations research called the minimization of the maximum number of open stacks (MOSP) and we put forward a new integer programming formulation for the MOSP. By associating the duration of each stack with an interval of time, it is possible to use the rich theory that exists in interval graphs in order to create a model based on the completion of a graph with edges. The structure of this type of graphs admits a linear ordering of the vertices that de nes an ordering of the stacks, and consequently decides a sequence for the cutting patterns. The polytope de ned by this formulation is full-dimensional and the main inequalities in the model are proved to be facets. Additional inequalities are derived based on the properties of chordal graphs and comparability graphs. The maximum number of open stacks is related with the chromatic number of the solution graph; thus the formulation is strengthened by adding the representatives formulation for the vertex coloring problem. The model is applied to the minimization of open stacks, and also to the minimum interval graph completion problem and other pattern sequencing problems such as the minimization of the order spread (MORP) and the minimization of the number of tool switches (MTSP). Computational tests of the model are presented. |
| dirty | 0 |
| eu_rights_str_mv | openAccess |
| format | doctoralThesis |
| fulltext.url.fl_str_mv | https://prod-dspace.uminho.pt/bitstreams/514de5ee-875b-49e8-8e27-13d0a5c6b847/download |
| id | rum_97ab7ee64dc5dd2dbbd7f849bb1107ee |
| identifier.url.fl_str_mv | https://hdl.handle.net/1822/12502 |
| instacron_str | repositorium |
| institution | Universidade do Minho |
| instname_str | Universidade do Minho |
| language | eng |
| network_acronym_str | rum |
| network_name_str | RepositóriUM - Universidade do Minho |
| oai_identifier_str | oai:repositorium.uminho.pt:1822/12502 |
| organization_str_mv | urn:organizationAcronym:repositorium |
| person_str_mv | Lopes, Isabel da Silva |
| publishDate | 2011 |
| reponame_str | RepositóriUM - Universidade do Minho |
| repository_id_str | urn:repositoryAcronym:rum |
| service_str_mv | urn:repositoryAcronym:rum |
| spelling | engporIn this thesis, we address an optimization problem that appears in cutting stock operations research called the minimization of the maximum number of open stacks (MOSP) and we put forward a new integer programming formulation for the MOSP. By associating the duration of each stack with an interval of time, it is possible to use the rich theory that exists in interval graphs in order to create a model based on the completion of a graph with edges. The structure of this type of graphs admits a linear ordering of the vertices that de nes an ordering of the stacks, and consequently decides a sequence for the cutting patterns. The polytope de ned by this formulation is full-dimensional and the main inequalities in the model are proved to be facets. Additional inequalities are derived based on the properties of chordal graphs and comparability graphs. The maximum number of open stacks is related with the chromatic number of the solution graph; thus the formulation is strengthened by adding the representatives formulation for the vertex coloring problem. The model is applied to the minimization of open stacks, and also to the minimum interval graph completion problem and other pattern sequencing problems such as the minimization of the order spread (MORP) and the minimization of the number of tool switches (MTSP). Computational tests of the model are presented.application/pdfporPattern sequencing models in cutting stock problemsAlternativeTitleModelos para sequenciação de padrões em problemas de corte de stockLopes, Isabel da SilvaCarvalho, J. M. Valério deHostingInstitutionOrganizationalUniversidade do Minhoe-mailmailto:repositorium@usdb.uminho.ptrepositorium@usdb.uminho.pt2011-06-02T16:04:07Z2011-04-262011-02-032011-04-26T00:00:00ZHandlehttps://hdl.handle.net/1822/12502http://purl.org/coar/access_right/c_abf2open accessCutting stockPattern sequencingMinimization of open stacksInterval graphsLinear orderingMinimum interval graph completionCorte de stockSequenciação de padrõesMinimizaçãoGrafo de intervalosOrdenação linearCompletamento mínimo1736945 bytesliteraturehttp://purl.org/coar/resource_type/c_db06doctoral thesishttp://purl.org/coar/access_right/c_abf2application/pdffulltexthttps://prod-dspace.uminho.pt/bitstreams/514de5ee-875b-49e8-8e27-13d0a5c6b847/download |
| spellingShingle | Pattern sequencing models in cutting stock problems Lopes, Isabel da Silva Cutting stock Pattern sequencing Minimization of open stacks Interval graphs Linear ordering Minimum interval graph completion Corte de stock Sequenciação de padrões Minimização Grafo de intervalos Ordenação linear Completamento mínimo |
| status | SINGLETON |
| subject.fl_str_mv | Cutting stock Pattern sequencing Minimization of open stacks Interval graphs Linear ordering Minimum interval graph completion Corte de stock Sequenciação de padrões Minimização Grafo de intervalos Ordenação linear Completamento mínimo |
| title | Pattern sequencing models in cutting stock problems |
| title_full | Pattern sequencing models in cutting stock problems |
| title_fullStr | Pattern sequencing models in cutting stock problems |
| title_full_unstemmed | Pattern sequencing models in cutting stock problems |
| title_short | Pattern sequencing models in cutting stock problems |
| title_sort | Pattern sequencing models in cutting stock problems |
| topic | Cutting stock Pattern sequencing Minimization of open stacks Interval graphs Linear ordering Minimum interval graph completion Corte de stock Sequenciação de padrões Minimização Grafo de intervalos Ordenação linear Completamento mínimo |
| topic_facet | Cutting stock Pattern sequencing Minimization of open stacks Interval graphs Linear ordering Minimum interval graph completion Corte de stock Sequenciação de padrões Minimização Grafo de intervalos Ordenação linear Completamento mínimo |
| url | https://hdl.handle.net/1822/12502 |
| visible | 1 |