Systems and methods for automatic scheduling of a workforce

Information

  • Patent Grant
  • 7672746
  • Patent Number
    7,672,746
  • Date Filed
    Friday, March 31, 2006
    18 years ago
  • Date Issued
    Tuesday, March 2, 2010
    14 years ago
Abstract
Systems and methods are disclosed for scheduling overtime and time-off for a workforce. In one embodiment, the method comprises: receiving a workforce schedule including assignments of workers to shifts; receiving a template describing alterations to shifts; and applying schedulable objects to the workforce schedule in accordance with a workload forecast and schedule constraints. In one embodiment, the system comprises: a user interface and a scheduler. The user interface allows creation of shift alteration templates and associating templates with workers. The scheduler uses the shift alteration templates to modify an existing schedule of assignments of workers to shifts.
Description
FIELD OF THE DISCLOSURE

The present disclosure relates to contact centers, and more specifically, to automatic scheduling of a workforce.


BACKGROUND

A manager in a contact center (also known as a call center) typically uses workforce scheduling software to create a schedule which assigns workers (agents) to shifts throughout the workday. The scheduler chooses an optimal schedule that meets constraints while optimizing goals. Inputs such as predicted workload (e.g., call volume in 15-minute intervals, average call duration) and work rules (e.g., maximum shift length, possible shift start time, break requirements) are treated as constraints. Inputs such as expected level of service (e.g., call hold time) are treated as goals. The scheduler generates many possible schedules, and examines the possibilities to find a schedule that optimizes goals while remaining within the constraint boundaries.


In general, existing workforce schedulers accurately schedule an appropriate number of agents to handle the expected workload during each time interval. It is common, however, for workload and/or agent availability to vary from predicted values once a workday has begun. To keep the contact center running at peak performance, the schedule should then be adjusted, by giving some agents overtime or giving some agents time off. Existing schedulers do not support automatically scheduling of overtime or time-off after a schedule has been created and the day has started. Therefore, a contact center manager typically responds by manually creating overtime or time-off events, through which a particular shift for a particular agent is extended or truncated. The process by which a manager manually determines which agents should be assigned overtime or time-off, and where the overtime or time-off should be placed on a schedule, can be time-consuming, tedious, and difficult.


SUMMARY OF THE INVENTION

Systems and methods are disclosed for scheduling a workforce. In one embodiment, the method comprises: receiving a workforce schedule including assignments of workers to shifts; receiving a template describing alterations to shifts; and applying schedulable objects to the workforce schedule in accordance with a workload forecast and schedule constraints. In one embodiment, the system comprises: a user interface and a scheduler. The user interface allows creation of shift alteration templates and associating templates with workers. The scheduler uses the shift alteration templates to modify an existing schedule of assignments of workers to shifts.





BRIEF DESCRIPTION OF THE DRAWINGS

Many aspects of the disclosure can be better understood with reference to the following drawings. The components in the drawings are not necessarily to scale, emphasis instead being placed upon clearly illustrating the principles of the present disclosure.



FIG. 1 is a block diagram of a representative contact center environment, in which an embodiment of a system and/or method for automatic scheduling of a workforce can be implemented.



FIG. 2 is a dataflow diagram showing one embodiment of a system for automatic scheduling of a workforce.



FIG. 3A is a block diagram showing one representation of an overtime (OT) template from FIG. 2.



FIG. 3B is a block diagram showing one representation of a voluntary time-off (VTO) template from FIG. 2.



FIG. 4 is a flowchart for one embodiment of a method for automatic scheduling of a workforce.



FIG. 5 shows a set of entities, and the interrelationships between them, used by one embodiment of a scheduler that includes automatic scheduling of a workforce.



FIG. 6 is a flowchart for one embodiment of a scheduler that includes automatic scheduling of a workforce.



FIGS. 7A-7D illustrate an example scenario in which a scheduler automatically schedules overtime and time-off for a workforce.



FIG. 8 is a hardware block diagram of a general-purpose computer which can be used to implement systems and methods for automatic scheduling of a workforce.





DETAILED DESCRIPTION


FIG. 1 is a block diagram of a contact center environment 100. contact center 100 is staffed by agents who handle incoming and/or outgoing contacts. Although the traditional and most common form of contact is by phone, other types of contacts can be used, such as text chat, web collaboration, email, and fax. An agent workspace includes an agent phone 110 and a workstation computer 120. A network 130 connects one or more of the workstations 120.


