EFFECTIVE TASK DISTRIBUTION IN COLLABORATIVE SOFTWARE DEVELOPMENT

• US 20100057514A1
• Filed: 08/29/2008
• Published: 03/04/2010
• Est. Priority Date: 08/29/2008
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Oppenheim, Daniel V., Chee, Yi-Min, Zou, Zhi Le, Ma, Qian, Liu, Feng, Ratakonda, Krishna
• Application Number:
  US12/201,073
• Publication Number:
  US 20100057514A1
• Time in Patent Office: Days
• US Class Current: 705/8
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 50/188 Electronic negotiation

Abstract

A method, system and computer program product are disclosed to support the dynamic (just-in-time) task distribution in the context of globally collaborative software development. Embodiments of the invention provide a method, system and computer program product for distributing tasks in a collaborative software development project, where said project has a multitude of work packets. An embodiment of the invention includes generating bidding request forms, and broadcasting the bidding request forms to a multitude of distributed teams; collecting completed bidding request forms having real-time information about attributes of the distributed teams; and matching eligible teams to the work packets. This embodiment further comprise optimizing a distribution plan of the work packets; ranking results of the distribution plan to give a final distribution plan; and notifying each of the distributed teams of any work packets assigned to them.

Claims

1. A method of distributing tasks in a collaborative software development project, said project having a multitude of work packets, the method comprising:

generating bidding request forms for the work packets, and broadcasting the bidding request forms to a multitude of distributed teams;

collecting from at least some of the distributed teams, completed bidding request forms having real-time information about functional and nonfunctional attributes of the distributed teams;

matching eligible distributed teams to the work packets based on given mandatory conditions;

optimizing a task distribution plan of the work packets to the distributed teams based on said real-time information collected from different ones of the distributed teams;

ranking results of the task distribution plan to give a final distribution plan of the work packets to the distributed teams; and

notifying each of the distributed teams of any work packets assigned to said each distributed team.

2. The method according to claim 1, further comprising dynamically swapping some of the distributed teams that are assigned to some of the work packets during the development project as the availability of the distributed teams change.

3. The method according to claim 1, wherein the optimizing a task distribution plan includes inputting optimization rules and using the optimization rules and said real-time information to optimize the task distribution plan.

4. The method according to claim 1, wherein the optimizing a task distribution plan includes assigning each of the work packets to one of the distributed teams based on a work duration and a development cost of said each work packet.

5. The method according to claim 4, wherein the optimizing a task distribution plan includes assigning each of the work packets to one of the distributed teams further based on:

t<sub>aggr—

plan</sub>—

The expected aggregated work duration before current development task,

T<sub>curr—

plan</sub>13 The expected work duration of current development task,

C<sub>aggr—

plan</sub>—

The expected aggregated cost before current development task, and

C<sub>curr—

plan</sub>—

The expected cost of current development task.

6. The method according to claim 5, wherein the optimizing a task distribution plan includes assigning each of the work packets to one of the distributed teams further based on:

T<sub>aggr—

bid</sub>—

The aggregated work duration before current development task after a series of bidding,

T<sub>curr—

bid</sub>—

The work duration of current development task after bidding,

C<sub>aggr—

bid</sub>—

The aggregated cost before current development task after a series of bidding, and

C<sub>curr—

bid</sub>—

The cost of current development task after bidding.

7. The method according to claim 6, wherein the optimizing a task distribution plan includes assigning each of the work packets to one of the distributed teams further based on the ratios:

8. The method according to claim 7, wherein the optimizing a task distribution plan includes assigning each of the work packets to the one of the distributed teams having, for said each work packet, the min(f(α

DOR,β

COR)), where f(α

DOR,β

COR)>

0

where α and

β

are selected weighting coefficients.

9. The method according to claim 1, wherein each of the bidding request forms describes information for a specific one of the work packets, including capability requirements, inputs, deliverables and reference documents.

10. The method according to claim 1, wherein the matching eligible distributed teams to the work packets includes using semantic technology to increase the matching quality by preventing only literal interpretation of information in the bidding request forms.

