SOFTWARE PROJECT SCHEDULING USING THE HYPER-CUBE ANT COLONY OPTIMIZATION ALGORITHM
| dc.authorid | johnson, franklin/0000-0003-4522-3809 | |
| dc.authorid | Misra, Sanjay/0000-0002-3556-9331 | |
| dc.authorid | Crawford, Broderick/0000-0001-5500-0188 | |
| dc.authorscopusid | 23395875300 | |
| dc.authorscopusid | 24403038600 | |
| dc.authorscopusid | 15520434500 | |
| dc.authorscopusid | 56962766700 | |
| dc.authorscopusid | 24773930800 | |
| dc.authorscopusid | 56239062300 | |
| dc.authorwosid | johnson, franklin/AAQ-1436-2020 | |
| dc.authorwosid | Misra, Sanjay/K-2203-2014 | |
| dc.contributor.author | Mısra, Sanjay | |
| dc.contributor.author | Soto, Ricardo | |
| dc.contributor.author | Johnson, Franklin | |
| dc.contributor.author | Misra, Sanjay | |
| dc.contributor.author | Paredes, Fernando | |
| dc.contributor.author | Olguin, Eduardo | |
| dc.contributor.other | Computer Engineering | |
| dc.date.accessioned | 2024-07-05T14:32:19Z | |
| dc.date.available | 2024-07-05T14:32:19Z | |
| dc.date.issued | 2015 | |
| dc.department | Atılım University | en_US |
| dc.department-temp | [Crawford, Broderick; Soto, Ricardo; Johnson, Franklin] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile; [Crawford, Broderick; Olguin, Eduardo] Univ San Sebastian, Recoleta, Chile; [Crawford, Broderick] Univ Cent Chile, Santiago, Chile; [Soto, Ricardo] Univ Autonoma Chile, Santiago, Chile; [Soto, Ricardo] Univ Cient Sur, Lima, Peru; [Johnson, Franklin] Univ Playa Ancha, Valparaiso, Chile; [Misra, Sanjay] Covenant Univ, Dept Comp & Informat Sci, Ota, Nigeria; [Misra, Sanjay] Atilim Univ, TR-06836 Ankara, Turkey; [Paredes, Fernando] Univ Diego Portales, Escuela Ingn Ind, Santiago, Chile | en_US |
| dc.description | johnson, franklin/0000-0003-4522-3809; Misra, Sanjay/0000-0002-3556-9331; Crawford, Broderick/0000-0001-5500-0188 | en_US |
| dc.description.abstract | This paper introduces a proposal of design of Ant Colony Optimization algorithm paradigm using Hyper-Cube framework to solve the Software Project Scheduling Problem. This NP-hard problem consists in assigning tasks to employees in order to minimize the project duration and its overall cost. This assignment must satisfy the problem constraints and precedence between tasks. The approach presented here employs the Hyper-Cube framework in order to establish an explicitly multidimensional space to control the ant behaviour. This allows us to autonomously handle the exploration of the search space with the aim of reaching encouraging solutions. | en_US |
| dc.description.sponsorship | [ONICYT/FONDECYT/REGULAR/1140897]; [CONICYT/FONDECYT/INICIACION/11130459]; [CONICYT/FONDECYT/REGULAR/1130455] | en_US |
| dc.description.sponsorship | Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1140897. Ricardo Soto is supported by Grant CONICYT/FONDECYT/INICIACION/11130459. Fernando Paredes is supported by Grant CONICYT/FONDECYT/REGULAR/1130455. Franklin Johnson is supported by Postgraduate Grant PUCV 2015. | en_US |
| dc.identifier.citation | 6 | |
| dc.identifier.doi | 10.17559/TV-20140519212813 | |
| dc.identifier.endpage | 1178 | en_US |
| dc.identifier.issn | 1330-3651 | |
| dc.identifier.issn | 1848-6339 | |
| dc.identifier.issue | 5 | en_US |
| dc.identifier.scopus | 2-s2.0-84946059895 | |
| dc.identifier.scopusquality | Q3 | |
| dc.identifier.startpage | 1171 | en_US |
| dc.identifier.uri | https://doi.org/10.17559/TV-20140519212813 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14411/792 | |
| dc.identifier.volume | 22 | en_US |
| dc.identifier.wos | WOS:000363986400012 | |
| dc.identifier.wosquality | Q4 | |
| dc.language.iso | en | en_US |
| dc.publisher | Univ Osijek, Tech Fac | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Ant Colony Optimization | en_US |
| dc.subject | Hyper-Cube | en_US |
| dc.subject | scheduling | en_US |
| dc.subject | Software Project Management | en_US |
| dc.title | SOFTWARE PROJECT SCHEDULING USING THE HYPER-CUBE ANT COLONY OPTIMIZATION ALGORITHM | en_US |
| dc.type | Article | en_US |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | 53e88841-fdb7-484f-9e08-efa4e6d1a090 | |
| relation.isAuthorOfPublication.latestForDiscovery | 53e88841-fdb7-484f-9e08-efa4e6d1a090 | |
| relation.isOrgUnitOfPublication | e0809e2c-77a7-4f04-9cb0-4bccec9395fa | |
| relation.isOrgUnitOfPublication.latestForDiscovery | e0809e2c-77a7-4f04-9cb0-4bccec9395fa |