System and method for preference scheduling of staffing resources

• US 20050004828A1
• Filed: 05/25/2004
• Published: 01/06/2005
• Est. Priority Date: 05/27/2003
• Status: Abandoned Application

• Current Assignee: Planmatics, Inc.
• Original Assignee: Planmatics, Inc.
• Inventors: Carignan, Robert, Ozdemir, Songul, deSilva, Anura H., Yakimovich, Daniil, Jayawardena, Sonali N., Karabulut, Galip M., Bard, Jonathan F., Sharma, Abhinav, Purnomo, Hadi W.
• Application Number:
  US10/852,435
• Publication Number:
  US 20050004828A1
• Time in Patent Office: Days
• US Class Current: 705/9
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/063112 Skill-based matching of a person or a group to a task
• CPC Class Codes: G06Q 10/063116 Schedule adjustment for a person or group
• CPC Class Codes: G06Q 10/06375 Prediction of business process outcome or impact based on a proposed change

Abstract

The invention provides a system and method for scheduling resources. In one respect, embodiments of the invention allow workers to indicate preferences for specific shifts during a planning horizon, within limitations imposed by the scheduling system. Embodiments of the system and method seek to meet all hard constraints, and utilize a flexible scoring technique to minimize the violation of soft constraints. Embodiments also consider the substitution of higher skilled workers in cases where there is an unmet demand for lower skilled workers.

Claims

1. A method for scheduling a plurality of staff, comprising:

receiving scheduling constraints;

preparing an initial schedule based on the scheduling constraints, the preparing based on a resource preference of at least one of the plurality of staff;

receiving scheduling strategies, the scheduling strategies being selectively input; and

optimizing the initial schedule based on the received scheduling strategies to produce an optimized schedule.

2. The method of claim 1, the preparing including:

reading an identification of the at least one of the plurality of staff;

providing a menu of eligible scheduling periods based on the identification; and

receiving a selection from the at least one of the plurality of staff based on the menu of eligible scheduling periods.

3. The method of claim 2, the preparing further including:

determining a plurality of residual gaps associating penalty scores with each of the plurality of residual gaps; and

scheduling the plurality of staff based on the penalty scores.

4. The method of claim 3, wherein the associating is based on a degree of violation of a predetermined rule and a point value associated with the degree of violation.

5. The method of claim 1, further comprising editing the optimized schedule, editing including offering a shift swap in a private message.

6. A method for scheduling a plurality of staff, comprising:

preparing a staff schedule for a first time horizon; and

optimizing the staff schedule for a second time horizon, the second time horizon being shorter than the first time horizon, the optimizing being based on a cost parameter.

7. The method of claim 6, the first time horizon being at least a day, the second time horizon being a single shift.

8. The method of claim 6, the cost parameter being at least one of a dissatisfaction cost and a monetary cost, the dissatisfaction cost based on disruption to a schedule of at least one of the plurality of staff, the monetary cost based on labor expenses.

9. The method of claim 6, the dissatisfaction cost based on a plurality of types of dissatisfaction, each of the plurality of types of dissatisfaction being associated with a level of dissatisfaction.

10. A method for optimizing a staffing schedule, comprising:

selecting a first resource type in the staffing schedule;

generating a first alternative schedule for the first resource type;

determining whether the first alternative schedule for the first resource type meets a predetermined plurality of hard constraints; and

if the first alternative schedule for the first resource type meets the predetermined plurality of hard constraints, calculating a first penalty score based on a first deviation from a plurality of soft constraints, the plurality of hard constraints being mandatory scheduling criteria, the plurality of soft constraints being optional scheduling criteria.

11. The method of claim 10, further comprising:

generating a second alternative schedule for the first resource type;

determining whether the second alternative schedule for the first resource type meets the predetermined plurality of hard constraints; and

if the second alternative schedule for the first resource type meets the predetermined plurality of hard constraints, calculating a second penalty score based on a second deviation from the plurality of soft constraints.

