IP Library Patent Application 15201850
Patent Application
App. No. 15/201,850

WORKER VENTURING COEFFICENT FOR WORKFORCE ROUTING

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
15/201,850
Filed
Jul 5, 2016
Art Unit
3624
USPC
705/7.17
Abstract

A method for generating workforce street level routing is provided. The method includes ranking each job within a set of jobs available for assignment at times of day to a worker and producing a street level routing assignment schedule including a sequence of jobs assigned to the worker in which each of the sequence of jobs corresponds to a highest ranked job within the set of jobs available for assignment to the worker at each particular time of day during a work-shift. The ranking step includes creating a coefficient representing an appeal for venturing or homing of the worker at each particular time of day during the work-shift, developing a score from a plurality of factors for each job within the set of jobs at each particular time of day, and using the coefficient representing the appeal for venturing or homing to produce at least one of the factors.

Claims (32)

1 . A method for generating workforce street level routing, comprising the steps of:

ranking each job within a set of jobs available for assignment at times of day to a worker of a workforce; and

producing a street level routing assignment schedule including a sequence of jobs assigned to the worker in which each of the sequence of jobs corresponds to a highest ranked job within the set of jobs available for assignment to the worker at each particular time of day during a work-shift;

wherein said ranking step includes creating a coefficient representing an appeal for venturing or homing of the worker at each particular time of day during the work-shift, developing a score from a plurality of factors for each job within the set of jobs at each particular time of day, and using the coefficient representing the appeal for venturing or homing to produce at least one of said plurality of factors; and

wherein the plurality of factors includes at least one of travel distance to a job location and estimated travel time to a job location.

2 . The method according to claim 1 , wherein said creating step includes representing the appeal for venturing or homing with a mathematical function that produces values corresponding to times of day the appeal of the worker is for venturing further from a shift starting or ending location of the worker and values corresponding to times of day the appeal of the worker is for homing closer to the shift starting or ending location of the worker, and wherein the values for venturing are distinguishable from the values for homing.

3 . The method according to claim 2 , wherein variables in the mathematical function include time elapsed within a shift of the specific worker and a full length of the shift.

4 . The method according to claim 3 , wherein the variables include a value equal to a difference of: i.) a distance from a current location of the worker to the shift ending location of the worker; and ii.) a distance from a next job location of the worker to the shift ending location.

5 . The method according to claim 3 , wherein the variables include a value equal to a difference of: an estimated travel time from a current location of the worker to the shift ending location of the worker; and ii) an estimated travel time from a next job location of the worker to the shift ending location.

6 . The method according to claim 2 , wherein the mathematical function includes a sine function.

7 . The method according to claim 6 , wherein the mathematical function includes the following formula: f(t)=sin(2πt/l), where “t” is time elapsed within the work-shift of the worker and “l” is a full length of the shift.

8 . The method according to claim 1 , wherein at least one of said plurality of factors is computed using the following formula: f(t,d)=(sin(2πt/l))(d), where “t” is time elapsed within a work-shift of the worker, “l” is a full length of the work-shift, and “d” is a difference in at least one of distance and estimated travel time as determined from a current location of the worker to a shift ending location of the worker relative to a next job location of the worker to the shift ending location.

9 . The method according to claim 2 , wherein the mathematical function produces values corresponding to an appeal for venturing during a first half of the work-shift of the worker and values corresponding to an appeal for homing during a second half of the work-shift of the worker.

10 . The method according to claim 2 , wherein the mathematical function produces values neutral to the appeals for venturing and homing during anticipated rush hour traffic conditions during the work-shift of the worker.

11 . The method according to claim 1 , further comprising the step of quantifying the appeal for venturing or homing between minimum and maximum values to produce the coefficient.

12 . A system for generating workforce street level routing, comprising:

at least one processor configured to rank each job within a set of jobs available for assignment at times of day to a worker of a workforce, such that said at least one processor is configured to create a coefficient representing an appeal for venturing or homing of the worker at each particular time of day during the work-shift, to develop a score from a plurality of factors for each job within the set of jobs at each particular time of day, and to use the coefficient representing the appeal for venturing or homing to produce at least one of said plurality of factors, wherein the plurality of factors includes at least one of travel distance to a job location and estimated travel time to a job location; and

said at least one processor configured to produce a street level routing assignment schedule including a sequence of jobs assigned to the worker in which each of the sequence of jobs corresponds to a highest ranked job within the set of jobs available for assignment to the worker at each particular time of day during a work-shift.

13 . The system according to claim 12 , wherein said at least one processor is configured to represent the appeal for venturing or homing with a mathematical function that produces values corresponding to times of day the appeal of the worker is for venturing further from a shift starting or ending location of the worker and values corresponding to times of day the appeal of the worker is for homing closer to the shift starting or ending location of the worker, and wherein the values for venturing are distinguishable from the values for homing.

14 . The system according to claim 13 , wherein variables in the mathematical function include time elapsed within a shift of the specific worker and a full length of the shift.

