Publicação
Solving a multiprocessor problem by column generation and branch-and-price
| Resumo: | This work presents an algorithm for solving exactly a scheduling problem with identical parallel machines and malleable tasks, subject to arbitrary release dates and due dates. The objective is to minimize a function of late work and setup costs. A task is malleable if we can freely change the set of machines assigned to its processing over the time horizon. We present an integer programming model, a Dantzig-Wolfe decomposition reformulation and its solution by column generation. We also developed an equivalent network flow model, used for the branching phase. Finally, we carried out extensive computational tests to verify the algorithm’s efficiency and to determine the model’s sensitivity to instance size parameters: the number of machines, the number of tasks and the size of the planning horizon. |
|---|---|
| Autores principais: | Carvalho, J.M. Valério de |
| Outros Autores: | Duarte, António |
| Assunto: | Scheduling Branch-and-price |
| Ano: | 2010 |
| 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_ | 1867172754189451264 |
|---|---|
| author | Carvalho, J.M. Valério de |
| author2 | Duarte, António |
| author2_role | author |
| author_facet | Carvalho, J.M. Valério de Duarte, António |
| author_role | author |
| contributor_name_str_mv | Biblioteca Digital do IPB |
| country_str | PT |
| creators_json_txt | [{\"Person.name\":\"Carvalho, J.M. Valério de\"},{\"Person.name\":\"Duarte, António\",\"Person.identifier.orcid\":\"0000-0003-3759-3850\"}] |
| datacite.contributors.contributor.contributorName.fl_str_mv | Biblioteca Digital do IPB |
| datacite.creators.creator.creatorName.fl_str_mv | Carvalho, J.M. Valério de Duarte, António |
| datacite.date.Accepted.fl_str_mv | 2010-01-01T00:00:00Z |
| datacite.date.available.fl_str_mv | 2010-10-21T13:21:26Z |
| datacite.date.embargoed.fl_str_mv | 2010-10-21T13:21:26Z |
| datacite.rights.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| datacite.subjects.subject.fl_str_mv | Scheduling Branch-and-price |
| datacite.titles.title.fl_str_mv | Solving a multiprocessor problem by column generation and branch-and-price |
| dc.contributor.none.fl_str_mv | Biblioteca Digital do IPB |
| dc.creator.none.fl_str_mv | Carvalho, J.M. Valério de Duarte, António |
| dc.date.Accepted.fl_str_mv | 2010-01-01T00:00:00Z |
| dc.date.available.fl_str_mv | 2010-10-21T13:21:26Z |
| dc.date.embargoed.fl_str_mv | 2010-10-21T13:21:26Z |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10198/2670 |
| 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 | Scheduling Branch-and-price |
| dc.title.fl_str_mv | Solving a multiprocessor problem by column generation and branch-and-price |
| dc.type.none.fl_str_mv | http://purl.org/coar/resource_type/c_5794 |
| description | This work presents an algorithm for solving exactly a scheduling problem with identical parallel machines and malleable tasks, subject to arbitrary release dates and due dates. The objective is to minimize a function of late work and setup costs. A task is malleable if we can freely change the set of machines assigned to its processing over the time horizon. We present an integer programming model, a Dantzig-Wolfe decomposition reformulation and its solution by column generation. We also developed an equivalent network flow model, used for the branching phase. Finally, we carried out extensive computational tests to verify the algorithm’s efficiency and to determine the model’s sensitivity to instance size parameters: the number of machines, the number of tasks and the size of the planning horizon. |
| dirty | 0 |
| eu_rights_str_mv | openAccess |
| format | conferencePaper |
| fulltext.url.fl_str_mv | https://bibliotecadigital.ipb.pt/bitstreams/a0ae4a2b-a5a3-4ebb-b4a5-051ef6fefd79/download |
| id | ipb_ec81534d62dafc70c01fd3918b85f21e |
| identifier.url.fl_str_mv | http://hdl.handle.net/10198/2670 |
| 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/2670 |
| organization_str_mv | urn:organizationAcronym:ipb |
| person_str_mv | Carvalho, J.M. Valério de 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 |
| publishDate | 2010 |
| reponame_str | Biblioteca Digital do IPB |
| repository_id_str | urn:repositoryAcronym:ipb |
| service_str_mv | urn:repositoryAcronym:ipb |
| spelling | engporThis work presents an algorithm for solving exactly a scheduling problem with identical parallel machines and malleable tasks, subject to arbitrary release dates and due dates. The objective is to minimize a function of late work and setup costs. A task is malleable if we can freely change the set of machines assigned to its processing over the time horizon. We present an integer programming model, a Dantzig-Wolfe decomposition reformulation and its solution by column generation. We also developed an equivalent network flow model, used for the branching phase. Finally, we carried out extensive computational tests to verify the algorithm’s efficiency and to determine the model’s sensitivity to instance size parameters: the number of machines, the number of tasks and the size of the planning horizon.application/pdfporSolving a multiprocessor problem by column generation and branch-and-priceCarvalho, J.M. Valério dePersonalDuarte, 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.com36967901400HostingInstitutionOrganizationalBiblioteca Digital do IPBe-mailmailto:dspace@ipb.ptdspace@ipb.pt2010-10-21T13:21:26Z20102010-01-01T00:00:00ZHandlehttp://hdl.handle.net/10198/2670http://purl.org/coar/access_right/c_abf2open accessSchedulingBranch-and-price175105 bytesother research producthttp://purl.org/coar/resource_type/c_5794conference paperhttp://purl.org/coar/access_right/c_abf2application/pdffulltexthttps://bibliotecadigital.ipb.pt/bitstreams/a0ae4a2b-a5a3-4ebb-b4a5-051ef6fefd79/downloadIFAC MCPL 2010Coimbra |
| spellingShingle | Solving a multiprocessor problem by column generation and branch-and-price Carvalho, J.M. Valério de Scheduling Branch-and-price |
| status | SINGLETON |
| subject.fl_str_mv | Scheduling Branch-and-price |
| title | Solving a multiprocessor problem by column generation and branch-and-price |
| title_full | Solving a multiprocessor problem by column generation and branch-and-price |
| title_fullStr | Solving a multiprocessor problem by column generation and branch-and-price |
| title_full_unstemmed | Solving a multiprocessor problem by column generation and branch-and-price |
| title_short | Solving a multiprocessor problem by column generation and branch-and-price |
| title_sort | Solving a multiprocessor problem by column generation and branch-and-price |
| topic | Scheduling Branch-and-price |
| topic_facet | Scheduling Branch-and-price |
| url | http://hdl.handle.net/10198/2670 |
| visible | 1 |