Method, system and program product for filling job orders

• US 8,140,366 B2
• Filed: 10/02/2008
• Issued: 03/20/2012
• Est. Priority Date: 01/04/2008
• Status: Active Grant

• Current Assignee: Frontline Technologies Group LLC (Roper Technologies, Inc.)
• Original Assignee: FRONTLINE TECHNOLOGIES Incorporated
• Inventors: Adams, Greg, Lentz, Nathan, Julius, Ralph, Vilbert, Tom, Thompson, Roland
• Primary Examiner(s): Zeender, Ryan
• Assistant Examiner(s): ORTIZ ROMAN, DENISSE Y
• Application Number:
  US12/285,371
• Publication Number:
  US 20090177518A1
• Time in Patent Office: 1,265 Days
• Field of Search: None
• US Class Current: 705/7.12
• CPC Class Codes: G06Q 10/02 Reservations, e.g. for tickets, services or events
• CPC Class Codes: G06Q 10/025 Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
• CPC Class Codes: G06Q 10/0631 Resource planning, allocation, distributing or scheduling for enterprises or organisations
• CPC Class Codes: G06Q 10/06311 Scheduling, planning or task assignment for a person or group
• CPC Class Codes: G06Q 10/063112 Skill-based matching of a person or a group to a task
• CPC Class Codes: G06Q 10/06313 Resource planning in a project environment
• CPC Class Codes: G06Q 10/06314 Calendaring for a resource
• CPC Class Codes: G06Q 10/06316 Sequencing of tasks or work
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: G06Q 10/1053 Employment or hiring
• CPC Class Codes: G06Q 30/08 Auctions

Abstract

A method, system and program product are disclosed for filling job orders, the method comprising: creating electronically a respective commitment reservation for each of a plurality of workers, with each respective commitment reservation comprising a commitment for the respective worker to work on a prospective job not yet created, with the prospective job having one or more job parameters; receiving electronically a job order subsequent to the creation of one of the commitment reservations, the job order specifying a job with one or more job parameters; matching the job parameters of the job in the job order to the job parameters in one or more of the commitment reservations to obtain a reservation-job match; and, securing automatically based on the results of the matching step the job in the job order to one of the workers with a commitment reservation.

Claims

1. A method for filling job orders, comprising:

receiving or obtaining, using one or more computers, from each of a plurality of respective workers a request to make a commitment reservation, the commitment reservation comprising a commitment that is an obligation for the respective worker to work on a schedule specified by the respective worker on a prospective job not yet created, with the prospective job having one or more job parameters;

creating electronically, using the one or more computers, a respective commitment reservation for multiple of the respective workers based at least in part on the respective requests to make commitment reservations, each respective commitment reservation obligating the respective worker to work on a job created subsequent to the creation of the commitment reservation;

receiving or obtaining electronically, using the one or more computers, a job order subsequent to the creation of one of the commitment reservations, the job order specifying a job with one or more job parameters including a schedule for the job;

matching electronically, using the one or more computers, the job parameters including the schedule for the job in the job order to the job parameters including the schedules specified by the respective workers in one or more of the commitment reservations to obtain one or more reservation-job matches;

securing automatically, using the one or more computers, based at least in part on the results of the matching step and based at least in part on a priority algorithm the job in the job order to one of the workers with a commitment reservation.

2. The method as defined in claim 1, wherein the one or more predetermined parameters are selected from the group of position type, worksite, work shift, and date range and time range.

3. The method as defined in claim 1, further comprising:

receiving electronically data indicating that one of the workers did not work on the job secured for that worker; and

generating and sending electronically or making accessible electronically a report with the data that the worker did not work on the job secured for that worker.

4. The method as defined in claim 1, further comprising:

receiving electronically data indicating that one of the workers with a commitment reservation did not work on the job secured for that worker; and

preventing electronically, using the one or more computers, the creation of a commitment reservation for the one worker.

5. The method as defined in claim 1, wherein the commitment reservation can be made only by an administrator.

6. The method as defined in claim 1, wherein the commitment reservation can only be made after receiving an approval electronically from an administrator.

