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.
- E. Alba and J. F. Chicano.2007.Software Project Management with Gas. Information Sciences, 177, 2380– 2401. Google ScholarDigital Library
- F. Brooks. 1995. The Mythical Man-Month: Essays on Software Engineering (Anniversary Edition). Addison-Wesley. Google ScholarDigital Library
- W.-N. Chen and J. Zhang. 2013. Ant Colony Optimization for Software Project Scheduling and Staffing with an Event-Based Scheduler. IEEE Transactions on Software Engineering, 39(1), 1–17. Google ScholarDigital Library
- T. H. Cormen.2001.Introduction to Algorithms (Second Edition).The MIT Press. Google ScholarDigital Library
- M. Di Penta, M. Harman, and G. Antoniol. 2011. The Use of Search Based Optimization Techniques to Schedule and Staff Software Projects: An Approach and an Empirical Study. Software: Practice and Experience, 41,495–519. Google ScholarDigital Library
- B. Hughes. 2002. Software Project Management (Fifth Edition).McGraw-Hill.Google Scholar
- X. Li. and J. Qi. 2009. Free Float Theorem and Algorithm of Seeking the k-th Order Critical Path. Journal of Management Sciences in China, 12, 98–103.Google Scholar
- X. Liu and Y. Yang, Achieving On-Time Delivery: A Two-Stage Probabilistic Scheduling Strategy for Software Projects. In 2009 International Conference on Software Process, (Vancouver, Canada, 2009), Lecture Notes in Computer Science, 317-329. Google ScholarDigital Library
- Y. Liu, J. Wang, Y. Yang and J. Sun. 2008. A Semi-Automatic Approach for Workflow Staff Assignment. Computers in Industry, 59 (5), 463–476. Google ScholarDigital Library
- L. L. Minku, D. Sudholt, and X. Yao. 2014. Improved Evolutionary Algorithm Design for the Project Scheduling Problem Based on Runtime Analysis. IEEE Transactions on Software Engineering, 40(1), 83–102. Google ScholarDigital Library
- J. Qi, S. Yi. 1994. The Max Efficient Solution of Contraction: the Limit of the Project with min Cost. Journal of North China Institute of Electric Power, 2, 109–114.Google Scholar
- I. Sommerville. 2006.Software Engineering (Eighth Edition). Addison-Wesley.Google Scholar
- J. Xiao and Q. Wang, Value-based Multiple Software Projects Scheduling with Genetic Algorithm. In 2009 International Conference on Software Process, (Vancouver, Canada, 2009), Lecture Notes in Computer Science, 50-62. Google ScholarDigital Library
Index Terms
- Ant colony algorithm based scheduling for handling software project delay
Recommendations
Multi-constraint system scheduling using dynamic and delay ant colony system
IEA/AIE'07: Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systemsThis study presents and evaluates a modified ant colony optimization (ACO) approach for the precedence and resource-constrained multiprocessor scheduling problems. A modified ant colony system, with two designed rules, called dynamic and delay ant ...
Minimizing total completion time in two-machine flow shops with exact delay using genetic algorithm & ant colony algorithm
GECCO '09: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking PapersWe study the problem of minimizing total completion time in a two-machine flow shop with exact delay. There are n jobs, one upstream machine M1 and one downstream machine M2. Each job has to be processed first on machine M1, then on machine M2, and has ...
A Modified Ant Colony Optimization algorithm for the Distributed Job shop Scheduling Problem
The Distributed Job shop Scheduling Problem (DJSP) deals with the assignment of jobs to factories geographically distributed and with determining a good operation schedule of each factory. The objective is to minimize the global makespan over all the ...
Comments