eprintid: 15787
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/01/57/87
datestamp: 2023-11-10 03:30:25
lastmod: 2023-11-10 03:30:25
status_changed: 2023-11-10 02:00:24
type: article
metadata_visibility: show
creators_name: Ameen, A.O.
creators_name: Mojeed, H.A.
creators_name: Bolariwa, A.T.
creators_name: Balogun, A.O.
creators_name: Mabayoje, M.A.
creators_name: Usman-Hamzah, F.E.
creators_name: Abdulraheem, M.
title: Application of Shuffled Frog-Leaping Algorithm for Optimal Software Project Scheduling and Staffing
ispublished: pub
keywords: Cost benefit analysis; Cost estimating; Heuristic algorithms; Multiobjective optimization; Personnel; Personnel selection; Scheduling; Software design, Dependency constraints; Meta heuristic algorithm; Project completion time; Search-based software engineering; Shuffled frog leaping algorithm (SFLA); Software project planning; Software Project Scheduling; Traditional computing, Application programs
note: cited By 2
abstract: Software Project Scheduling Problem is one of the most crucial issues in software development because it includes resources planning; cost estimates, staffing and cost control which if not properly planned affect the timely completion of the software project. Software project scheduling is a problem of scheduling the tasks (work packages) and employees in such a way that the overall project completion time is minimized without violating dependency constraints (tasks dependencies) and being consistent with resource constraints. This study adopts a Search Based Software Engineering approach that focuses on multi-objective optimization for a software project planning using the Shuffled Frog Leaping Algorithm, a memetic meta-heuristic algorithm. The objectives are optimal ordering of work packages without dependency violation and allocation of staff to the work packages such that only employee(s) with required competence(s) are allotted to a given work package. The study was carried out in four stages, namely: frog (solution) representation, definition of the fitness function, implementation of Shuffled Frog Leaping Algorithm and evaluation with a randomly generated Software Project Scheduling Problem. The study concludes that it is possible to find an efficient solution to a Software Project Scheduling Problem by implementing the SFLA than any other traditional computing means which are tedious, error prone and costly. © 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.
date: 2021
publisher: Springer Science and Business Media Deutschland GmbH
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85105436213&doi=10.1007%2f978-3-030-70713-2_28&partnerID=40&md5=2d076aeafae8f5aada181f6ee9e3d8a9
id_number: 10.1007/978-3-030-70713-2₂₈
full_text_status: none
publication: Lecture Notes on Data Engineering and Communications Technologies
volume: 72
pagerange: 293-303
refereed: TRUE
issn: 23674512
citation:   Ameen, A.O. and Mojeed, H.A. and Bolariwa, A.T. and Balogun, A.O. and Mabayoje, M.A. and Usman-Hamzah, F.E. and Abdulraheem, M.  (2021) Application of Shuffled Frog-Leaping Algorithm for Optimal Software Project Scheduling and Staffing.  Lecture Notes on Data Engineering and Communications Technologies, 72.  pp. 293-303.  ISSN 23674512