ALLOCATION OF FLIGHT LEGS TO DISPATCHER POSITIONS

• US 20130211702A1
• Filed: 02/15/2012
• Published: 08/15/2013
• Est. Priority Date: 02/15/2012
• Status: Active Grant

• Current Assignee: Ent Services Development Corporation LP (DXC Technology Company)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Santos, Cipriano A., Sanchez, Ivan Adrian Lopez, Zhang, Xin, Herrick, Glenn W., Raper, Mark D.
• Granted Patent: US 8,626,429 B2
• Time in Patent Office: Days
• US Class Current: 701/120
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling

Abstract

A method includes receiving flight leg data and dispatcher position data for a planning horizon and identifying cycle flight legs and extraordinary flight legs based on the flight leg data. The method includes allocating each cycle flight leg to at least one dispatcher position while minimizing workload deviations between the dispatcher positions. The method includes allocating, after allocating each cycle flight leg, each extraordinary flight leg to at least one dispatcher position while minimizing workload deviations between the dispatcher positions.

Claims

1. A method comprising:

receiving, via a processing system, flight leg data and dispatcher position data for a planning horizon;

identifying, via the processing system, cycle flight legs and extraordinary flight legs based on the flight leg data;

allocating, via the processing system, each cycle flight leg to at least one dispatcher position while minimizing workload deviations between the dispatcher positions; and

allocating, via the processing system and after allocating each cycle flight leg, each extraordinary flight leg to at least one dispatcher position while minimizing workload deviations between the dispatcher positions.

2. The method of claim 1, wherein allocating each cycle flight leg comprises solving a first series of mixed integer programming problems for the cycle flight legs, and

wherein allocating each extraordinary flight leg comprises solving a second series of mixed integer programming problems for the extraordinary flight legs.

3. The method of claim 1, wherein allocating each cycle flight leg comprises minimizing the number of dispatcher positions allocated to each cycle flight leg while allocating no more than three dispatcher positions to each cycle flight leg, and

wherein allocating each extraordinary flight leg comprises minimizing the number of dispatcher positions allocated to each extraordinary flight leg while allocating no more than three dispatcher positions to each extraordinary flight leg.

4. The method of claim 1, further comprising:

aggregating, via the processing system, the cycle flight legs that repeat on the same day of each week of the planning horizon prior to allocating each cycle flight leg.

5. A method for distributing workload to dispatcher positions, the method comprising:

receiving, via a processing system, a plurality of flight leg attributes for each flight leg within a planning horizon, each flight leg having effort to be assigned;

receiving, via the processing system, a plurality of position attributes for each position available to be assigned effort within the planning horizon;

aggregating, via the processing system, flight legs within the planning horizon that repeat during the planning horizon into a meta-period;

assigning, via the processing system, effort of the aggregated flight legs within the meta-period to positions within the meta-period;

deaggregating, via the processing system, the assigned effort of the aggregated flight legs within the meta-period to the respective positions throughout the planning horizon; and

assigning, via the processing system, effort of flight legs within the planning horizon that do not repeat during the planning horizon to the positions.

6. The method of claim 5, wherein assigning effort of the aggregated flight legs within the meta-period to positions within the meta-period comprises minimizing a workload deviation between all positions assigned effort at each hour of each day.

7. The method of claim 5, wherein assigning effort of the aggregated flight legs within the meta-period to positions within the meta-period comprises minimizing a number of positions assigned to each flight leg.

8. The method of claim 5, wherein assigning effort of the aggregated flight legs within the meta-period to positions within the meta-period comprises maximizing the consistency of the assignments of repeated flight legs to each position.

9. The method of claim 5, wherein each flight leg has a pre-flight period and an in-flight period, and

wherein assigning effort of the aggregated flight legs within the meta-period to positions within the meta-period comprises assigning, for each flight leg, the pre-flight period to one position and the in-flight period to a maximum of two positions.

10. A system comprising:

a processor; and

a memory communicatively coupled to the processor, the memory storing instructions causing the processor, after execution of the instructions by the processor, to;

receive flight leg data for each flight leg within a planning horizon,

receive position data for each position available to be assigned flight legs within the planning horizon;

fold flight legs within the planning horizon that repeat during the planning horizon into a meta-week;

allocate each flight leg within the meta-week to at least one position within the meta-week;

unfold the allocated flight legs within the meta-week to the respective positions throughout the planning horizon; and

allocate flight legs within the planning horizon that do not repeat during the planning horizon to at least one position within the planning horizon.

11. The system of claim 10, wherein the memory stores instructions causing the processor, after execution of the instructions by the processor, to assign each flight leg within the meta-week to at least one position within the meta-week by:

ordering the flight legs within the meta-week from higher repetition to lower repetition; and

allocating the flight legs to positions in order from higher repetition to lower repetition.

12. The system of claim 10, wherein the memory stores instructions causing the processor, after execution of the instructions by the processor, to allocate flight legs within the planning horizon that do not repeat during the planning horizon by:

ordering the flight legs from longer duration to shorter duration; and

allocating the flight legs to positions in order from longer duration to shorter duration.

13. The system of claim 10, wherein the memory stores instructions causing the processor, after execution of the instructions by the processor, to further:

pre-assign a specified flight leg to a specified position prior to assigning each flight leg within the meta-week to at least one position within the meta-week.

14. The system of claim 10, wherein the memory stores instructions causing the processor, after execution of the instructions by the processor, to assign each flight leg within the meta-week to at least one position within the meta-week by:

generating input files for a mixed integer programming problem for the flight legs within the meta-week, and

solving the mixed integer programming problem using the input files.

15. The system of claim 10, wherein each position may be over utilized up to a specified number of minutes.