15 . The system according to claim 14 , wherein the variables include a value equal to a difference of: i.) a distance from a current location of the worker to the shift ending location of the worker; and ii.) a distance from a next job location of the worker to the shift ending location.

16 . The system according to claim 14 , wherein the variables include a value equal to a difference of: an estimated travel time from a current location of the worker to the shift ending location of the worker; and ii) an estimated travel time from a next job location of the worker to the shift ending location.

17 . The system according to claim 13 , wherein the mathematical function includes a sine function.

18 . The system according to claim 13 , wherein the mathematical function includes the following formula: f(t)=sin(2πt/l), where “t” is time elapsed within the work-shift of the worker and “l” is a full length of the shift.

19 . The system according to claim 12 , wherein at least one of said plurality of factors is computed using the following formula: f(t,d)=(sin(2πt/l))(d), where “t” is time elapsed within a work-shift of the worker, “l” is a full length of the work-shift, and “d” is a difference in at least one of distance and estimated travel time as determined from a current location of the worker to a shift ending location of the worker relative to a next job location of the worker to the shift ending location.

20 . The system according to claim 13 , wherein the mathematical function produces values corresponding to an appeal for venturing during a first half of the work-shift of the worker and values corresponding to an appeal for homing during a second half of the work-shift of the worker.

21 . The system according to claim 13 , wherein the mathematical function produces values neutral to the appeals for venturing and homing during anticipated rush hour traffic conditions during the work-shift of the worker.

22 . A non-transitory computer-readable storage medium comprising stored instructions which, when executed by one or more computer processors, cause the one or more computer processors to perform steps of:

ranking each job within a set of jobs available for assignment at times of day to a worker of a workforce; and

producing a street level routing assignment schedule including a sequence of jobs assigned to the worker in which each of the sequence of jobs corresponds to a highest ranked job within the set of jobs available for assignment to the worker at each particular time of day during a work-shift;

wherein said ranking step includes creating a coefficient representing an appeal for venturing or homing of the worker at each particular time of day during the work-shift, developing a score from a plurality of factors for each job within the set of jobs at each particular time of day, and using the coefficient representing the appeal for venturing or homing to produce at least one of said plurality of factors; and

wherein the plurality of factors includes at least one of travel distance to a job location and estimated travel time to a job location.

Assignments (8)
RELEASE OF SECURITY INTEREST AT REEL/FRAME 049905/0504 Recorded Dec 19, 2024
From: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
To: ARRIS ENTERPRISES LLC (F/K/A ARRIS ENTERPRISES, INC.); ARRIS TECHNOLOGY, INC.; ARRIS SOLUTIONS, INC.; COMMSCOPE, INC. OF NORTH CAROLINA; COMMSCOPE TECHNOLOGIES LLC; RUCKUS WIRELESS, LLC (F/K/A RUCKUS WIRELESS, INC.)
Reel/Frame 071477/0255 →
SECURITY INTEREST Recorded Nov 19, 2021
From: ARRIS SOLUTIONS, INC.; ARRIS ENTERPRISES LLC; COMMSCOPE TECHNOLOGIES LLC; COMMSCOPE, INC. OF NORTH CAROLINA; RUCKUS WIRELESS, INC.
To: WILMINGTON TRUST
Reel/Frame 060752/0001 →
TERM LOAN SECURITY AGREEMENT Recorded Jul 3, 2019
From: COMMSCOPE, INC. OF NORTH CAROLINA; COMMSCOPE TECHNOLOGIES LLC; ARRIS ENTERPRISES LLC; ARRIS TECHNOLOGY, INC.; RUCKUS WIRELESS, INC.; ARRIS SOLUTIONS, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 049905/0504 →
PATENT SECURITY AGREEMENT Recorded Jul 3, 2019
From: ARRIS ENTERPRISES LLC
To: WILMINGTON TRUST, NATIONAL ASSOCIATION, AS COLLATERAL AGENT
Reel/Frame 049820/0495 →
ABL SECURITY AGREEMENT Recorded Jul 3, 2019
From: COMMSCOPE, INC. OF NORTH CAROLINA; COMMSCOPE TECHNOLOGIES LLC; ARRIS ENTERPRISES LLC; ARRIS TECHNOLOGY, INC.; RUCKUS WIRELESS, INC.; ARRIS SOLUTIONS, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 049892/0396 →
CHANGE OF NAME Recorded Jun 25, 2019
From: ARRIS ENTERPRISES, INC.
To: ARRIS ENTERPRISES LLC
Reel/Frame 049586/0470 →
CHANGE OF NAME Recorded Mar 14, 2017
From: ARRIS ENTERPRISES INC
To: ARRIS ENTERPRISES LLC
Reel/Frame 041995/0031 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 28, 2016
From: THOMPSON, STUART
To: ARRIS ENTERPRISES LLC
Reel/Frame 039280/0869 →