A contact router 140 distributes or routes contacts (incoming or outgoing) to an agent position. Voice over Internet Protocol (VoIP) calls and computer-based contacts (e.g., chat, email) are routed over one or more data networks, and distributed over network 130 to one of the agent workstations 120. Contact router 140 may include an automatic call distributor (ACD) 150 to route phone contacts. The embodiments described herein will refer to ACD 150 instead of contact router 140, but analogous contact router actions and operations are intended to be captured by this disclosure. Note that a predictive dialer (not shown) could be used for directing outbound calls to agents for handling.


If an agent is not available to handle a particular call, ACD 150 puts the call into a queue, which effectively places the caller on hold. When an agent is available, ACD 150 connects the outside trunk line 160 carrying the phone call to one of the agents. More specifically, ACD 150 connects the outside trunk line 160 to the trunk line 170 of the selected agent.


When an agent is ready to handle contacts, the agent first logs into ACD 150. This login notifies ACD 150 that the agent is available to take calls. An agent's ACD state changes throughout the workday, as the agent performs work activities such as handling calls, performing after-call work, and taking breaks. An example list of states includes available, busy, after-call work, and unavailable.


While handling a contact, the agent interacts with one or more applications running on workstation 120. By way of example, workstation applications could provide the agent with access to customer records, product information, ordering status, and transaction history. The applications may access one or more business databases (not shown) via the network 130.


Call center 100 also includes a work force management system (WFMS) 180. WFMS 180 performs many functions. One such function is providing a contact center supervisor or manager with information about agents and contacts, both historical and real-time. Another function is supplying the supervisor with information on how well each agent complies with contact center policies. Yet another function is calculating staffing levels and creating agent schedules based on historical patterns of incoming contacts. The functionality of the entire work force management system (WFMS) 180 is typically divided among several applications, some of which have a user interface component, and WFMS 180 comprises the suite of applications.


In the environment described above, the workers assigned to shifts are contact center agents. However, the scheduling methods and systems described herein are also applicable to scheduling other kinds of workers in other types of work environments. Therefore, the remaining embodiments will refer to workers rather than agents.



FIG. 2 is a dataflow diagram showing one embodiment of a system (200) for automatic scheduling of a workforce. A user interacts with a template user interface component 210 of WFMS 180 to define one or more schedule alteration templates 220. These schedule alteration templates 220 define ways in which a schedule can be altered. A user also interacts with a work-rule user interface component 230 to define work rules such as maximum shift length, shift start times, and break requirements. Although shown as two separate components in FIG. 2, in another embodiment the template user interface 210 and work-rule interface 230 are combined into a single user interface.


Two different types of templates can be created in the embodiment in FIG. 2. Voluntary time-off (VTO) templates 220V describe an alteration that truncates an already-scheduled shift and adds a new time-off activity located adjacent to that shift. Overtime (OT) templates 2200 describe an alteration that extends an already-scheduled shift to include a new work activity, where the extension may allow a gap between the original shift and the overtime.


Schedule alteration templates 220 are provided as input to a scheduler component 240, along with an existing schedule 250. Scheduler 260 produces an updated schedule 270 that attempts to optimize goals 280 while meeting a workload forecast 290 and a set of work-rule constraints 2100.



FIG. 3A is a block diagram showing one representation of an overtime (OT) template 2200. An OT template 2200 is one type of schedule alteration template 220, through which a user defines ways in which a workday shift can be altered. OT template 2200 includes the following attributes: an activity 310; a duration 320; an action 330; a placement 340; and a gap 350. Activity 310 represents the expected work activity to be performed during the overtime. Typical examples include phone, email, and fax, but this field can be any work activity. Duration 320 represents the duration of the overtime shift. In one embodiment, duration 320 is a range, indicating a minimum and a maximum value for the duration. For overtime, action 330 is set to Extend, since overtime extends an existing shift. Placement 340 refers to where the overtime is placed on the schedule relative to the existing shift: BeginnningOfShift, EndOfShift, or Either. Finally, gap 350 allows time between the existing shift and the overtime. A special value, such as zero, indicates that the overtime occurs next to the existing shift, with no gap. In one embodiment, gap 350 is a range, indicating a minimum and a maximum value for the gap.



FIG. 3B is a block diagram showing one representation of a voluntary time-off (VTO) template 220V. VTO template 220V is another type of schedule alteration template 220, through which a user defines ways in which a workday shift can be altered. VTO template 220V includes an activity 360; a duration 370; an action 380; and a placement 390. Activity 360 is set to VoluntaryTimeOff since the worker is not performing a work activity. Duration 370 represents the duration of the time off. In one embodiment, duration 370 is a range, indicating a minimum and a maximum value for the duration. Action 380 is set to Truncate, since time-off truncates an existing shift. Placement 390 refers to where the time-off activity is placed relative to the existing shift: BeginnningOfShift, EndOfShift, or Either.



