Publicação
A scheduling model for a knitting planning problem
| Resumo: | In this paper we present two planning and scheduling models for a real problem of a textile industry that produces fine knitted goods. In both of them we develop plans to assist the knitting planning of one of three knitting subsections. In this problem we intend to assign and sequence, within a set of available and identical parallel machines, the demand associated with each component or garment part. This demand can be split in lots of smaller quantities and these lots can be independently produced at any time in one or more of the available machines. In the first model we develop a mixed integer programming (MIP) formulation and in the second one we develop network flow based models and a scheduling heuristic. The main advantage of the second model, in opposition to the first one, is the small computational resources needed to solve this huge and complex problem. We solve an instance generated in accordance with the characteristics of the real problem by the second model and present some performance measures. |
|---|---|
| Autores principais: | Pimentel, Carina |
| Outros Autores: | Alvelos, Filipe; Duarte, António; Carvalho, J.M. Valério de |
| Assunto: | Planning and scheduling Mixed integer programming Network flows |
| Ano: | 2008 |
| País: | Portugal |
| Tipo de documento: | comunicação em conferência |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Instituto Politécnico de Bragança |
| Idioma: | inglês |
| Origem: | Biblioteca Digital do IPB |
| _version_ | 1867173001068281856 |
|---|---|
| author | Pimentel, Carina |
| author2 | Alvelos, Filipe Duarte, António Carvalho, J.M. Valério de |
| author2_role | author author author |
| author_facet | Pimentel, Carina Alvelos, Filipe Duarte, António Carvalho, J.M. Valério de |
| author_role | author |
| contributor_name_str_mv | Biblioteca Digital do IPB |
| country_str | PT |
| creators_json_txt | [{\"Person.name\":\"Pimentel, Carina\"},{\"Person.name\":\"Alvelos, Filipe\"},{\"Person.name\":\"Duarte, António\",\"Person.identifier.orcid\":\"0000-0003-3759-3850\"},{\"Person.name\":\"Carvalho, J.M. Valério de\"}] |
| datacite.contributors.contributor.contributorName.fl_str_mv | Biblioteca Digital do IPB |
| datacite.creators.creator.creatorName.fl_str_mv | Pimentel, Carina Alvelos, Filipe Duarte, António Carvalho, J.M. Valério de |
| datacite.date.Accepted.fl_str_mv | 2008-01-01T00:00:00Z |
| datacite.date.available.fl_str_mv | 2012-07-26T09:53:42Z |
| datacite.date.embargoed.fl_str_mv | 2012-07-26T09:53:42Z |
| datacite.rights.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| datacite.subjects.subject.fl_str_mv | Planning and scheduling Mixed integer programming Network flows |
| datacite.titles.title.fl_str_mv | A scheduling model for a knitting planning problem |
| dc.contributor.none.fl_str_mv | Biblioteca Digital do IPB |
| dc.creator.none.fl_str_mv | Pimentel, Carina Alvelos, Filipe Duarte, António Carvalho, J.M. Valério de |
| dc.date.Accepted.fl_str_mv | 2008-01-01T00:00:00Z |
| dc.date.available.fl_str_mv | 2012-07-26T09:53:42Z |
| dc.date.embargoed.fl_str_mv | 2012-07-26T09:53:42Z |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10198/7322 |
| 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 | Planning and scheduling Mixed integer programming Network flows |
| dc.title.fl_str_mv | A scheduling model for a knitting planning problem |
| dc.type.none.fl_str_mv | http://purl.org/coar/resource_type/c_5794 |
| description | In this paper we present two planning and scheduling models for a real problem of a textile industry that produces fine knitted goods. In both of them we develop plans to assist the knitting planning of one of three knitting subsections. In this problem we intend to assign and sequence, within a set of available and identical parallel machines, the demand associated with each component or garment part. This demand can be split in lots of smaller quantities and these lots can be independently produced at any time in one or more of the available machines. In the first model we develop a mixed integer programming (MIP) formulation and in the second one we develop network flow based models and a scheduling heuristic. The main advantage of the second model, in opposition to the first one, is the small computational resources needed to solve this huge and complex problem. We solve an instance generated in accordance with the characteristics of the real problem by the second model and present some performance measures. |
| dirty | 0 |
| eu_rights_str_mv | openAccess |
| format | conferencePaper |
| fulltext.url.fl_str_mv | https://bibliotecadigital.ipb.pt/bitstreams/bc5d9255-0449-4615-b798-c98a6b613cf2/download |
| id | ipb_8d2ecf0ad6ba0bf3f7e1f358cfe7e9b2 |
| identifier.url.fl_str_mv | http://hdl.handle.net/10198/7322 |
| instacron_str | ipb |
| institution | Instituto Politécnico de Bragança |
| instname_str | Instituto Politécnico de Bragança |
| language | eng |
| network_acronym_str | ipb |
| network_name_str | Biblioteca Digital do IPB |
| oai_identifier_str | oai:bibliotecadigital.ipb.pt:10198/7322 |
| organization_str_mv | urn:organizationAcronym:ipb |
| person_str_mv | Pimentel, Carina Alvelos, Filipe Duarte, António Duarte, António https://www.ciencia-id.pt/9C13-787B-295F 9C13-787B-295F http://orcid.org/0000-0003-3759-3850 0000-0003-3759-3850 Carvalho, J.M. Valério de |
| publishDate | 2008 |
| reponame_str | Biblioteca Digital do IPB |
| repository_id_str | urn:repositoryAcronym:ipb |
| service_str_mv | urn:repositoryAcronym:ipb |
| spelling | engporIn this paper we present two planning and scheduling models for a real problem of a textile industry that produces fine knitted goods. In both of them we develop plans to assist the knitting planning of one of three knitting subsections. In this problem we intend to assign and sequence, within a set of available and identical parallel machines, the demand associated with each component or garment part. This demand can be split in lots of smaller quantities and these lots can be independently produced at any time in one or more of the available machines. In the first model we develop a mixed integer programming (MIP) formulation and in the second one we develop network flow based models and a scheduling heuristic. The main advantage of the second model, in opposition to the first one, is the small computational resources needed to solve this huge and complex problem. We solve an instance generated in accordance with the characteristics of the real problem by the second model and present some performance measures.application/pdfporA scheduling model for a knitting planning problemPimentel, CarinaAlvelos, FilipePersonalDuarte, AntónioDSpacehttp://dspace.org/items/40f0f385-492d-4c6c-8949-2480688b1666DSpacehttp://dspace.org/items/40f0f385-492d-4c6c-8949-2480688b1666DuarteAntónioCiência IDhttps://www.ciencia-id.pt9C13-787B-295FORCIDhttp://orcid.org0000-0003-3759-3850Researcher IDhttps://www.researcherid.comH-4473-2011Scopus Author IDhttps://www.scopus.com36967901400Carvalho, J.M. Valério deHostingInstitutionOrganizationalBiblioteca Digital do IPBe-mailmailto:dspace@ipb.ptdspace@ipb.ptISBNIsPartOf978-4-88361-646-62012-07-26T09:53:42Z20082008-01-01T00:00:00ZHandlehttp://hdl.handle.net/10198/7322http://purl.org/coar/access_right/c_abf2open accessPlanning and schedulingMixed integer programmingNetwork flows1534851 bytesother research producthttp://purl.org/coar/resource_type/c_5794conference paperhttp://purl.org/coar/access_right/c_abf2application/pdffulltexthttps://bibliotecadigital.ipb.pt/bitstreams/bc5d9255-0449-4615-b798-c98a6b613cf2/downloadPOM Tokio 2008 - 3rd World Conference on Production and Operations ManagementTokio |
| spellingShingle | A scheduling model for a knitting planning problem Pimentel, Carina Planning and scheduling Mixed integer programming Network flows |
| status | SINGLETON |
| subject.fl_str_mv | Planning and scheduling Mixed integer programming Network flows |
| title | A scheduling model for a knitting planning problem |
| title_full | A scheduling model for a knitting planning problem |
| title_fullStr | A scheduling model for a knitting planning problem |
| title_full_unstemmed | A scheduling model for a knitting planning problem |
| title_short | A scheduling model for a knitting planning problem |
| title_sort | A scheduling model for a knitting planning problem |
| topic | Planning and scheduling Mixed integer programming Network flows |
| topic_facet | Planning and scheduling Mixed integer programming Network flows |
| url | http://hdl.handle.net/10198/7322 |
| visible | 1 |