Devices, systems, and methods for migration scheduling

• US 7,826,607 B1
• Filed: 04/04/2006
• Issued: 11/02/2010
• Est. Priority Date: 04/04/2006
• Status: Expired due to Fees

• Current Assignee: AT&T Corporation (AT&T, Inc.)
• Original Assignee: AT&T Intellectual Property II LP (AT&T, Inc.)
• Inventors: de Carvalho Resende, Mauricio Guilherme, Andrade, Diogo Vieira
• Primary Examiner(s): Anwah; Olisa
• Application Number:
  US11/397,766
• Time in Patent Office: 1,673 Days
• Field of Search: 379/198, 379/225, 379/231, 379/232, 379/234, 379/211.03, 379/211.02, 379/15.03
• US Class Current: 379/225
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: H04L 67/62 Establishing a time schedule for servicing the requests
• CPC Class Codes: H04M 3/22 Arrangements for supervision, monitoring or testing
• CPC Class Codes: H04M 3/42314 in private branch exchanges
• CPC Class Codes: H04Q 2213/13093 Personal computer, PC
• CPC Class Codes: H04Q 2213/13332 Broadband, CATV, dynamic bandwidth allocation

Abstract

Certain exemplary embodiments can comprise a method that can comprise automatically modifying a schedule of a transfer of a plurality of groups of units from a first system to a second system. The method can comprise performing one or more recursive neighborhood searches on the schedule. The schedule can be determined initially via iterative determinations of a next unit to be transferred as a unit with a relatively low determined value of an objective function.

Claims

1. A method comprising:

automatically modifying a feasible schedule of a transfer of a plurality of groups of telephone units from a first private branch exchange system to a second private branch exchange system, the modifying performed via at least one recursive neighborhood search, the at least one recursive neighborhood search performed on the feasible schedule, the transfer of each of the plurality of groups of telephone units scheduled during a corresponding time period of a plurality of predetermined time periods, the feasible schedule initially determined via iterative determinations of a next unit to be transferred as a unit with a lowest determined value of an objective function f(u)−

b(u),

where;

f(u)=Σ

<sub>v∈

Γ

, {u}</sub>w_u,v;

b(u)=Σ

<sub>v∈

V, Γ

, {u}</sub>w_u,v;

u is a unit;

v is a unit;

w_u,v is a transfer penalty associated with transferring unit u in a first predetermined time period from the plurality of predetermined time periods and transferring unit v in second predetermined time period from the plurality of predetermined time periods;

V is a set of all telephone units; and

Γ

is a set of units yet to be scheduled.

2. The method of claim 1, further comprising:

automatically obtaining the feasible schedule.

3. The method of claim 1, further comprising:

automatically determining the feasible schedule.

4. The method of claim 1, further comprising:

defining the plurality of time periods.

5. The method of claim 1, further comprising:

defining each penalty of the plurality of penalties.

6. The method of claim 1, wherein the at least one recursive neighborhood search comprises:

automatically determining a modified schedule of the transfer of the plurality of groups of telephone units from the first system to the second system, the determining of the modified schedule performed via a reduction in a lowest calculated total penalty of a plurality of sequentially calculated total penalties as a result of sequential swaps of a predetermined unit from a group associated with an assigned time period with each other unit of the plurality of groups of telephone units not assigned to the assigned time period.

7. The method of claim 1, wherein the at least one recursive neighborhood search comprises:

automatically determining a modified schedule of the transfer of the plurality of groups of telephone units from the first system to the second system, the determining of the modified schedule performed via a reduction in a lowest calculated total penalty of a plurality of sequentially calculated total penalties as a result of sequential swaps of a time period assignment of a first group of telephone units with time period assignments of each other group of telephone units of the plurality of groups of telephone units.

8. The method of claim 1, wherein the at least one recursive neighborhood search comprises:

automatically determining a modified schedule of the transfer of the plurality of groups of telephone units from the first system to the second system, the determining of the modified schedule performed via a reduction in a lowest calculated total penalty of a plurality of sequentially calculated total penalties as a result of sequential swaps of a predetermined unit from an assigned time period to any other available time period of the plurality of time periods.

9. The method of claim 1, further comprising:

defining each unit of the plurality of groups of telephone units.

10. The method of claim 1, further comprising:

defining a maximum number of telephone units assignable to each of the plurality of time periods.

11. The method of claim 1, further comprising:

identifying each of the plurality of groups.

12. The method of claim 1, further comprising:

terminating the at least one recursive neighborhood search after a predetermined count of recursive neighborhood searches.

13. The method of claim 1, further comprising:

terminating the at least one recursive neighborhood search when a calculated total penalty is below a predetermined threshold.

14. The method of claim 1, further comprising:

terminating the at least one recursive neighborhood search when a last recursive neighborhood search produces no improvement in a lowest calculated total penalty.

15. A machine-readable medium comprising machine instructions for activities comprising:

automatically modifying a feasible schedule of a transfer of a plurality of groups of units from a first system to a second system, the modifying performed via at least one recursive neighborhood search the at least one recursive neighborhood search performed on the feasible schedule, the transfer of each of the plurality of groups of units scheduled during a corresponding time period of a plurality of predetermined time periods, the feasible schedule initially determined via iterative determinations of a next unit to be transferred, the next unit randomly chosen unit from a plurality of identified units, the plurality of identified units each having a determined value below a predetermined threshold, the determined value obtained from of an objective function f(u)−

b(u),

where;

f(u)=Σ

<sub>v∈

Γ

, {u}</sub>w_u,v;

b(u)=Σ

<sub>v∈

V, Γ

, {u}</sub>w_u,v;

u is a unit;

v is a unit;

w_u,v is a transfer penalty associated with transferring unit u in a first predetermined time period from the plurality of predetermined time periods and transferring unit v in second predetermined time period from the plurality of predetermined time periods;

V is a set of all units; and

Γ

is a set of units yet to be scheduled.