12. The method of claim 11, further comprising:

selecting a second resource type in the schedule.

13. A method for producing a staff schedule, comprising:

identifying a first staff schedule, the first staff schedule being a candidate to swap with a second staff schedule, the first staff schedule being associated with a first staff person, the second staff schedule being associated with a second staff person, the first staff schedule and the second staff schedule being portions of the staff schedule;

sending a private message from the first staff person to the second staff person offering a swap between at least a portion of the first staff schedule and at least a portion of the second staff schedule; and

updating the staff schedule based on the private message.

14. The method of claim 13, further comprising:

determining whether a response was generated by the second staff person based on the private message;

if the response was generated, determining whether the response was an acceptance;

if the response was an acceptance, sending the response to a manager for approval; and

if the response was not an acceptance, sending a rejection message to the first staff person.

15. The method of claim 14, further comprising:

if the response was an acceptance, deciding whether to approve the acceptance, the deciding resulting in one of an approval and a denial;

if the deciding results in an approval, sending an approval message to the first staff person and the second staff person; and

if the deciding results in a denial, sending a denial message to at least the the second staff person.

16. A method for suggesting staffing changes, comprising:

calculating at least one of overstaffing and understaffing for a shift;

specifying at least one of a modification limit and an addition limit, the modification limit based on at least one of a skill type and a shift pattern, the addition limit based on a quantity of staff that can be one of added and reduced; and

determining whether the modification limit is zero.

17. The method of claim 16, further comprising, if the modification limit is not zero, running a modification algorithm, the modification algorithm suggesting changes to at least one of the skill type and shift pattern for at least one staff person.

18. The method of claim 17, further comprising:

determining whether the addition limit is zero; and

if the addition limit is not zero, running an addition algorithm, the modification algorithm suggesting at least one of the addition or reduction of staff.

19. A machine-readable medium having instructions stored thereon for execution by a processor to perform a method comprising:

receiving scheduling constraints;

preparing an initial schedule based on the scheduling constraints, the preparing based on a resource preference of at least one of the plurality of staff;

receiving scheduling strategies, the scheduling strategies being selectively input; and

optimizing the initial schedule based on the received scheduling strategies to produce an optimized schedule.

20. A machine-readable medium having instructions stored thereon for execution by a processor to perform a method comprising:

preparing a staff schedule for a first time horizon; and

optimizing the staff schedule for a second time horizon, the second time horizon being shorter than the first time horizon, the optimizing being based on a cost parameter.

21. A machine-readable medium having instructions stored thereon for execution by a processor to perform a method comprising:

selecting a first resource type in the staffing schedule;

generating a first alternative schedule for the first resource type;

determining whether the first alternative schedule for the first resource type meets a predetermined plurality of hard constraints; and

if the first alternative schedule for the first resource type meets the predetermined plurality of hard constraints, calculating a first penalty score based on a first deviation from a plurality of soft constraints, the plurality of hard constraints being mandatory scheduling criteria, the plurality of soft constraints being optional scheduling criteria.

22. A machine-readable medium having instructions stored thereon for execution by a processor to perform a method comprising:

identifying a first staff schedule, the first staff schedule being a candidate to swap with a second staff schedule, the first staff schedule being associated with a first staff person, the second staff schedule being associated with a second staff person;

sending a private message from the first staff person to the second staff person offering a swap between at least a portion of the first staff schedule and at least a portion of the second staff schedule; and

editing the staffing schedule based on the private message.

23. A machine-readable medium having instructions stored thereon for execution by a processor to perform a method comprising:

calculating at least one of overstaffing and understaffing for a shift;

specifying at least one of a modification limit and an addition limit, the modification limit based on at least one of a skill type and a shift pattern, the addition limit based on a quantity of staff that can be one of added and reduced; and

determining whether the modification limit is zero.