11. A task distribution system for distributing tasks in a collaborative software development project, said project having a multitude of work packets, the system comprising:

a bidding request generator for generating bidding request forms for the work packets, and broadcasting the bidding request forms to a multitude of distributed teams;

a bidding request collector for collecting from at least some of the distributed teams, completed bidding request forms having real-time information about functional and non-functional attributes of the distributed teams;

a mandatory condition matcher for matching eligible distributed teams to the work packets based on given mandatory conditions;

a distribution plan optimizer for optimizing a task distribution plan of the work packets to the distributed teams based on said real-time information collected from different ones of the distributed teams;

a ranking result generator for ranking results of the task distribution plan; and

a task distributor for give a final distribution plan of the work packets based on said ranking results.

12. The system according to claim 11, wherein the distribution plan optimizer uses given optimization rules and said real-time information to optimize the task distribution plan.

13. The system according to claim 11, wherein task distributor assigns each of the work packets to one of the distributed teams further based on:

T<sub>aggr—

plan</sub>—

The expected aggregated work duration before current development task,

T<sub>curr—

plan</sub>—

The expected work duration of current development task,

C<sub>aggr—

plan</sub>—

The expected aggregated cost before current development task,

C<sub>curr—

plan</sub>—

The expected cost of current development task,

T<sub>aggr—

bid</sub>—

The aggregated work duration before current development task after a series of bidding,

T<sub>curr—

bid</sub>—

The work duration of current development task after bidding,

C<sub>aggr—

bid</sub>—

The aggregated cost before current development task after a series of bidding, and

C<sub>curr—

bid</sub>—

The cost of current development task after bidding.

14. The method according to claim 13, wherein task distributor assigns each of the work packets to one of the distributed teams further based on the ratios:

15. The system according to claim 11, wherein the mandatory condition matcher uses semantic technology to increase the matching quality by preventing only literal interpretation of information in the bidding request forms.

16. An article of manufacture comprising:

at least one computer usable medium having computer readable program code logic to execute a machine instruction in one or more processing units for distributing tasks in a collaborative software development project, said project having a multitude of work packets, the computer readable program code logic, when executing, performing the following;

generating bidding request forms for the work packets, and broadcasting the bidding request forms to a multitude of distributed teams;

collecting from at least some of the distributed teams, completed bidding request forms having real-time information about functional and non-functional attributes of the distributed teams;

matching eligible distributed teams to the work packets based on given mandatory conditions;

optimizing a task distribution plan of the work packets to the distributed teams based on said real-time information collected from different ones of the distributed teams;

ranking results of the task distribution plan to give a final distribution plan of the work packets to the distributed teams; and

notifying each of the distributed teams of any work packets assigned to said each distributed team.

17. The article of manufacture according to claim 16, wherein the computer readable program code logic, when executing, further performs dynamically swapping some of the distributed teams that are assigned to some of the work packets during the development project as the availability of the distributed teams change.

18. The article of manufacture according to claim 16, wherein the optimizing a task distribution plan includes assigning each of the work packets to one of the distributed teams based on:

T<sub>aggr—

plan</sub>—

The expected aggregated work duration before current development task,

T<sub>curr—

plan</sub>—

The expected work duration of current development task,

C<sub>aggr—

plan</sub>—

The expected aggregated cost before current development task,

C<sub>curr—

plan</sub>—

The expected cost of current development task,

T<sub>aggr—

bid</sub>—

The aggregated work duration before current development task after a series of bidding,

T<sub>curr—

bid</sub>—

The work duration of current development task after bidding,

C<sub>aggr—

bid</sub>—

The aggregated cost before current development task after a series of bidding, and

C<sub>curr—

bid</sub>—

The cost of current development task after bidding.

19. The article of manufacture according to claim 18, wherein the optimizing a task distribution plan includes assigning each of the work packets to one of the distributed teams further based on the ratios:

20. The article of manufacture according to claim 16, wherein the matching eligible distributed teams to the work packets includes using semantic technology to increase the matching quality by preventing only literal interpretation of information in the bidding request forms.