7. The method as defined in claim 1, further comprising preventing electronically, using the one or more computers, a number of commitment reservations for one of the jobs from exceeding a predetermined number.

8. The method as defined in claim 7, further comprising receiving electronically the predetermined number from or on behalf of a client business that is creating the jobs.

9. The method as defined in claim 1, further comprising preventing electronically, using the one or more computers, for one of the workers the creation of a commitment reservation with a time range parameter that overlaps with a time-off period for that one worker.

10. The method as defined in claim 1, further comprising preventing electronically, using the one or more computers, for one of the workers the creation of a commitment reservation with a time range parameter that overlaps a time range parameter for a commitment reservation for a different job previously created for that worker.

11. The method as defined in claim 1, wherein the priority algorithm is based at least in part on a worker characteristic.

12. The method as defined in claim 11, wherein the worker characteristic comprises one selected from the group of a worker with a commitment reservation having a fewest number of hours worked, and a worker with most seniority.

13. The method as defined in claim 1, further comprising:

creating automatically, using the one or more computers, a customized web page when one of the workers accesses a web site, the web page listing one or more commitment reservations associated with the worker accessing the web site; and

facilitating display of available jobs that do not completely overlap a time range for one or more of the commitment reservations of the worker accessing the web site.

14. The method as defined in claim 1, further comprising

determining that a number of commitment reservations for a job has exceeded a set number for that job;

and

taking an electronic action, using the one or more computers, to prevent the making of further commitment reservations for that job.

15. The method as defined in claim 1, further comprising creating electronically, using the one or more computers, for one of the workers a commitment reservation with a date and time range parameter only in a period designated as a willing to work period for that one worker.

16. The method as defined in claim 1, further comprising:

creating electronically, using the one or more computers, a plurality of uncommitted reservations for different prospective jobs with different job parameters for at least one worker, which uncommitted reservations are capable of overlapping in a time range;

determining, using the one or more computers, if a job has not been assigned to any commitment reservations; and

assigning the job that has not been assigned to a commitment reservation to the worker with the uncommitted reservation.

17. The method as defined in claim 1, further comprising:

creating electronically, using the one or more computers, an indication of interest of a worker for one or more different prospective jobs, with each different prospective job having one or more different job parameters, wherein the different prospective jobs have not yet been created; and

obtaining electronically, using the one or more computers, a job order, the job order specifying a job with one or more job order parameters;

matching, using the one or more computers, the job order parameters for the job in the job order to one or more of indications of interest for a job by a worker to obtain an interest-job match if the job has not been secured to a worker with a commitment reservation;

receiving a confirmation communication from the worker associated with the interest-job match; and

securing, using the one or more computers, the job to the worker with the interest-job match.

18. The method as defined in claim 1, wherein the priority algorithm is selected from the group of first come first serve, random, and minimizing worker overtime.

19. A method for filling job orders, comprising:

receiving or obtaining, using one or more computers, from each of a plurality of respective workers a request to make an uncommitted reservation, the uncommitted reservation to work on a schedule specified by the respective worker on a prospective job not yet created, with the prospective job having one or more job parameters, wherein at least one of the workers has a plurality of requests that overlap;

creating electronically a plurality of uncommitted reservations for different prospective jobs with different job parameters, including a plurality of uncommitted reservations for the at least one worker with uncommitted reservations that overlap in a time range, wherein the different prospective jobs have not yet been created;

receiving or obtaining electronically a job order with job parameters including a schedule for a job subsequent to the creation of the plurality of reservations for the one worker;

matching electronically, using the one or more computers, the job parameters for the job including the schedule for the job in the job order to one or more uncommitted reservations to obtain one or more uncommitted reservation-job matches;

securing automatically, using the one or more computers, to the one worker with the uncommitted reservations that overlap to fill the job based at least in part on the results of the matching step and based at least in part on a priority algorithm; and

preventing electronically, using the one or more computers, securing to the one worker with the uncommitted reservations that overlap one or more different jobs that overlap in the time range with the job that was secured.

