[미국특허]
Systems and methods for automatic scheduling of a workforce
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06Q-010/00
G06Q-010/06
출원번호
US-0916678
(2010-11-01)
등록번호
US-10115065
(2018-10-30)
발명자
/ 주소
Fama, Jason
Zeoli, Michael
Hamilton, Edward
출원인 / 주소
VERINT AMERICAS INC.
대리인 / 주소
Meunier Carlin & Curfman
인용정보
피인용 횟수 :
0인용 특허 :
158
초록▼
Systems and methods are disclosed for scheduling a workforce. In one embodiment, the method comprises receiving a shift activity template; receiving an association between the shift activity template and at least one worker; and scheduling a plurality of schedulable objects. The scheduling is perfor
Systems and methods are disclosed for scheduling a workforce. In one embodiment, the method comprises receiving a shift activity template; receiving an association between the shift activity template and at least one worker; and scheduling a plurality of schedulable objects. The scheduling is performed in accordance with a workload forecast and schedule constraints. Each of the schedulable objects is based on the shift activity template. The shift activity template describes a worker activity performed during a shift. The template has range of start times and a variable length for the activity. The activity is associated with a queue.
대표청구항▼
1. A method of workforce scheduling, comprising: using a processor and computer memory to form a template-user interface comprising at least one shift activity template, wherein a worker interacts with the template-user interface to enter attributes of a work schedule into the shift activity templat
1. A method of workforce scheduling, comprising: using a processor and computer memory to form a template-user interface comprising at least one shift activity template, wherein a worker interacts with the template-user interface to enter attributes of a work schedule into the shift activity template stored in the computer memory, wherein the attributes describe at least one worker activity performed during a period in a shift, a range of start times for the worker activity, and a length for the at least one worker activity;creating with the processor and storing in the computerized memory, a schedulable object associated with the shift;for said at least one worker activity, initializing corresponding attributes in the schedulable object in accordance with attributes from the shift activity template;receiving an association between the shift activity template and at least one worker;andadjusting a scheduled time for the worker activity within the shift to evaluate combinations of scheduled times for the worker by binding the schedulable object to a respective period in the shift;constraining additional binding such that the additional binding of additional schedulable objects to additional periods in the shift are distinct from the respective period in the shift;identifying schedulable objects that are in excess of a minimum number of schedulable objects for a respective shift activity template and tracking the excess schedulable objects with a “no binding” identifier;gathering the identified excess schedulable objects and placing the excess schedulable objects together in initial periods of respective shift activity templates to accommodate reassigning the excess schedulable objects;identifying at least one queue experiencing a backlog and reassigning the excess schedulable objects from respective shift activity templates to the at least one queue;anddirecting output from the queue to the at least one worker in accordance with the binding and additional binding. 2. The method of claim 1, wherein using the variable length comprises locating the variable length among a plurality of schedulable objects with heuristic searches comprising one of a quick search, chronological search, activity oriented search and a swap search. 3. The method of claim 2, wherein the activity ordered search comprises: creating a list of possible activity orderings; andfor each ordering, each activity in the ordering and non-required scheduling object, filtering the list of possible activity orderings for that scheduling object such that it only contains the activity in the ordering;scheduling using an existing local search and scoring to optimize work rules and service goal scores; andif an optional scheduling object is bound, replacing it with a required scheduling object. 4. The method of claim 2, wherein the swap search comprises: swapping two activity blocks where an activity of a first block is not the same as an activity of a second block and employees associated with the first block and the second block are the same; andcomparing a performance improvement based on the swapping. 5. The method of claim 1, further comprising: creating, for each shift activity template, a plurality of schedulable objects, a domain of potential bindings for each schedulable object, and a respective additional binding. 6. The method of claim 5, where each schedulable object contains a list of possibilities consisting of every start-time/activity pair given a start time window defined in the shift worker activity, a shift length, a list of flexible activities defined in the shift activity, and skills of an employee;ordering the scheduling objects such that non-required objects are first; andscheduling for each employee using an existing local search and scoring, to optimize work rules and service goal scores;wherein the local search comprises:selecting a non-required scheduling object;filtering a list of possibilities for that scheduling object such that it only contains a start chronologically ordered start time;scheduling using an existing local search and scoring to optimize work rules and service goal scores; andif an optional scheduling object is bound, replacing it with a required scheduling object. 7. The method of claim 1, further comprising determining a score that represents one of plural alternatives, where the alternatives include scheduling to achieve service level on as many queues as possible, scheduling work on the queues that have the most work, and scheduling work proportionately to the workload on each queue. 8. A method of workforce scheduling, comprising: using a processor and computer memory to form a template-user interface comprising at least one shift activity template, wherein a worker interacts with the template-user interface, to enter attributes of a work schedule into the shift activity template stored in the computer memory, wherein the attributes describe at least one worker activity performed during a period in a shift, the template having a range of start times for the worker activity and a variable length for the at least one worker activity, wherein flexible activities fill consecutive time slots in the shift and further wherein a later object is dependent on previously created objects;creating with the processor and storing in the computerized memory, a plurality of schedulable objects associated with the shift;for said at least one worker activity, initializing corresponding attributes in the schedulable objects in accordance with said attributes from the shift activity template;identifying schedulable objects that are in excess of a minimum number of schedulable objects for a respective shift activity template and tracking the excess schedulable objects with a “no binding” identifier;gathering the identified excess schedulable objects and placing the excess schedulable objects together in initial periods of respective shift activity templates to accommodate reassigning the excess schedulable objects;identifying at least one queue experiencing a backlog and reassigning the excess schedulable objects from respective shift activity templates to the at least one queue;receiving an association between the shift activity template and at least one worker;defining a time bank of weekly target hours for the at least one worker over a predetermined period; andscheduling the plurality of schedulable objects using heuristic searches, wherein the schedulable objects are associated with the at least one worker in accordance with a workload forecast, schedule constraints and the time bank each stored in the memory, wherein the scheduling comprises: adjusting the variable length of the worker activity to evaluate combinations of varying lengths of the worker activity in the scheduling;binding the plurality of the schedulable objects to a respective period in the shift and automatically scheduling the workforce to meet the workload forecast stored in said memory;directing output from the queue to the at least one worker in accordance with the binding and additional binding. 9. The method of claim 8, further comprising: defining plural time banks for the at least one worker; andassigning one of the time banks to the at least one worker in accordance with the workload forecast. 10. The method of claim 8, further comprising scheduling the at least one worker within a campaign having a duration of the predetermined period. 11. The method of claim 10, further comprising tracking hours worked by the at least one worker during the campaign. 12. The method of claim 8, further comprising projecting the workload forecast in accordance with an hours per week worked by employees, vacation hours per week taken by employees, overtime hours, retraining time, layoff plans and hiring plans. 13. The method of claim 8, further comprising defining intermediate periods within the time bank to reflect workload forecasts having a duration less than the predetermined period. 14. The method of claim 13, wherein the duration is associated with a seasonal adjustment or product release. 15. A method of workforce scheduling, comprising: using a processor and computer memory to form a template-user interface comprising at least one shift activity template, wherein a worker interacts with the template-user interface, to enter attributes of a work schedule into the shift activity template stored in the computer memory, wherein the attributes describe at least one worker activity performed during a period in a shift, a range of start times for the worker activity, and a variable length for the at least one worker activity;receiving an association between the shift activity template and at least one worker;creating with the processor and storing in the computer memory, a plurality of schedulable objects associated with the shift;scheduling the plurality of schedulable objects using heuristic searches, wherein the schedulable objects are in accordance with a workload forecast of the first queue and a schedule of the second queue, the scheduling comprising: for said at least one worker activity, initializing corresponding attributes in the schedulable objects in accordance with said attributes from the shift activity template;adjusting the variable length of the worker activity to evaluate combinations of varying lengths of the worker activity in the scheduling;identifying schedulable objects that are in excess of a minimum number of schedulable objects for a respective shift activity template and tracking the excess schedulable objects with a “no binding” identifier;gathering the identified excess schedulable objects and placing the excess schedulable objects together in initial periods of respective shift activity templates to accommodate reassigning the excess schedulable objects;identifying at least one queue experiencing a backlog and reassigning the excess schedulable objects from respective shift activity templates to the at least one queue; binding the plurality of the schedulable objects to a respective period in the shift and automatically scheduling the workforce to meet the workload forecast stored in said memory;directing, in real time and with a contact router, output from the first queue and the second queue to the at least one worker in accordance with the binding. 16. The method of claim 15, further comprising iteratively scheduling the plurality of schedulable objects for subsequent queues. 17. The method of claim 16, wherein the first queue and the second queue are defined as a tier, and wherein the subsequent queues are layered in tiers to create a cycle. 18. The method of claim 17, wherein the tiers within the cycle converge to create a score. 19. The method of claim 18, wherein the convergence of the cycle is set in accordance with a cycle delta threshold, a cycle count threshold and a processing time threshold.
Costello Peter E. (Matawan NJ) Fossett Lawrence D. (Morganville NJ) Lane Michael S. (Colts Neck NJ) Quin Terrence T. (Holmdel NJ) Smith Nicholas K. (Middletown NJ), ACD Management information system.
Vinod Anupam ; Narain H. Gehani ; Viswanath Kadambari, Apparatus and method for sharing information in simultaneously viewed documents on a communication system.
Vinod Anupam ; Narain H. Gehani ; Viswanath Kadambari, Apparatus and method for sharing information in simultaneously viewed documents on a communication system.
Rowe Thomas Owings ; Tan Yih-Shin, Apparatus, methods and computer program products for managing web-page-embedded sessions with a host-based application.
Alvarado Juan C. ; Craievich Danielle S. P. ; Provost J. Thomas, Apparatus, system and method to transmit and display acquired well data in near real time at a remote location.
Burner Michael G. ; Gilliat Bruce C. ; Jaquith Eric W. ; Marvit David L. ; Kahle Brewster ; O'Driscoll Niall ; Smith Z E. ; Tanenbaum Ronna C., Automatically generate and displaying metadata as supplemental information concurrently with the web page, there being no link between web page and metadata.
Bauersfeld Kristin ; Putterman Scott, Browsing session recording playback and editing system for generating user defined paths and allowing users to mark the priority of items in the paths.
Brooks Nancy Sinling,CAX ; Fryer Paul Douglas,CAX ; Kaufman Gary Stanley,CAX ; Berkson Stephen Phillip ; Herel Charles R. ; Brooks Laura M., Call management method and system for skill-based routing.
Mears,John C.; Korzeniowski,Gary E.; Lewis, Jr.,William R.; Peang Meth,Ly K., Contact center system capable of handling multiple media types of contacts and method for using the same.
Henits John (Bethel CT) Swick Robert B. (Stratford CT) Messologitis Constantine P. (Milford CT) Goane Christopher S. (Greenwich CT), Endless loop voice data storage and retrievable apparatus and method thereof.
Loftin R. Bowen (Houston TX) Wang Lui (Friendswood TX) Baffes Paul T. (Houston TX) Hua Grace C. (Webster TX), General purpose architecture for intelligent computer-aided training.
Bloom Charles P. (Superior CO) Bell Brigham R. (Boulder CO) Linton ; Jr. Franklyn N. (Woburn MA) Haines Mark H. (Arvada CO) Norton Edwin H. (Northglenn CO), Intelligent tutoring method and system.
Lee John R. (912 Constantinople St. New Orleans LA 70115) Alvendia John (Metairie LA), Interactive computer aided natural learning method and apparatus.
L'Allier James J. ; Welsh Sally H. ; Nielsen Boyd W. ; Miles Kurt W. ; Myers Ken L. ; Henrie Stephen P. ; Norberg Michael I. ; Helliwell Laura I., Interactive learning system with pretest.
George Tomy ; Bhamidipati Sriram V., Interactive multimedia performance assessment system and process for use by students, educators and administrators.
Jeffus Stanley E. (Garland TX) Brown Barry D. (Mesquite TX) Crawford Rockett O. (Carrollton TX) Roerick Michael L. (Carrollton TX), Interactive telephone operator terminal.
Beasley Danny L. ; Seifert ; Jr. Robert V. ; Lacrampe Paul ; Huffington James C. ; Greene Thomas ; Hafer Kevin J., Interconnection system for viewing and controlling remotely connected computers with on-screen video overlay for contro.
Chiang, Hui-Hwa; Lee, Kuo-Chun; Chen, Tsung-Yen (Eric); Han, Ching-Chih (Jason), Method and apparatus for automatically recording snapshots of a computer screen during a computer session for later playback.
Richardson John A. ; Kaufman Peter J. ; Maso Brian ; Johnson Carl A. ; Yeomans ; III Rick H., Method and apparatus for guided touring of internet/intranet websites.
Goldman Jason (Ft. Collins CO) Jenings ; Jr. Byron T. (Ft. Collins CO), Method and apparatus for monitoring display screen events in a screen-oriented software application too.
Barone Stan T. (Fridley MN) Hepburn Ian R. (Minnetonka MN) Fladmoe Gary E. (Salt Lake City UT) Vavra Robert D. (Roseville MN), Method and apparatus for remotely and centrally controlling a plurality of host processors.
Beck Christopher Clemmentt Macleod ; Berke Jonathan Michael ; Johnstone Joel A ; Mitchell Robin Marie ; Powers James Karl ; Sidell Mark Franklin ; Knuff Charles Dazler, Method and apparatus for rules-based storage and retrieval of multimedia interactions within a communication center.
Vinod Anupam ; Narain H. Gehani ; Viswanath Kadambari, Method and apparatus for sharing asymmetric information and services in simultaneously viewed documents on a communication system.
Beckett ; II Stephen Marshall ; House Donald Andrew ; McDougal Rebecca L. ; Lamberti ; Jr. Santino J., Method and apparatus for simultaneously monitoring computer user screen and telephone activity from a remote location.
Beckett, II, Stephen Marshall; House, Donald Andrew; McDougal, Rebecca L.; Lamberti, Jr., Santino J., Method and apparatus for simultaneously monitoring computer user screen and telephone activity from a remote location.
Pope Kevin T. ; Wright Maynard A. ; Strich Daniel A. ; Hartmann Paul R. ; Ellebracht Edward T. ; Ramsayer Douglas B., Method and apparatus for storing and retrieving performance data collected by a network interface unit.
Beck Christopher Clemmett Macleod ; Berke Jonathan Michael ; Johnstone Joel A ; Mitchell Robin Marie ; Powers James Karl ; Sidell Mark Franklin ; Knuff Charles Dazler, Method and apparatus for supporting diverse interaction paths within a multimedia communication center.
Eilbacher, Robert; Bodner, Dan; Lubowsky, Ted; Boudreau, Lou; Jakobsche, George, Method and system for analyzing customer communications with a contact center.
Maloney Michael J. (Plano TX) McCalmont David T. (San Jose CA), Method and system for automatically monitoring the performance quality of call center service representatives.
Fraenkel Michael L. ; Singhal Sandeep Kishan, Method and system for portably enabling view synchronization over the world-wide web using frame hierarchies.
Ingrassia ; Jr. Michael I. ; Shelton James A. ; Rowland Thomas M., Method for monitoring user interactions with web pages from web server using data and command lists for maintaining information visited and issued by participants.
Nisani, Mordechai; Bar, Eitan, Method for storing on a computer network a portion of a communication session between a packet source and a packet destination.
Allard James E. ; Treadwell ; III David R. ; Ludeman John F., Method, system and apparatus for client-side usage tracking of information server systems.
Tohgi Yutaka,JPX ; Iyatomi Akane,JPX ; Hara Masaki,JPX ; Hirose Tomoyuki,JPX, Music lesson system with local training terminal and remote supervisory station.
Bell Brigham R. ; Hurley William D. ; Kovacevic Srdjan N. ; Neves Michelle ; Wolff Alan S. ; Bloom Charles P., Network-based intelligent tutoring system.
Beck Christopher Clemmett Macleod ; Berke Jonathan Michael ; Johnstone Joel A. ; Mitchell Robin Marie ; Powers James Karl ; Sidell Mark Franklin ; Knuff Charles Dazler, Operating system having external media layer, workflow layer, internal media layer, and knowledge base for routing media events between transactions.
Humpleman Richard James ; Harms G. Kevin ; Deacon Michael S. ; Chandiramani Omi, Programming tool for home networks with an HTML page for a plurality of home devices.
Rangan P. Venkat ; Shastri Vijnan ; Ashwani Arya ; Arole Parag, Real-time receipt, decompression and play of compressed streaming video/hypervideo; with thumbnail display of past scenes and with replay, hyperlinking and/or recording permissively intiated retrospe.
Epard Marc A. (Lawrence KS) Ping He (Lawrence KS) Trautman Neal E. (Lawrence KS) VanVleck Paul F. (Lawrence KS), Screen image sharing among heterogeneous computers.
Stein Michael Victor, Supervisory control system for networked multimedia workstations that provides simultaneous observation of multiple remote workstations.
Govrin, David; Peer, Boaz; Sosna, David; Greenberg, Guy, System and method for analyzing and utilizing data, by executing complex analytical models in real time.
Fyles Anthony (Winchester GB2) Key Andrew (Southampton GB2) Sethi Vincent (Southampton GB2), System and method for efficient computer workstation screen updates.
Robusto John D. (Herndon VA) Boswell William H. (State College PA) Meckley Mary E. (Las Vegas NV) Niechwiadowicz Deanna R. (State College PA) Watt David J. (Freeport PA) Findley Gorman N. (Boalsburg , System and method for monitoring and controlling one or more computer sites.
Zilberstein, Moshe; Matsliach, Gaby; Ronen, Avner; Ventura, Ronen; Rousso, Benny; Buber, Shai, System and method for processing and presenting internet usage information.
Thurlow Scott A. ; Bliss William J. ; Stumberger Douglas E. ; Goodhand David R. ; MacDonald Brian W., System and method for processing electronic messages with rules representing a combination of conditions, actions or exceptions.
Brittain, Dennis A., System and methods for easy-to-use periodic network data capture engine with automatic target data location, extraction and storage.
Bateman Thomas Howard,CAX ; Kierstead Bruce Edward,CAX ; Noble William Alexander,CAX ; Curry Timothy Lee,CAX ; Lockett John Alan,CAX ; Mersereau Laurie Edward,CAX ; Ouellette Robert James,CAX, System for coordinating communications via customer contact channel changing system using call centre for setting up the.
Moran Thomas P. ; Minneman Scott L. ; Harrison Steve R. ; Kimber Donald G. ; van Melle William J. ; Zellweger Polle T. ; Kurtenbach Gordon P.,CAX ; Wilcox Lynn D. ; Bly Sara A. ; Janssen ; Jr. Willia, System for the capture and replay of temporal data representing collaborative activities.
Dreste Robert A. (Webster NY) Scheda Mark R. (Brockport NY) Bozenhard Howard C. (Webster NY), System for transparent monitoring of processors in a network with display of screen images at a remote station for diagn.
Davis, Clay; Bodwell, Walter R.; Klobe, Michael C., System selects a best-fit form or URL in an originating web page as a target URL for replaying a predefined path through the internet.
Canale Leonard M. (Middletown NJ) Collins Michael J. (East Windsor NJ) O\Brien Paul J. (Atlantic Highlands NJ) Scott Lisa L. (Fair Haven NJ) Singer Martin H. (Fair Haven NJ), Terminal based adjunct call manager for a communication system.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.