FIG. 4 is a flowchart for one embodiment of a method (400) for automatic scheduling of a workforce. At block 410, one or more schedule alteration templates (220) are received. Next (block 420), an association between workers and templates 220 is received. At block 430, worker-specific VTO/OT scheduling options are received. In one embodiment, these worker-specific scheduling options include: maximum OT/VTO per day and/or per week; OT Before/After Shift preferences (e.g., Prefer, Don't Want, Any); and VTO Start Of/End Of Shift preferences (e.g. Prefer, Don't Want, Any). Block 430 is optional, but if present is repeated for each worker that is associated with a schedule alteration template 220.


Processing then continues at block 440, where a selection of an existing schedule 250 is received. Next (block 450), options specific to the selected schedule are received. In one embodiment, these schedule-specific options include: maximum OT/VTO per day and/or per week; Add OT Placement (Before/After shift); and Add VTO Placement (Start Of/End Of shift). Block 450 is optional. At block 460, an updated schedule 270 is produced based on the received templates 220 and options (if present). Updated schedule 270 is produced in accordance with constraints 2100 and goals 280. As will be described in further detail in connection with FIGS. 5, 6, and 7A-D, updated schedule 270 is calculated by generating schedulable objects (FIG. 5) and then applying the objects to existing schedule 250.



FIG. 5 shows a set of entities, and the interrelationships between them, used by one embodiment of a scheduler 260 that supports automatic scheduling of a workforce. Schedule alteration templates 220 were discussed earlier in connection with FIG. 3. As stated earlier, each schedule alteration template 220 is associated with one or more workers 510. Each worker 510 is also associated with a shift 520, where a shift 520 is described by a time range and a day (530). As can be seen in FIG. 5, worker 510 can have more than one shift 520, and a time range-day 530 can be associated with more than one shift 520 (e.g., different workers). However, a particular shift 520 is specific to worker and to a time range-day (e.g. a shift representing “John Doe on Monday 9 AM-5 PM.”).


A schedule alteration template 220 describes possible alterations to any already-scheduled shift 520, but is not associated with any particular shift 520. Scheduler 260 creates one or more schedulable objects 540 based on each schedule alteration template 220, such that attributes in a schedulable object 540 are initialized from corresponding attributes in the template 220. Each schedulable object 540 is associated with a shift 520, and represents a possible change in the schedule adjacent to that shift 520.


Scheduler 260 also creates a set, or domain, of bindings 550 for each shift 520. A binding represents a time slot in, or adjacent to, an employee shift. As can be seen in FIG. 5, a schedulable object 540 can possibly be bound to more than one binding 550. Scheduler 260 chooses one optimal binding 550 for each schedulable object 540. By selecting a binding for a schedulable object, scheduler 260, in effect, assigns the work activity for that one object (derived from a template) to the time slot specified in the binding. The process of creating schedulable objects 540, creating bindings 550, and choosing optimal bindings 550 will now be discussed in connection with FIGS. 6 and 7.



FIG. 6 is a flowchart for one embodiment of scheduler 260 that supports automatic scheduling of a workforce. At block 610, schedulable objects are created from schedule alteration templates 220. The creation of schedulable objects from schedule alteration templates 220 and an existing schedule 250 can be seen in the example scenario illustrated in FIG. 7. In this example scenario, existing schedule 250 is composed of multiple worker shifts 520: John's Monday shift from 9 AM to 5 PM (shift 520A); John's Tuesday shift from 10 AM to 6 PM (shift 520B); and Fred's Tuesday shift from 11 AM to 7 PM (shift 520C). John is associated with three schedule alteration templates 220: overtime before (template 2200B); voluntary time-off before (template 220VB); and voluntary time-off after (template 220VA). Fred is associated with the two “after” templates, template 2200A and template 220VA.


For templates 220 with a placement value of either “BeginningOfShift” or “EndOfShift”, scheduler 260 creates a set of schedulable objects 540 associated with those templates. (As the name suggests, these values specify where the object is scheduled in relation to the shift; see the discussion of FIG. 3 for more discussion of these placement values.) Specifically, one object 540 is created for each worker shift associated with the template 220. In the example scenario of FIG. 7, template 2200B is associated with two shifts (John M9-5 and John T10-6), so two objects (540A and 540B) are created from template 2200B. In this example, the template-shift association is indirect, through a template-worker relationship and a worker-shift relationship; however, another embodiment using a direct association between template and shift is contemplated. One of ordinary skill in the art should understand by viewing FIG. 7 how the remaining objects 540C-G are created from the other two templates in a similar manner.