20. The method as defined in claim 19, further comprising preventing electronically, using the one or more computers, the creation of an uncommitted reservation for one of the workers for one of the jobs having a time range parameter that overlaps a time-off period for that one worker.

21. The method as defined in claim 19, further comprising securing electronically, using the one or more computers, for one of the workers the job with a date and time range parameter only in a period designated as a willing to work period for that one worker.

22. The method as defined in claim 19, wherein a plurality of reservation-job matches are obtained, and comprising securing the job to a worker for one of the uncommitted reservation-job matches based on one or more preferences.

23. A system for filling job orders, comprising:

one or more computers programmed among them if more than one to perform the operations;

receiving or obtaining from each of a plurality of respective workers a request to make a commitment reservation, the commitment reservation comprising a commitment that is an obligation for the respective worker to work on a schedule specified by the respective worker on a prospective job not yet created, with the prospective job having one or more job parameters;

creating electronically a respective commitment reservation for multiple of the respective workers based at least in part on the respective requests to make commitment reservations, each respective commitment reservation obligating the respective worker to work on a job created subsequent to the creation of the commitment reservation;

receiving or obtaining electronically, using the one or more computers, a job order subsequent to the creation of one of the commitment reservations, the job order specifying a job with one or more job parameters including a schedule for the job;

matching, using the one or more computers, the job parameters including the schedule for the job in the job order to the job parameters including the schedules specified by the respective workers in one or more of the commitment reservations to obtain one or more reservation-job matches; and

securing automatically based at least in part on the results of the matching step and based at least in part on a priority algorithm the job in the job order to one of the workers with a commitment reservation.

24. The system as defined in claim 23, wherein the priority algorithm is selected from the group of first come first serve, random, and minimizing worker overtime.

25. A program product for filling job orders, comprising:

one or more computer readable storage media, comprising among them if more than one, program code for causing a computer, when executed, to perform the following steps;

receiving or obtaining, using one or more computers, from each of a plurality of respective workers a request to make a commitment reservation, the commitment reservation comprising a commitment that is an obligation for the respective worker to work on a schedule specified by the respective worker on a prospective job not yet created, with the prospective job having one or more job parameters;

creating electronically a respective commitment reservation, using the one or more computers, for multiple of the respective workers, based at least in part on the respective requests to make commitment reservations, each respective commitment reservation obligating the respective worker to work on a job created subsequent to the creation of the commitment reservation;

receiving or obtaining electronically, using the one or more computers, a job order subsequent to the creation of one of the commitment reservations, the job order specifying a job with one or more job parameters including a schedule for the job;

matching, using the one or more computers, the job parameters including the schedule for the job in the job order to the job parameters including the schedules specified by the respective workers in one or more of the commitment reservations to obtain one or more reservation-job matches;

securing automatically, using the one or more computers, based at least in part on the results of the matching step and based at least in part on a priority algorithm the job in the job order to one of the workers with a commitment reservation.

26. A system for filling job orders, comprising:

one or more computers programmed among them if more than one to perform the operations;

receiving or obtaining, using one or more computers, from each of a plurality of respective workers a request to make an uncommitted reservation, the uncommitted reservation to work on a schedule specified by the respective worker on a prospective job not yet created, with the prospective job having one or more job parameters, wherein at least one of the workers has a plurality of requests that overlap;

creating electronically a plurality of uncommitted reservations for different prospective jobs with different job parameters, including a plurality of uncommitted reservations for the at least one worker with uncommitted reservations that overlap in a time range, wherein the different prospective jobs have not yet been created;

receiving or obtaining electronically a job order with job parameters including a schedule for a job subsequent to the creation of the plurality of uncommitted reservations for the one worker;

matching, using the one or more computers, the job parameters including the schedule for the job in the job order to one or more uncommitted reservations to obtain one or more uncommitted reservation-job matches;

securing automatically, using the one or more computers, to the one worker with the uncommitted reservations that overlap to fill the job based at least in part on the results of the matching step and based at least in part on a priority algorithm; and

preventing electronically, using the one or more computers, securing to the one worker with the uncommitted reservations that overlap one or more different jobs that overlap in the time range with the job that was secured.