On the multi-mode, multi-skill resource constrained project scheduling problem : computational results
| Autor(a) principal: | |
|---|---|
| Data de Publicação: | 2011 |
| Outros Autores: | |
| Idioma: | eng |
| Título da fonte: | Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| Texto Completo: | http://hdl.handle.net/1822/15519 |
Resumo: | This paper is concerned with an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) which belongs to the class of the optimization scheduling problems with multi-level (or multi-mode) activities. We developed a practical tool, useful to represent multi-mode projects, and to find a solution for the problem on hand – select the best mode for each resource in each activity in order to minimize the total cost, considering the resource cost, a penalty for tardiness and a bonus for early completion. We implemented an adaptation of a filtered beam search (FBS) algorithm to this problem, using the C# programming language. A “filtered beam” search is a heuristic Branch and Bound (BaB) procedure that uses breadth first search but only the top “best” nodes are kept. We give some of the most important solution details and we report on further computational results, by testing the application for different problem sizes. |
| id |
RCAP_8a14e9a868d40b8a7a105da6a4ffa3d3 |
|---|---|
| oai_identifier_str |
oai:repositorium.sdum.uminho.pt:1822/15519 |
| network_acronym_str |
RCAP |
| network_name_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| repository_id_str |
https://opendoar.ac.uk/repository/7160 |
| spelling |
On the multi-mode, multi-skill resource constrained project scheduling problem : computational resultsRCPSPMulti-modeBeam searchThis paper is concerned with an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) which belongs to the class of the optimization scheduling problems with multi-level (or multi-mode) activities. We developed a practical tool, useful to represent multi-mode projects, and to find a solution for the problem on hand – select the best mode for each resource in each activity in order to minimize the total cost, considering the resource cost, a penalty for tardiness and a bonus for early completion. We implemented an adaptation of a filtered beam search (FBS) algorithm to this problem, using the C# programming language. A “filtered beam” search is a heuristic Branch and Bound (BaB) procedure that uses breadth first search but only the top “best” nodes are kept. We give some of the most important solution details and we report on further computational results, by testing the application for different problem sizes.Universidade do MinhoSantos, Mónica A.Tereso, Anabela Pereira20112011-01-01T00:00:00Zconference paperinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/1822/15519enginfo:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2024-05-11T04:57:33Zoai:repositorium.sdum.uminho.pt:1822/15519Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T15:03:47.248791Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse |
| dc.title.none.fl_str_mv |
On the multi-mode, multi-skill resource constrained project scheduling problem : computational results |
| title |
On the multi-mode, multi-skill resource constrained project scheduling problem : computational results |
| spellingShingle |
On the multi-mode, multi-skill resource constrained project scheduling problem : computational results Santos, Mónica A. RCPSP Multi-mode Beam search |
| title_short |
On the multi-mode, multi-skill resource constrained project scheduling problem : computational results |
| title_full |
On the multi-mode, multi-skill resource constrained project scheduling problem : computational results |
| title_fullStr |
On the multi-mode, multi-skill resource constrained project scheduling problem : computational results |
| title_full_unstemmed |
On the multi-mode, multi-skill resource constrained project scheduling problem : computational results |
| title_sort |
On the multi-mode, multi-skill resource constrained project scheduling problem : computational results |
| author |
Santos, Mónica A. |
| author_facet |
Santos, Mónica A. Tereso, Anabela Pereira |
| author_role |
author |
| author2 |
Tereso, Anabela Pereira |
| author2_role |
author |
| dc.contributor.none.fl_str_mv |
Universidade do Minho |
| dc.contributor.author.fl_str_mv |
Santos, Mónica A. Tereso, Anabela Pereira |
| dc.subject.por.fl_str_mv |
RCPSP Multi-mode Beam search |
| topic |
RCPSP Multi-mode Beam search |
| description |
This paper is concerned with an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) which belongs to the class of the optimization scheduling problems with multi-level (or multi-mode) activities. We developed a practical tool, useful to represent multi-mode projects, and to find a solution for the problem on hand – select the best mode for each resource in each activity in order to minimize the total cost, considering the resource cost, a penalty for tardiness and a bonus for early completion. We implemented an adaptation of a filtered beam search (FBS) algorithm to this problem, using the C# programming language. A “filtered beam” search is a heuristic Branch and Bound (BaB) procedure that uses breadth first search but only the top “best” nodes are kept. We give some of the most important solution details and we report on further computational results, by testing the application for different problem sizes. |
| publishDate |
2011 |
| dc.date.none.fl_str_mv |
2011 2011-01-01T00:00:00Z |
| dc.type.driver.fl_str_mv |
conference paper |
| dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
| status_str |
publishedVersion |
| dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/1822/15519 |
| url |
http://hdl.handle.net/1822/15519 |
| dc.language.iso.fl_str_mv |
eng |
| language |
eng |
| dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
| eu_rights_str_mv |
openAccess |
| dc.format.none.fl_str_mv |
application/pdf |
| dc.source.none.fl_str_mv |
reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia instacron:RCAAP |
| instname_str |
FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
| instacron_str |
RCAAP |
| institution |
RCAAP |
| reponame_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| collection |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| repository.name.fl_str_mv |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
| repository.mail.fl_str_mv |
info@rcaap.pt |
| _version_ |
1833595074644017152 |