Dynamic Task Scheduling and Conflict Analysis for Multi-Resource Limited Project Controlling

Critical path analysis can be a good tool when scheduling the tasks with pre-determined. Typically there are multiple kinds of resource and each has different cost and limitation in the progress of the projects. Current existent formal methods seemed to be weak in scheduling the tasks in such large projects. Genetic algorithm has been proposed to optimize the scheduling with resource constrains. They can report an optimized result, but they lack the analysis of the scheduling conflict and there is no thread for further improvement. In this paper, the authors bring forth a new concept "labor opportunity contribution", and present yet another formal solution based on such concept. This method can handle the dynamic task scheduling and the scheduling conflict analysis, which enables the further improvement.

[1]  James H. Patterson,et al.  A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem , 1984 .

[2]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[3]  Ishfaq Ahmad,et al.  Scheduling Parallel Programs Using Genetic Algorithms , 2000 .

[4]  J. Herbsleb,et al.  Global software development , 2001 .

[5]  Bin Xu,et al.  Global cooperative design in legacy system reengineering project , 2004, 8th International Conference on Computer Supported Cooperative Work in Design.

[6]  Dale Walter Karolak.  Global software development , 1998 .

[7]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[8]  Audris Mockus,et al.  Globalization by Chunking: A Quantitative Approach , 2001, IEEE Softw..

[9]  Audris Mockus,et al.  An Empirical Study of Speed and Communication in Globally Distributed Software Development , 2003, IEEE Trans. Software Eng..

[10]  Albert Y. Zomaya,et al.  Observations on Using Genetic Algorithms for Dynamic Load-Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[11]  James D. Herbsleb,et al.  The geography of coordination: dealing with distance in R&D work , 1999, GROUP.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Erran Carmel,et al.  Global software teams: collaborating across borders and time zones , 1999 .

[14]  Bin Xu,et al.  Enhancing coordination in global cooperative software design , 2005, Proceedings of the Ninth International Conference on Computer Supported Cooperative Work in Design, 2005..

[15]  Yun Ling,et al.  Facilitating Cooperation in Global Software Design via Micro-Estimation , 2006, 2006 10th International Conference on Computer Supported Cooperative Work in Design.

[16]  Erran Carmel,et al.  Tactical Approaches for Alleviating Distance in Global Software Development , 2001, IEEE Softw..

[17]  Nirwan Ansari,et al.  A Genetic Algorithm for Multiprocessor Scheduling , 1994, IEEE Trans. Parallel Distributed Syst..

[18]  Wang Ding-wei,et al.  Project Scheduling Problem Involving Time-Splittable Tasks , 2006 .

[19]  Yu-Kwong Kwok,et al.  Mapping Tasks onto Distributed Heterogeneous Computing Systems Using a Genetic Algorithm Approach , 2000 .

[20]  Stephanie D. Teasley,et al.  Groupware in the wild: lessons learned from a year of virtual collocation , 1996, CSCW '96.

[21]  T. Allen.  Managing the flow of technology , 1977 .