Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/108289
Citations
Scopus Web of Science® Altmetric
?
?
Type: Conference paper
Title: Ant colony algorithm based scheduling for handling software project delay
Author: Zhang, W.
Yang, Y.
Xiao, J.
Liu, X.
Babar, M.
Citation: Proceedings of the 2015 International Conference on Software and System Process, 2015 / vol.24-26-August-2015, pp.52-56
Publisher: ACM
Issue Date: 2015
Series/Report no.: ACM International Conference Proceeding Series
ISBN: 9781450333467
Conference Name: 2015 International Conference on Software and System Process (ICSSP 2015) (24 Aug 2015 - 26 Aug 2015 : Tallinn, Estonia)
Statement of
Responsibility: 
Wei Zhang, Yun Yang, Junchao Xiao, Xiao Liu, Muhammad Ali Babar
Abstract: Delay on a critical path may cause the failure in meeting the software project deadline. By adding extra employees with similar skills for help, the delay is expected to be eliminated or reduced. However, the originally scheduled activities may be suspended due to reallocation of employees, which may lead to the problem of delay propagation. So how to minimize and even eliminate the delay without delay propagation is worth investigation. In this paper, we first use a simple scenario to demonstrate the problem of employee scheduling which shows that in the scheduling process, one activity can have many ways for selecting employees from another project. In fact, the searching path in a multi-branch tree and its complete traversal is a NP hard problem. Furthermore when the scale of the problem becomes large, it is impractical to generate a search tree for implementation. Therefore, we propose an ant colony algorithm to address such a problem. Both case studies and initial simulation results demonstrate that our proposed algorithm can obtain feasible solutions under different circumstances.
Keywords: Scheduling, software process, project delay handling
Rights: © 2015 ACM. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise,or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permission from Permissions@acm.org.
RMID: 0030045042
DOI: 10.1145/2785592.2785603
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
RA_hdl_108289.pdfRestricted Access636.39 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.