If the template 220 has a placement value of “Either”, then the above process is repeated to create two such sets of objects. One of the sets gets a placement value of “BeginningOfShift” and the other corresponding set gets a placement value of “EndOfShift”. In the simple example scenario of FIG. 7, none of the three templates (220OB, 220VB, 220VA) has a placement value of “Either”.


Returning to the flowchart in FIG. 6, after schedulable objects are created in block 610, processing continues at block 620, where a set, or domain, of potential bindings is created for schedulable objects 540, based on attributes such as start time, end time, gap, and duration. Values for these schedulable object attributes are derived from corresponding attributes in template 220. Creation of bindings 550 will now be discussed in connection with FIG. 7.


A schedulable object 540 is associated with a worker shift 520, which has a start time and an end time. Bindings 550 also have a start time and an end time. Bindings 550 are created for a particular shift 520, starting with the time slot adjacent to the shift start or end (depending on whether the Action attribute in object 540 is “Beginning” or “End”). The number of bindings 550 depends on the Duration attribute in the object 540: enough bindings are created to span the time specified by the Duration attribute. However, these bindings 550 are also constrained by work-rules, which may limit the start or end time of a shift (e.g., a particular shift cannot starts before 6 AM or end after 9 PM).


In the example of FIG. 7, the object 540A (“John M9-5 OT Before”) has a Duration of 2 hours, and is associated with shift 520M. Therefore, three bindings 710 are created: 710A is a one-hour slot from 8-9 AM; 710B is a one-hour slot from 7-8 AM; and 710C is a single two-hour slot from 7-9 AM. In addition, a “no time” binding is created (710D), representing the possibility that no object will be scheduled in this slot. The time slot granularity chosen in FIG. 7 is merely an example, and the time slot granularity of the bindings can be a larger or a smaller value.


Viewing FIG. 7, one of ordinary skill in the art should understand how bindings for remaining objects 540B-G are created in a similar manner: binding 720A-D for object 540B (“John T10-6 OT Begin”); binding 730A-B for object 540C (“John M9-5 VTO Begin”); binding 740A-B for object 540D (“John T10-6 VTO Begin”); binding 750A-B for object 540E (“John M9-5 VTO End”); binding 760A-B for object 540F (“John T10-6 VTO End”); and binding 770A-D for object 540G (“Fred T 11-7 VTO End”).


In this example, the domain of bindings for a schedulable object includes at least one binding with a time slot adjacent to the shift, because the Gap field in each object is zero. (The Gap field in a schedulable object is set from the template.) In contrast, the bindings created for objects that have a non-zero Gap field do not include a time slot adjacent to the shift. Instead, the closest time slot is separated from the shift by the value specified by Gap. In this example, the Gaps are fixed values, but in other embodiments Gap is a range, which results in the creation of additional bindings.


Returning to the flowchart in FIG. 6, after schedulable objects are created in block 610, processing continues at block 630, where OT objects are ordered according to worker-specific scheduling preferences. As described earlier in connection with FIG. 5, scheduler 260 receives OT and VTO preferences (e.g., Prefer, Don't Want, Any) set by workers. Thus, schedulable objects 540 associated with workers that prefer OT are first, and schedulable objects 540 associated with workers that do not want OT are last, with schedulable objects 540 associated with workers with no preference in the middle.


Next, at block 640, the optimal binding for each OT object is selected. The techniques that schedulers use to produce an optimal schedule for a given set of inputs (workload, constraints, and goals) should be understood by a person of ordinary skill in the art. Such techniques include, but are not limited to, local search, simulated annealing, and heuristics. The use of schedulable objects and bindings should also be understood by such a person.


Since the previous step 630 was ordered by worker, the effect is to choose bindings for all the OT objects of the same type (Begin or End) for one worker before moving to the next worker. When bindings for all objects have been chosen, the ordering and selection blocks 630 and 640 are repeated for VTO objects. This process can be extended to support schedulable objects of other types as well.



FIG. 7C shows the bindings chosen by the scheduler 260 for schedulable objects 540A-I, in one example scenario. In this diagram, bindings selected by scheduler 260 are shaded, while those not selected are not shaded. As can be seen in FIG. 7C, several objects are bound to a “none” slot: object 540B (“John T10-6 OT Begin”); object 540H (“John M9-5 VTO Begin”); object 540I (“John M9-5 VTO End”); object 540J (“John T10-6 VTO Begin”); and object 540K (“John T10-6 VTO End”). Object 540A (“John M9-5 OT Before”) is bound to the two-hour slot representing 7-9 (710C). Object 540G (“Fred T11-7 VTO After”) is bound to the two-hour slot representing 5-7 (770C).



FIG. 7D shows an updated schedule 270 resulting from the selected bindings shown in FIG. 7C. Shift 520A (“John M 9-5”) has been modified to include a new work activity from 7 AM to 9 AM. This is a result of the binding representing 7-9 AM (binding 710C) being selected for object 540A (“John M9-5 OT Before”). The bindings selected for the other objects for shift 520A (540L and 540M) were all “none”, meaning schedulable objects 540N and 540O did not affect shift 520A. All bindings selected for shift 520B (“John T 10-6”) object were “none”, meaning shift 520B remains unchanged. Shift 520C (“Fred T11-7”) has been modified to include a new time-off activity from 5 PM to 7 PM. This is a result of binding representing 5-7 PM (binding 770C) being selected for object 540G (“Fred T11-7 VTO After”).



FIG. 8 is a hardware block diagram of a general-purpose computer 800 which can be used to implement various embodiments of systems and methods for automatic scheduling of a workforce. Computer 800 contains a number of components that are well known in the art of contact center software, including a processor 810, a network interface 820, memory 830, and non-volatile storage 840. Examples of non-volatile storage include, for example, a hard disk, flash RAM, flash ROM, and EEPROM. These components are coupled via a bus 850. Memory 830 contains instructions which, when executed by the processor 810, implement systems and methods for automatic scheduling of a workforce, such as the processes depicted in the diagrams of FIGS. 4, 5, 6, and 7A-D. Omitted from FIG. 8 are a number of conventional components that are unnecessary to explain the operation of computer 800.


The systems and methods for automatic scheduling of a workforce can be implemented in software, hardware, or a combination thereof. In some embodiments, the system and/or method is implemented in software that is stored in a memory and that is executed by a suitable microprocessor (μP) situated in a computing device. However, the systems and methods can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device. Such instruction execution systems include any computer-based system, processor-containing system, or other system that can fetch and execute the instructions from the instruction execution system. In the context of this disclosure, a “computer-readable medium” can be any means that can contain or store the program for use by, or in connection with, the instruction execution system. The computer readable medium can be, for example but not limited to, a system that is based on electronic, magnetic, optical, electromagnetic, or semiconductor technology.


Specific examples of a computer-readable medium using electronic technology would include (but are not limited to) the following: an electrical connection (electronic) having one or more wires; a random access memory (RAM); a read-only memory (ROM); an erasable programmable read-only memory (EPROM or Flash memory). A specific example using magnetic technology includes (but is not limited to) a portable computer diskette. Specific examples using optical technology includes (but are not limited to): a portable compact disk read-only memory (CD-ROM). In addition, the functionality could be implemented in logic embodied in hardware or software-configured media.


Any process descriptions or blocks in flowcharts should be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. As would be understood by those of ordinary skill in the art of the software development, alternate embodiments are also included within the scope of the disclosure. In these alternate embodiments, functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved.


This description has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the disclosure to the precise forms disclosed. Obvious modifications or variations are possible in light of the above teachings. The embodiments discussed, however, were chosen to illustrate the principles of the disclosure, and its practical application. The disclosure is thus intended to enable one of ordinary skill in the art to use the disclosure, in various embodiments and with various modifications, as are suited to the particular use contemplated. All such modifications and variation are within the scope of this disclosure, as determined by the appended claims when interpreted in accordance with the breadth to which they are fairly and legally entitled.

Claims
  • 1. A method of workforce scheduling, comprising the steps of: in an instruction execution system, receiving a first workforce schedule describing existing assignments of a plurality of workers to a plurality of shifts, each of the shifts being associated with a time range and a day;in the instruction execution system, receiving a shift alteration template describing allowable alterations to shift time ranges;in the instruction execution system, receiving an association between the shift alteration template and at least one of the workers; andin the instruction execution system, producing a second workforce schedule that modifies the length of at least one of the plurality of shifts, by applying at least one schedulable object to the workforce schedule in accordance with a workload forecast and schedule constraints, wherein the at least one schedulable object is based on the shift alteration template.
  • 2. The method of claim 1, further comprising the step of: receiving at least one schedule alteration option associated with one of the workers, the option describing a worker preference for overtime or time-off.
  • 3. The method of claim 1, further comprising the step of: receiving at least one schedule alteration option associated with the workforce schedule, the option describing a preference for placement of overtime or time-off relative to a shift.
  • 4. The method of claim 1, wherein the template includes a duration attribute and a placement attribute.
  • 5. The method of claim 4, wherein the schedulable object is associated with a specific worker shift, and wherein the schedulable object includes a duration attribute and a placement attribute derived from the corresponding attribute in the template.
  • 6. The method of claim 1, wherein the producing step further comprises the steps of: creating at least one schedulable object from the shift alteration template;creating a plurality of potential bindings for the at least one schedulable object based on the assignments in the schedule;selecting one of the potential bindings for association with the schedulable object, in accordance with the workload forecast and the schedule constraints; andproducing the modified schedule by applying the selected one of the bindings to the schedulable object.
  • 7. The method of claim 6, wherein each of the bindings is associated with a specific worker shift, and wherein at least one of the bindings is adjacent in time to the start or end of the associated worker shift.
  • 8. The method of claim 7, wherein the plurality of bindings spans the time specified by a duration attribute of the schedulable object.
  • 9. A system for workforce scheduling, comprising: an instruction execution system configured to execute a user interface operative to create a shift alteration template describing allowable alterations to shift time ranges and to identify an association between the shift alteration template and one or more of a plurality of workers;the instruction execution system configured to execute a scheduler operative to generate a second workforce schedule based on a first workforce schedule, wherein the second workforce schedule describes assignments of one or more workers to one or more of a plurality of shifts, and wherein the second workforce schedule comprises a modification of the length of one or more of the plurality of shifts assigned to a worker, and wherein each of the shifts are associated with a time range and a day, the scheduler comprising: logic to create at least one schedulable object from the shift alteration template;logic to create a domain of potential bindings for the at least one schedulable object based on the assignments in the first workforce schedule;logic to select one of the potential bindings for association with the schedulable object; andlogic to modify the first workforce schedule by applying the selected binding to the schedulable object.
  • 10. The system of claim 9, wherein the shift alteration template comprises information corresponding to overtime.
  • 11. The system of claim 9, wherein the shift alteration template represents information corresponding to voluntary time-off.
  • 12. The system of claim 9, wherein the schedulable object is associated with a specific worker shift, and wherein the schedulable object includes a duration attribute and a placement attribute derived from a corresponding template attribute.
  • 13. The system of claim 9, wherein the plurality of bindings spans the time specified by a duration attribute of the schedulable object.
  • 14. A computer-readable medium having a computer program stored thereon, the computer program comprising computer-executable instructions for performing a computer-executed method for workforce scheduling, the method comprising the steps of: receiving a first workforce schedule describing existing assignments of each of a plurality of workers to one of more of a plurality of shifts;receiving a shift alteration template describing allowable alterations to shift time ranges;receiving an association between the shift alteration template and one or more of the plurality of workers;creating a plurality of schedulable objects based on the shift alteration template;creating a domain of potential bindings for each of the schedulable objects based on the existing assignments;selecting one of the potential bindings for association with each of the schedulable objects, wherein the selected binding is optimal in meeting constraints and optimizing goals; andapplying each of the selected bindings to the associated schedulable object to produce a second workforce schedule that modifies the length of at least one of the plurality of shifts.
  • 15. The computer-readable medium of claim 14, wherein the shift template indicates truncation of a shift.
  • 16. The computer-readable medium of claim 14, wherein the shift template indicates extension of a shift.
  • 17. The computer-readable medium of claim 14, wherein each of the schedulable objects is associated with a worker, and further comprising the step of: ordering each of the schedulable objects by a worker preference option.
  • 18. The computer-readable medium of claim 14, wherein each of the bindings is associated with a specific worker shift having a start time and an end time, and wherein the creating a domain of potential bindings step further comprises: if an attribute of the schedulable object indicates shift extension, creating a binding having a start time at least as early as the associated worker shift start time, or having an end time at least as late as the associated worker shift end time; andif an attribute of the schedulable object indicates shift truncation, creating a binding having a start time at least as late as the associated worker shift start time, or having an end time at least as early as the associated worker shift end time.
  • 19. The computer-readable medium of claim 14, wherein each of the bindings is associated with a specific worker shift having a start time and an end time, and wherein the creating a domain of potential bindings step further comprises: creating a binding that indicates the worker shift remains unchanged when this binding is selected.
  • 20. The computer-readable medium of claim 14, wherein the creating a domain of potential bindings further comprises the step of: creating a domain of potential bindings for each of the schedulable objects based on the schedule shift assignments, wherein the potential bindings are constrained by a set of work rules.
US Referenced Citations (174)
Number Name Date Kind
3594919 De Bell et al. Jul 1971 A
3705271 De Bell et al. Dec 1972 A
4510351 Costello et al. Apr 1985 A
4684349 Ferguson et al. Aug 1987 A
4694483 Cheung Sep 1987 A
4763353 Canale et al. Aug 1988 A
4815120 Kosich Mar 1989 A
4924488 Kosich May 1990 A
4953159 Hayden et al. Aug 1990 A
5016272 Stubbs et al. May 1991 A
5101402 Chiu et al. Mar 1992 A
5117225 Wang May 1992 A
5210789 Jeffus et al. May 1993 A
5239460 LaRoche Aug 1993 A
5241625 Epard et al. Aug 1993 A
5267865 Lee et al. Dec 1993 A
5299260 Shaio Mar 1994 A
5311422 Loftin et al. May 1994 A
5315711 Barone et al. May 1994 A
5317628 Misholi et al. May 1994 A
5325292 Crockett Jun 1994 A
5347306 Nitta Sep 1994 A
5388252 Dreste et al. Feb 1995 A
5396371 Henits et al. Mar 1995 A
5432715 Shigematsu et al. Jul 1995 A
5465286 Clare et al. Nov 1995 A
5475625 Glaschick Dec 1995 A
5485569 Goldman et al. Jan 1996 A
5491780 Fyles et al. Feb 1996 A
5499291 Kepley Mar 1996 A
5535256 Maloney et al. Jul 1996 A
5572652 Robusto et al. Nov 1996 A
5577112 Cambray et al. Nov 1996 A
5590171 Howe et al. Dec 1996 A
5597312 Bloom et al. Jan 1997 A
5619183 Ziegra et al. Apr 1997 A
5696906 Peters et al. Dec 1997 A
5717879 Moran et al. Feb 1998 A
5721842 Beasley et al. Feb 1998 A
5742670 Bennett Apr 1998 A
5748499 Trueblood May 1998 A
5778182 Cathey et al. Jul 1998 A
5784452 Carney Jul 1998 A
5790798 Beckett, II et al. Aug 1998 A
5796952 Davis et al. Aug 1998 A
5809247 Richardson et al. Sep 1998 A
5809250 Kisor Sep 1998 A
5825869 Brooks et al. Oct 1998 A
5835572 Richardson, Jr. et al. Nov 1998 A
5862330 Anupam et al. Jan 1999 A
5864772 Alvarado et al. Jan 1999 A
5884032 Bateman et al. Mar 1999 A
5907680 Nielsen May 1999 A
5911134 Castonguay et al. Jun 1999 A
5918214 Perkowski Jun 1999 A
5923746 Baker et al. Jul 1999 A
5933811 Angles et al. Aug 1999 A
5944791 Scherpbier Aug 1999 A
5948061 Merriman et al. Sep 1999 A
5958016 Chang et al. Sep 1999 A
5964836 Rowe et al. Oct 1999 A
5978648 George et al. Nov 1999 A
5982857 Brady Nov 1999 A
5987466 Greer et al. Nov 1999 A
5990852 Szamrej Nov 1999 A
5991373 Pattison et al. Nov 1999 A
5991796 Anupam et al. Nov 1999 A
6005932 Bloom Dec 1999 A
6009429 Greer et al. Dec 1999 A
6014134 Bell et al. Jan 2000 A
6014647 Nizzari et al. Jan 2000 A
6018619 Allard et al. Jan 2000 A
6035332 Ingrassia et al. Mar 2000 A
6038544 Machin et al. Mar 2000 A
6039575 L'Allier et al. Mar 2000 A
6044355 Crockett et al. Mar 2000 A
6057841 Thurlow et al. May 2000 A
6058163 Pattison et al. May 2000 A
6061798 Coley et al. May 2000 A
6072860 Kek et al. Jun 2000 A
6076099 Chen et al. Jun 2000 A
6078894 Clawson et al. Jun 2000 A
6091712 Pope et al. Jul 2000 A
6108711 Beck et al. Aug 2000 A
6122665 Bar et al. Sep 2000 A
6122668 Teng et al. Sep 2000 A
6130668 Stein Oct 2000 A
6138139 Beck et al. Oct 2000 A
6144991 England Nov 2000 A
6146148 Stuppy Nov 2000 A
6151622 Fraenkel et al. Nov 2000 A
6154771 Rangan et al. Nov 2000 A
6157808 Hollingsworth Dec 2000 A
6171109 Ohsuga Jan 2001 B1
6182094 Humpleman et al. Jan 2001 B1
6195679 Bauersfeld et al. Feb 2001 B1
6201948 Cook et al. Mar 2001 B1
6211451 Tohgi et al. Apr 2001 B1
6225993 Lindblad et al. May 2001 B1
6230197 Beck et al. May 2001 B1
6236977 Verba et al. May 2001 B1
6244758 Solymar et al. Jun 2001 B1
6282548 Burner et al. Aug 2001 B1
6286030 Wenig et al. Sep 2001 B1
6286046 Bryant Sep 2001 B1
6288753 DeNicola et al. Sep 2001 B1
6289340 Puram et al. Sep 2001 B1
6301462 Freeman et al. Oct 2001 B1
6301573 McIlwaine et al. Oct 2001 B1
6324282 McIlwaine et al. Nov 2001 B1
6347374 Drake et al. Feb 2002 B1
6351467 Dillon Feb 2002 B1
6353851 Anupam et al. Mar 2002 B1
6360250 Anupam et al. Mar 2002 B1
6370574 House et al. Apr 2002 B1
6404857 Blair et al. Jun 2002 B1
6411989 Anupam et al. Jun 2002 B1
6415259 Wolfinger et al. Jul 2002 B1
6418471 Shelton et al. Jul 2002 B1
6459787 McIlwaine et al. Oct 2002 B2
6487195 Choung et al. Nov 2002 B1
6493758 McLain Dec 2002 B1
6502131 Vaid et al. Dec 2002 B1
6510220 Beckett, II et al. Jan 2003 B1
6535909 Rust Mar 2003 B1
6542602 Elazar Apr 2003 B1
6546405 Gupta et al. Apr 2003 B2
6560328 Bondarenko et al. May 2003 B1
6583806 Ludwig et al. Jun 2003 B2
6606657 Zilberstein et al. Aug 2003 B1
6628777 McIllwaine et al. Sep 2003 B1
6665644 Kanevsky et al. Dec 2003 B1
6674447 Chiang et al. Jan 2004 B1
6683633 Holtzblatt et al. Jan 2004 B2
6697858 Ezerzer et al. Feb 2004 B1
6724887 Eilbacher et al. Apr 2004 B1
6738456 Wrona et al. May 2004 B2
6757361 Blair et al. Jun 2004 B2
6772396 Cronin et al. Aug 2004 B1
6775377 McIlwaine et al. Aug 2004 B2
6792575 Samaniego et al. Sep 2004 B1
6810414 Brittain Oct 2004 B1
6820083 Nagy et al. Nov 2004 B1
6823384 Wilson et al. Nov 2004 B1
6870916 Henrikson et al. Mar 2005 B2
6901438 Davis et al. May 2005 B1
6959078 Eilbacher et al. Oct 2005 B1
6965886 Govrin et al. Nov 2005 B2
6970829 Leamon Nov 2005 B1
20010000962 Rajan May 2001 A1
20010032335 Jones Oct 2001 A1
20010043697 Cox et al. Nov 2001 A1
20020023157 Lo et al. Feb 2002 A1
20020038363 MacLean Mar 2002 A1
20020052948 Baudu et al. May 2002 A1
20020065911 Von Klopp et al. May 2002 A1
20020065912 Catchpole et al. May 2002 A1
20020128925 Angeles Sep 2002 A1
20020143925 Pricer et al. Oct 2002 A1
20020165954 Eshghi et al. Nov 2002 A1
20030055883 Wiles et al. Mar 2003 A1
20030079020 Gourraud et al. Apr 2003 A1
20030144900 Whitmer Jul 2003 A1
20030154240 Nygren et al. Aug 2003 A1
20040100507 Hayner et al. May 2004 A1
20040165717 McIlwaine et al. Aug 2004 A1
20040193473 Robertson et al. Sep 2004 A1
20040193972 Mitlin et al. Sep 2004 A1
20040267591 Hedlund et al. Dec 2004 A1
20040267595 Woodings et al. Dec 2004 A1
20050137925 Lakritz et al. Jun 2005 A1
20060239440 Shaffer et al. Oct 2006 A1
20070050228 Beshears Mar 2007 A1
20070127690 Patakula et al. Jun 2007 A1
Foreign Referenced Citations (6)
Number Date Country
0453128 Oct 1991 EP
0773687 May 1997 EP
0989720 Mar 2000 EP
2369263 May 2002 GB
WO 9843380 Nov 1998 WO
WO 0016207 Mar 2000 WO