(19) United States
`(2) Patent Application Publication (10) Pub. No.: US 2004/0078257 A1
`(43) Pub. Date:
`Apr. 22, 2004
`Schweitzer et al.
`
`US 20040078257A1
`
`(54) LABOR AND RESOURCE SCHEDULING
`SYSTEM
`
`(75) Inventors: George H. Schweitzer, Camas, WA
`(US); Bryan R. Elder, Oak Harbor,
`WA (US)
`Correspondence Address:
`KLARQUIST SPARKMAN, LLP
`121 SW SALMON STREET
`SUITE 1600
`PORTLAND, OR 97204 (US)
`(73) Assignee: LaborSage, Inc.
`(21) Appl. No.:
`10/367,443
`(22) Filed:
`Feb. 14, 2003
`Related U.S. Application Data
`(60) Provisional application No. 60/420,378, filed on Oct.
`21, 2002.
`
`Publication Classification
`
`... G06F 17/60
`(51) Int. CI.7.
`(52) U.S. Cl. … 705/9
`
`(57)
`
`ABSTRACT
`
`An automated labor and resource scheduling system pro
`vides automated assistance to scheduling managers for
`scheduling labor and resources to host and service events at
`a facility. The automated scheduling is based on on real time
`and motion analysis, resulting in realistic and clearly defined
`productivity expectations. It assists management in mini
`mizing labor costs for events of any size, while providing
`greater confidence that proper staffing guidelines are in place
`to cover all bases. The automated scheduling helps eliminate
`guess work involved in manual scheduling, and more readily
`identifies near optimum labor margins. The scheduling sys
`tem also provides employees itineraries with clear expecta
`tions, along with a map which charts the flow of events,
`resulting in improved performance, labor expense savings,
`and enhanced communication in the scheduling process.
`
`GENERATE
`ASSIGNMENT
`120
`
`
`
`REPORTS
`150
`
`
`
`
`
`
`
`
`
`REVIEW/CHANG
`SCHEDULE
`140
`
`
`
`CiM Ex. 1033 Page 1
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 1 of 23
`Figure 1
`
`US 2004/0078257 A1
`
`REPORTS
`150
`
`
`
`
`
`GENERATE
`ASSIGNMENT
`120
`
`
`
`
`
`REVIEW/CHANG
`SCHEDULE
`140
`
`
`
`
`
`AUTO-SCHEDULE
`130
`
`Figure 24
`
`? TTTTTTTTTTTT T- |
`Computing Environment 2400
`Communication
`TT T.T.T.T 2–T Connection(s) 247O <i>
`243O
`|
`Input Device(s)
`24.50
`
`
`
`
`
`Processing
`Unit 241 O
`
`Output Device(s)
`2460
`
`
`
`o
`
`Storage 2440
`
`*- - * - * - * - - - - - - - - - - - - - - ºr
`
`Software 2480 Implementing Labor and
`Resource Scheduling
`
`CiM Ex. 1033 Page 2
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 2 of 23
`
`US 2004/0078257 A1
`
`Figure 2
`
`
`
`EVENT SALES
`STAFF
`230
`
`LABOR AND
`RESOURCE
`SCHEDULING
`SYSTEM
`210
`
`SCHEDULING
`MANAGER
`240
`
`EVENT
`MANAGEMENT
`SYSTEM (EMS)
`220
`
`CiM Ex. 1033 Page 3
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 3 of 23
`Figure 3
`
`US 2004/00782.57 A1
`
`300
`
`
`
`
`
`310
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`STEP 1 - CREATE LABOR AND
`RESOURCE
`
`RETRIEVE NEXT BEO IN
`TEMPORARY TABLE
`
`DOES
`BEO ALREADY
`EXIST IN LABOR AND
`RESOURCE*
`
`
`
`|S LABOR
`AND RESOURCE
`SCHEDULING BEO
`MARKED AS
`OMPLETET2
`
`312
`
`CREATE NEW LABOR AND
`RESOURCE
`
`DELETE EXISTING LABOR
`AND RESOURCE
`
`314
`
`IS THIS THE
`LAST BEO IN THE
`TEMPORARY
`TABLET’
`
`CiM Ex. 1033 Page 4
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 4 of 23
`
`US 2004/00782.57 A1
`
`Figure 4
`
`STEP 2 - CREATE TASKS AND
`RESOURCES
`
`400
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`420
`
`RETRIEVE NEXT LABOR
`AND RESOURCE
`
`|S BEO IN A
`SCHEDULABLE STATE2
`
`NO
`
`CREATE TASKS AND
`RESOURCES
`
`
`
`IS THIS THE
`LAST BEO IN THE
`TEMPORARY
`TABLET’
`
`423
`
`
`
`COMPLETE
`
`CiM Ex. 1033 Page 5
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 5 of 23
`Figure 5
`
`US 2004/00782.57 A1
`
`STEP 1 - CREATE TASKASSIGNMENTS
`
`500 /
`
`
`
`510
`
`
`
`
`
`FLAG EXISTING
`ASSIGNMENTS AS
`UNCHANGED
`
`
`
`RETRIEVE NEXT TASK
`
`CREATE ASSIGNMENT
`
`DOES SAME
`ASSIGNMENT EXIST
`ALREADY?
`
`UPDATE DATABASE WITH
`CHANGES
`
`
`
`515
`
`SAVE ASSIGNMENT TO
`DATABASE WFLAG SET TO
`CHANGED
`
`FLAG ASSIGNMENTAS
`CHANGED
`
`516
`
`IS THIS THE
`LAST TASK FOR THE
`EVENT2
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`CiM Ex. 1033 Page 6
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 6 of 23
`Figure 6
`
`US 2004/00782.57 A1
`
`STEP 2 - CREATE RESOURCE
`ASSIGNMENTS
`
`
`
`600
`
`
`
`610
`
`RETRIEVE NEXT
`RESOURCE
`
`
`
`613
`
`
`
`614
`
`
`
`UPDATE DATABASE W/
`CHANGES
`
`FLAG ASSIGNMENTAS
`CHANGED
`
`
`
`
`
`
`
`
`
`
`
`
`
`611
`
`
`
`CREATE ASSIGNMENT
`
`612
`
`DOES SAME
`ASSIGNMENT ALREADY
`EXIST?
`
`SAVE ASSIGNMENT TO
`DATABASE WIFLAG SET TO
`CHANGED
`
`
`
`
`
`
`
`IS THIS THE
`LAST RESOURCE FOR
`THE EVENT2
`
`617
`
`DELETE ASSIGNMENTS
`STILL FLAGGED AS
`UNCHANGED
`
`
`
`
`
`COMPLETE
`
`CiM Ex. 1033 Page 7
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 7 of 23
`Figure 7
`
`US 2004/0078257 A1
`
`AUTO-SCHEDULING
`
`700
`
`
`
`710
`
`
`
`
`
`711
`
`CREATE RECURRING
`SHIFTS
`
`
`
`STARTAT BEGINNING OF
`WEEK
`
`
`
`712
`
`CRETE NEXT SHIFT AND
`SCHEDULE ASSIGNMENTS
`
`
`
`
`
`713
`
`
`
`ARE WE AT THE END
`OF THE WEEK?
`
`
`
`714
`
`WERE SHIFTS
`SCHEDULED FOR THIS
`WEEK?
`
`SCHEDULE
`COMPLETE
`
`CiM Ex. 1033 Page 8
`
`

`
`US 2004/00782.57 A1
`
`Patent Application Publication Apr. 22, 2004 Sheet 8 of 23
`Figure 8
`800 \
`
`810
`
`DETERMINE TIME TO START
`REVIEW OF ASSIGNMENTS
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`811
`
`RETRIEVE NEXT
`ASSIGNMENT
`
`ASSIGNABLE AFTER
`THE START TIME?
`
`DETERMINE PREFERRED
`START
`
`IS THE
`START TIME THE
`LOWEST FOUND SO
`FART)
`
`815
`
`|S THE START TIME
`FiXED?
`
`USE START TIME AS NEW
`MINIMUM
`
`816
`
`
`
`
`
`ARE WE
`AT THE END OF
`THE WEEK'S
`ASSIGNMENTS?
`
`817
`
`818
`
`
`
`MINIMUM START TIME
`FOUND IS USED TO CREATE
`THE NEW SHIFT
`
`COMPLETE
`
`CiM Ex. 1033 Page 9
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 9 of 23
`Figure 9
`900 & CE)
`
`
`
`US 2004/0078257 A1
`
`910
`
`-
`
`911
`
`913
`
`
`
`
`
`
`
`
`
`DOES THIS
`ASSIGNMENT RELY ON
`ANOTHER2
`
`NO
`
`
`
`-
`IS THIS A º
`ASSIGNMENT
`
`915
`
`914
`
`YES
`
`
`
`NO
`
`
`
`USE THE EVENT ENDAS
`THE PREFERRED START
`TIME
`
`IS THE MASTER
`ASSIGNMENT
`SCHEDULED7
`
`yes 916
`IS ASSIGNMENT
`PARTIALLY ASSIGNED
`ALREADY7
`
`
`
`
`
`
`
`
`
`SET PREFERRED START
`TO LATEST ASSIGNED
`TIME OF MASTER
`
`
`
`
`
`USE EARLIEST
`ASSIGNED TIME AS THE
`PREFERRED START
`
`THIS ASSIGNMENT IS
`UNASSIGNABLE
`
`918
`
`DONE
`
`
`
`
`
`
`
`
`
`920
`
`ANY
`ASSIGNMENTS FOR
`THE EVENT
`ASSIGNED7
`
`
`
`
`
`
`
`
`
`USE THE EARLIEST
`ASSIGNED TIME AS THE
`START
`
`USE THE DATE OF THE
`LATEST START AND THE
`CONFIGURED NORMAL TIME
`TO START SETUP AS THE
`PREFERRED START
`
`DONE
`
`CiM Ex. 1033 Page 10
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 10 of 23 US 2004/0078257 A1
`Figure 10
`
`1000
`
`1010
`
`1011
`
`SUMMARIZE ASSIGNABLE
`ASSIGNMENTS
`
`CALCULATE POINTS FOR
`ALL EMPLOYEES
`
`
`
`1012
`
`ARE ALL EMPLOYEES
`UNASSIGNABLE7
`
`THIS TIME FRAME IS SHORT
`EMPLOYEES. CALCULATE A
`NEW TIME
`
`1014
`
`CHOOSE EMPLOYEE WITH
`HIGHEST NUMBER OF
`POINTS
`
`
`
`
`
`
`
`
`
`1015
`
`
`
`|S EMPLOYEE
`ALREADY WORKING
`DURING THIS TIME?
`
`CREATE NEW SHIFT
`
`
`
`1017
`
`
`
`EXTEND EXISTING SHIFT
`
`CiM Ex. 1033 Page 11
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 11 of 23
`
`US 2004/0078257 A1
`
`Figure 11
`
`1100
`
`fizvmzsage mu.-1
`fin Est
`tow Burma Ind! Endw Heb
`
`‘
`
`1_ m'c'o-ac-'?E:7n:ca:]3
`ta/.
`1
`‘Stg-iclad
`
`C)Mnvdgy
`Cjfliday
`
`Q Iusxaey
`ra sauna;
`
`(3-Awexinudq Qlhnd-av
`El
`‘ggiwunenu
`E1 —P-u_—Ew.-nu Ink:
`3 v- Emu out WI\ha.u1y.3/SFJJJZ
`|
`E-J" -lrtgupvn-&wmLcL-w,Idsn)us Fo1adSmvi:a Ieemubqywnrmnp~3/s
`.
`Tlamuui was Picks (5 nine: mm-... vs/am nsmmm yd 3/E/ZEIIZI mm PM)
`:
`or uvwalsv Fame: [2 n-nuns » Cunenw Umxiyuflzj
`
`,T4&v_.r...«,,n.a..¢,m...<-._a/warn,
`,
`,,
`,,
`
`
`
`'~§ii,=“fixi
`
`
`
`1
`
`CiM EX. 1033 Page 12
`
`CiM Ex. 1033 Page 12
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 12 of 23 US 2004/0078257 A1
`
`Figure 12
`
`
`
`DEFINING ROOMS
`
`ºf
`Room name ?º
`Room group Rental Aieas
`
`- | I} This room is a stoiage area
`
`Figure 13
`
`DEFINING ROOMS
`
`
`
`1300
`
`Nºbº.
`
`i
`
`Pie Function
`The Bar and Gil
`Lobby Fie-Function
`
`Palosure 200
`Guesticom iod
`
`CiM Ex. 1033 Page 13
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 13 of 23
`
`US 2004/00782.57 A1
`
`
`
`
`
`„ (SWOOH) NOI LOETTOO VIVO
`
`
`
`
`
`CiM Ex. 1033 Page 14
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 14 of 23
`
`US 2004/00782.57 A1
`
`
`
`
`
`CiM Ex. 1033 Page 15
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 15 of 23 US 2004/0078257 A1
`Figure 1 6
`\
`
`DEFINING RESOURCES
`
`1600
`
`-
`
`
`
`§ Resource Definitions
`
`Setup Requirements
`Service Standard
`
`Low
`
`Use times from the following Iesource
`
`|
`
`|
`
`Corytimes from another resource."
`Copy time from resources in package.
`Remove times for this service standard.
`
`Minutes spent preparing this resource [T --- To seconds.
`Minutes required to prepare this tesource for transport {i.e. loading onto ca?ts) ?
`0 seconds
`Minutes required to transport to the base ?oom ?]33333
`26 seconds
`Minutes required to unload and set up resource in destination room [33333
`14 seconds
`Minutes tequired to teardown resource ETE 10 seconds
`Minutes required to clean Iesource ?º
`0 seconds
`How many resources can be transpoiled in a single trip ?
`
`CiM Ex. 1033 Page 16
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 16 of 23
`
`US 2004/0078257 A1
`
`
`
`N
`
`
`
`IIII
`IIII
`
`13
`
`.
`
`"
`
`V
`D:
`D
`0
`_§.295’2§§§
`
`CiM EX. 1033 Page 17
`
`ll I
`mall I
`II II
`all
`an
`III
`iii iilififi
`
`3*
`L”
`0
`ct
`3
`0
`(0
`
`\;
`
`Z
`_O
`F
`Q
`LU
`_,
`_J
`O
`Q
`
`<E
`|_
`<1:
`'3
`3
`
`r~
`*-
`9
`3
`.9
`I.I_
`
`‘»
`
`
`
`°’
`
`I
`
`*5?
`
`
`
`
`
`
`
`2
`
`IIIIIIIIIIIIII
`fififiilllafi
`§
`°
`mgfl
`‘,
`an " ‘
`' ‘
`3; ”‘
`ggfiaiéfiiéaaag
`
`:~ 2
`In to
`N N N N N
`to
`23
`iiiil
`ilfi
`«i
`iiii
`I
`Eliilfififififill
`$6,,’
`in
`‘
`IIIII
`, *» IIIIIIIIIIIIIII
`IIIII
`,0 M, II ° I
`0% «~°,
`IIIII
`mo 's«..,;’°é9.,;%1,,:IIIIIIIIIIII
`I
`M, «%,‘°o«,%r=«.,¢,, gaaggg ag gag
`
`«as "e.,e‘IIII IIIIII
`Wag. ’°-rue,
`4‘
`°s
`9/
`’-l
`<
`9%
`«O,
`"’/as
`I
`IIIII
`e%:«~e‘,j'°=e,.;;?~e«.;~ IIIIIIIIIIII I
`IIIII
`"°«-..,:"-'»o,%°° <v%° EEHEEEEHHIIIEI
`IIIII
`‘%‘f'vq,,“ EEEEEEEEEIII El
`IIIII
`4”” ‘°a,,;‘ IEIIIIII
`IIIII
`"""o, IIIIIIII IIIII
`Ififififillna iiiiiii
`IIIIIIIIIIIIIIIII
`IIIIII
`IIIIIIIIIIIIIIII
`IIIII
`
`CiM Ex. 1033 Page 17
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 17 of 23
`
`US 2004/0078257 A1
`
`Figure 18
`
`DEFINING TASKS
`
`"z-7,‘ Task Maintenance
`
`W’
`4Bof48_J p pp, kI7]Vu(élI§skNme
`W
`b'i°'it-V
`"0
`lV5°”f‘,'_'1,HEllWa-V taped
`Scl'redul;—g“| 2.!-\ulomalion]| ;l Rooms
`
`\ [
`
`V Wrfig I
`Hecurrirrglasltw
`D! Add to racurring events
`5. Persunneljfig
`I[§:lVtr:':rerary'l“lotes I
`
`J howls} to complete
`This task takes approximately '2
`Task starts »|_1u/11/2uu2__ E1]
`Weekly
`—--——-—~— A
`7
`
`rFrequanc_v
`
`
`
`Q parry
`(‘:0 Weekly
`(3) Monthly
`
`HDaily Frequency
`
`Every LW 7 _MI weeklsl on:
`Sunday
`Monday
`Q] Thursday 2| Friday
`
`C} Tuesday
`EJ Saturday
`
`[33 Wednesday
`
`—————————
`
`——
`
`E39 Occur: once at
`
`I 7 :0E|:00AliE_
`
`Q) Occurs every
`
`[0
`
`howls)
`
`Starting at L1mrE:§r_':r?;.f._T@]
`12:00:00 M/1
`
`
`
`
`P"°“‘-V
`"1
`"""“I‘ai" °"' E:"”a“‘5‘“ V [
`2. Automation '3 Rooms
`~-=Task Slarts————————)~
`6,.-9 Al the beginning Of
`Q A‘ ‘ha ""5 °f
`The l ____,|U€J
`. D, .
`Q lrnmediately prior to setup
`Q} Immediately following teardown
`
`Recurring task
`H 1"] Add to recurring events
`5. Personnel 5. Slaggeringflgiryltivgerary
`rAdiust Start Time By »—~
`
`IP”—m-‘J M inures {fig}
`Plus an adcitional
`::[Mm M per
`Guests
`
`————-———————— -
`
`End:
`G) At the beginning of
`Q’ A‘ the °"d °f
`The |Plated Breaktasl ______jN.
`I or '
`{:9 Some time after the task starts
`(:9 Some 13 of labor minutes after the task starts
`
`~Adiust End Time By
`l[]
`Mgnures [+/,]
`Plus an additional
`l Minutes (#4 De,
`J Guests
`
`10
`
`CiM EX. 1033 Page 18
`
`CiM Ex. 1033 Page 18
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 18 of 23 US 2004/0078257 A1
`
`Fig U?e 20
`
`DEFINING EMPLOYEES
`
`-
`aware sentenance -----
`El?, C. Gº 3% ?i?
`2000 ||{ {{ {|| 1 of 28
`} >> || |#4 |Las Name
`\\ Rºl Employee is active
`?: Do not auto-schedule assignments to employee
`1. Emplºyee?? Haylºvitiya fices; schedule? Hecuiraschedel_
`
`Employment information=
`
`-
`
`-
`
`Hie date ?y?zºm
`Terminate date |
`Regular wages ?º 0.00
`Suggested days per week E
`||
`Overtime wages 31500
`-
`Annual salary EDT –
`SSN 1522-63-3839
`– -
`Minimum shit?,
`– Facily employee ID ?ºft
`Maximum ha? T. Timekeeping systemID ?ºft T1 .
`Lifting ability
`R7|This employee is entitled to overtime compensation
`?il Allow overtime scheduling
`T. Display enhanced inela?ies
`
`|
`
`-
`
`-
`
`#
`
`-
`
`t
`
`i
`
`t
`
`-
`
`Fig ure 21
`†: Employee Maintenance
`
`DEFINING EMPLOYEES
`
`N R7; Employee is active
`
`- ? Do not auto-schedule assignments to employee
`
`Monday
`Tuesday
`Wednesday
`Thursday
`Friday
`
`7:00:00AM - 1:58:00 PM
`7:00:00AM - 1:53:00 PM
`7:00:00 AM - 1:53:00 PM
`7:00:00AM - 1:59:00 PM
`7:00:00AM - 1:53:00 PM
`
`{º} Evely,
`
`j-, Mo?e available
`i + 1 - 1 + - - - - # 1 # * * * * - - - -
`
`* :
`
`Ç, Monday
`Cy Tuesday
`Ö Wednesday
`Ç) Thursday
`Cy Friday
`Ç, Saturday
`
`-
`?ºund AM H
`arid
`[T500TTE
`--
`
`Ç) or, between the following dates:
`
`
`
`10/11/2002
`and
`
`fºll12:00:00AM #
`
`CiM Ex. 1033 Page 19
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 19 of 23 US 2004/0078257 A1
`
`Figure 22
`
`SCHEDULING LABOR
`
`2200
`
`P3 stup and Guest
`RE Complete [...] Recuting event [...] *** -
`?]Veified [...] Off-site even
`T. No teadown
`RETTE
`Theme HMeeting
`
`
`
`FBE0 romation– –
`Event name Pºupºmºension? T :----------|----------
`
`, --, …—-
`
`Nolate than 3,5 Žº -- EFTTH |
`
`
`
`
`
`
`
`
`
`F
`
`CiM Ex. 1033 Page 20
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 20 of 23 US 2004/0078257 A1
`
`F ig ure 25
`
`
`
`EVENT MAP
`
`Wednesday, 3/13/2002
`9ärn
`12pm
`
`.
`
`| | His son tºu
`
`Patio
`
`Pre-Function
`
`The Bar and Grill
`
`Lobby Pre-Functio
`
`Mezzanine
`
`Parlor Suite 200
`
`Guest room 20?)
`
`Guest room 300
`
`Parlor Suite 300
`
`Park.f. Suite 400
`
`Portico
`
`Presidential Suite
`
`Al Meeting Space
`
`Off Premise
`
`Unknown Facility (1)
`
`Page 4 of 7
`
`CiM Ex. 1033 Page 21
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 21 of 23
`Figure 26
`
`WEEKLY SCHEDULE
`
`
`
`US 2004/00782.57 A1
`
`2600
`
`Revised Employee Schedule for the Week
`3f 10/2002 to 3/16/2002
`Printed: 2/7/2003 11:38:45AM
`
`-
`
`Captains
`Ardrºw RBlack
`Chris Parkwr
`
`George H. Schweitzer
`KaºycDrew
`
`Charles M Laka
`Dan Hagan
`Emsly M Foswr
`Erie C Long
`Mark Å Lamb
`Rºbert Miller
`Tºrry E. Howard
`Maungars
`Bill R Carter
`Temporary Personnel
`
`Temporary:5
`
`3:00a-2:00pset
`40+- 11:00psi
`
`7:00a-2:45p set
`
`CiM Ex. 1033 Page 22
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 22 of 23 US 2004/0078257 A1
`Figure 27 EMPLOYEE shrimnerary
`
`
`
`2700
`
`Comº Swe Forced Description
`Paid 15 Minuie Break
`Unpaid 30 Minnta Break
`Paid 15 Minute tºrrak
`
`Employee Itinerary for Andrew R Black by Event
`3A9A2002 is:ug:tºupni to 3/10/2uuz 1:15:00AM
`Philated: u?frºg if Al:31AM
`Criteria: thisched Times Sched Tirrell] = 4580
`Qty
`Approx. Thine
`7:00p-7:14p
`9:00p-929p
`11:30p 11:44p
`
`McMillan/Parra Reception (39/2002 6:00:00PM-389/2002 11:00:00PM)
`# Guests; 50
`Sotup SlyketºristingSct
`Theme: Dinner
`Comp Sws Forced Description
`Approx. Thue
`[] x .
`Bar Service Battender
`5:00p-1044p
`U -
`-
`Team down Dinner Buffet Tebke w;4 Cha?ters
`
`Qty
`
`1
`
`CiM Ex. 1033 Page 23
`
`

`
`Patent Application Publication Apr. 22, 2004 Sheet 23 of 23
`
`US 2004/0078257 A1
`
`Fig u re 28
`
`WEEKLY FLASH REPORT
`
`2 8 00
`
`Fmmnt 21713173 |\ '4'J:12AM
`Weekly Flash Report
`r... m Wank zmnmnz :. Jmmmz
`
`cm“,
`nae
`‘Va-uh Lam
`Houaponon
`Wtiipmlm
`Mung:
`Clplun
`Bamndu
`Lmdzy
`D'uhSlnv/and
`Tump
`AuvBqlMy
`'l'at:.lVnhIb um
`Tctalfilr Wank
`
`sun
`am
`3.23
`0.00
`000
`0.00
`um
`um
`JILZS
`
`A,_,‘,,,,,
`nme
`nonm
`
`Uludpud '
`Tlmu
`Donn.
`
`Ash:-L Scheduled
`nm
`nonm
`
`am:
`4134
`am
`ISII7
`3.15
`000
`am
`
`Is
`
`$690
`3460
`so
`
`4145
`33.66
`rum
`sans
`000
`am
`am
`0 00
`000
`mm
`
`0 on
`0.00
`0.00
`000
`0.00
`0.00
`mm
`IIIW
`
`31.:
`Ilfill
`
`(sun)
`
`nus)
`(Sm)
`n m
`(0.15)
`(315)
`000
`0 m
`000
`am
`ans)
`01.3)
`
`.
`
`3.5
`
`Iludpnad llwemu
`nuamu uu
`
`$33,500
`$3,300
`
`Fol-uuwd Hzvcnu
`Fnneuled Lalo:
`
`mmm
`53.001
`
`1...: Yr Rzlznllc
`Lu! Y: Lon
`
`331,750
`mm
`
`Azluallnenuz
`mu-u.-Im
`
`$32,050
`$3,255
`
`Fetus!“ IIulplVu-hue
`(2.417
`
`Fuxuul-1| LutVm.I Vnrhnn
`(231)
`
`Achulvl Budfil Vuhnlu
`(106)
`
`Atmllu Lul Yx Vuhnte
`(L91)
`
`uhumkuxy(\)-Inna!-czyq-answu-gwauuhukuuupu
`
`CiM EX. 1033 Page 24
`
`CiM Ex. 1033 Page 24
`
`

`
`US 2004/00782.57 A1
`
`Apr. 22, 2004
`
`LABOR AND RESOURCE SCHEDULING SYSTEM
`
`TECHNICAL FIELD
`[0001] The present invention relates to labor and resource
`scheduling, and more particularly relates to scheduling to
`provide more efficient utilization of labor and resources in
`event management and other fields.
`
`BACKGROUND
`[0002] A large variety of events are hosted and serviced at
`hotels, conference centers, exposition halls, and like event
`management facilities. The labor and resources required for
`the events can differ greatly due to the variety of events and
`variations between facilities. For example, the labor and
`resource requirements for a luncheon or dinner banquet can
`differ significantly from those for a lecture, wedding recep
`tion, exhibition, etc. Further, variations in facilities create
`different demands for labor and resources to host or service
`eVents.
`[0003] Labor schedules for events are currently developed
`on a manual basis throughout the world. The task of sched
`uling is a difficult exercise which requires event managers to
`sift through countless banquet event contracts on a weekly
`basis, in an attempt to cover all staffing requirements nec
`essary to handle events. Effectiveness in labor planning is
`highly dependent upon the education and capability of each
`event manager. Unfortunately, the complexity and time
`required to cover all aspects of booked events is often a
`staggering task which, due to human nature, results in
`inefficiencies and excessive labor costs.
`
`SUMMARY
`[0004] Implementations described herein of a labor and
`resource scheduling system more effectively schedules labor
`to make efficient use of labor and resources, so as to avoid
`excess labor costs. The described labor and resource sched
`uling system performs more efficient scheduling for widely
`varying event requirements and facilities based on facility
`specific time analysis of task assignments. More particularly,
`a time and distance analysis is made of a specific facility and
`resources. For example, the times to transport resources
`between storage areas and various “sellable” rooms of a
`facility and times to perform various other tasks at the
`facility. For example, the time for various assignments, such
`as setting up an 8' table in a banquet configuration in a
`particular meeting room of a facility, is measured to take into
`account times for travel or unique setup/task requirements
`from room to room, storage areas, or any sellable area within
`an event facility. Timings for preparation, preparation for
`transport, transporting, setup, teardown, cleaning and stor
`age of all resources are determined and customized, as
`necessary, at each facility utilizing the system. Resource
`packages also are customized on a facility specific basis, to
`allow for multiple resource timings, as outlined above. The
`labor and resource scheduling system is thus informed of
`facility-specific labor requirements for various task assign
`ments that compose various events that can be hosted at a
`facility, and can more efficiently schedule labor and
`resources for the events to fulfill these task assignments
`while avoiding excess labor.
`[0005] The system further ensures users enhanced com
`munication, improved customer service and optimum pro
`
`ductivity. The system produces employee schedules based
`on real time and motion analysis, resulting in realistic and
`clearly defined productivity expectations. The system is
`designed to be an automated scheduling tool which posi
`tively impacts communication, customer service, and pro
`ductivity. It assists management in minimizing labor costs
`for events of any size, while providing greater confidence
`that proper staffing guidelines are in place to cover all bases.
`[0006] The labor and resource scheduling system appeals
`to all facility managers because it provides employees
`itineraries with clear expectations, along with a map which
`charts the flow of events, resulting in improved performance
`and dramatic savings in labor expense compared to prior
`manual techniques. Moreover, it provides management the
`capability to accurately audit employee productivity, a task
`which heretofore has proven to be too time consuming, if not
`overwhelming, for the best of managers. Typically, upper
`management has relied upon estimates of “acceptable labor
`margins” as a threshold for measuring success. Facility
`Managers which use the system can eliminate the guess
`work and be able to readily identify near optimum labor
`margins. They also experience improved customer service,
`due to enhanced communication in the scheduling process.
`Employees will quickly know what functions they’re
`assigned to, where to go, what tasks to perform, and how
`long the tasks take to perform without the need for imme
`diate directives from a supervisor.
`[0007] Additional features and advantages of the inven
`tion will be made apparent from the following detailed
`description of embodiments that proceeds with reference to
`the accompanying drawings.
`BRIEF DESCRIPTION OF THE DRAWINGS
`[0008] FIG. 1 is a flow diagram of basic processes per
`formed by the event labor and resource scheduling system,
`such as on a daily basis to formulate and maintain schedules.
`[0009] FIG. 2 is a dataflow diagram illustrating import of
`Banquet Event Order (BEO) information from an event
`booking system into the labor and resource scheduling
`system.
`[0010] FIG. 3 is a flow diagram of a process to create
`labor and resource scheduling in the labor and resource
`scheduling system.
`[0011] FIG. 4 is a flow diagram of a process to create tasks
`and resources in the labor and resource scheduling system.
`[0012] FIG. 5 is a flow diagram of an assignment gen
`eration process to create task assignments in the labor and
`resource scheduling system.
`[0013] FIG. 6 is a flow diagram of an assignment gen
`eration process to create resource assignments in the labor
`and resource scheduling system.
`[0014] FIGS. 7, 8, 9 and 10 are flow diagrams of an
`automated scheduling process to schedule shifts and allocate
`assignments in the labor and resource scheduling system.
`[0015] FIG. 11 is a diagram of a screen display presented
`by the labor and resource scheduling system for schedule
`maintenance.
`[0016] FIG. 12 is a diagram of a screen display presented
`by the labor and resource scheduling system for defining a
`room definition.
`
`CiM Ex. 1033 Page 25
`
`

`
`US 2004/00782.57 A1
`
`Apr. 22, 2004
`
`[0017] FIG. 13 is a diagram of a screen display presented
`by the labor and resource scheduling system for defining a
`room definition.
`[0018] FIG. 14 is a diagram of a room data collection
`report produced from data in the labor and resource sched
`uling system.
`[0019] FIG. 15 is a diagram of a screen display presented
`by the labor and resource scheduling system for defining
`resource definitions.
`[0020 FIG. 16 is a diagram of a screen display presented
`by the labor and resource scheduling system for defining
`resource definitions.
`[0021] FIG. 17 is a diagram of a resource data collection
`report produced from data in the labor and resource sched
`uling system.
`[0022] FIG. 18 is a diagram of a screen display presented
`by the labor and resource scheduling system for defining
`task definitions.
`[0023] FIG. 19 is a diagram of a screen display presented
`by the labor and resource scheduling system for defining
`task definitions.
`[0024] FIG. 20 is a diagram of a screen display presented
`by the labor and resource scheduling system for defining
`employee definitions.
`[0025] FIG. 21 is a diagram of a screen display presented
`by the labor and resource scheduling system for defining
`employee definitions.
`[0026] FIG.22 is a diagram of a screen display presented
`by the labor and resource scheduling system for scheduling
`labor.
`[0027] FIG. 23 is a diagram of a screen display presented
`by the labor and resource scheduling system for scheduling
`labor.
`[0028] FIG.24 is a block diagram of a suitable computing
`environment for the labor and resource scheduling system.
`[0029] FIG.25 is a diagram of a printable report produced
`by the labor and resource scheduling system and represent
`ing events occurring during the scheduled week.
`[0030] FIG. 26 is a diagram of a printable report produced
`by the labor and resource scheduling system and represent
`ing employee shift times during the scheduled week.
`[0031] FIG.27 is a diagram of a printable report produced
`by the labor and resource scheduling system and represent
`ing employee duties during a shift.
`[0032] FIG.28 is a diagram of a printable report produced
`by the labor and resource scheduling system and represent
`ing efficiency in scheduling during the scheduled week.
`
`DETAILED DESCRIPTION
`
`Introduction
`[0033] The following description is directed to techniques
`for labor and resource scheduling based on time and distance
`analysis data for a subject facility. In one illustrated imple
`mentation, the techniques are incorporated into a Labor and
`Resource Scheduling System 210 (FIG. 2) for event man
`
`agement. The labor and resource scheduling described
`herein alternatively can be incorporated into labor and
`resource scheduling systems for other types of facilities and
`other fields than events. For example, the labor and resource
`scheduling described herein alternatively can be applied to
`scheduling labor and resources in laundry, food preparation,
`and other work places and fields.
`[0034] The following description of the illustrated labor
`and resource scheduling system proceeds through the defi
`nition of:
`Vision and scope
`[0035]
`Workflow diagram, and
`[0036]
`Functional specification.
`[0037]
`Vision and Scope
`[0038]
`[0039] With reference to FIG. 2, the labor and resource
`scheduling system 210 provides the ability to use computer
`technology to automatically schedule labor for events, using
`real time and motion analysis, along with “Event Mapping”
`methodology, taking into consideration past/current/future
`event setup requirements prior to assigning shifts and
`responsibilities to employees.
`[0040] The system has been designed as “add-on” soft
`ware, with an import feature which reads Banquet Event
`Order (BEO) information output data exported from com
`mercial event booking systems (Event Management Sys
`tems or EMS) 220. In alternative implementations, event
`information can be imported in other formats. In still other
`implementations, the labor and resource scheduling system
`and event management system can be integrated as a single
`system, which can execute on a stand-alone computer, or a
`client/server or other distributed computing system. Essen
`tially, the labor and resource scheduling system recognizes
`information pertinent to the theme, style, setup and service
`requirements for all booked events. The system can also be
`used as a “stand-alone” product, allowing manual entry of
`all BEO information. Once the data has been entered,
`additions or modification of specific details/requirements
`can be made via point and click, keyboard entries or other
`user editing inputs. After all event specific information has
`been entered, whether through manual input or importation,
`the system will generate assignments to appropriately setup,
`service and teardown all events. Such assignments can then
`be automatically assigned to employees, either by the sys
`tem or user, dependent upon user preference.
`[0041] The labor and resource scheduling system 210 for
`events includes, but is not be limited to, the following
`features:
`[0042] 1) An employee HRIS system (Human
`Resource Information System), which tracks basic
`employment information, as well as performance,
`availability, shift preferences, capability, roles, and
`lifting ability. The HRIS system will allow customi
`zation and weighting of facility specific labor rules to
`assist in selection of employees for automated sched
`uling.
`[0043] 2) An inventory database (illustrated in
`resources data collection worksheet 1700 in FIG. 17,
`for example), wherein all resources and their corre
`sponding capacities will be inventoried and main
`
`CiM Ex. 1033 Page 26
`
`

`
`US 2004/00782.57 A1
`
`Apr. 22, 2004
`
`tained. Resource availability will also be tracked.
`Timings for preparation, preparation for transport,
`transporting, setup, teardown, cleaning and storage
`of all resources for different service levels, if needed,
`will be determined and customized, as necessary, at
`each facility utilizing the system. Resource packages
`will also be customized on a facility specific basis, to
`allow for multiple resource timings, as outlined
`above.
`[0044] 3) Room inventory/feature recognition,
`wherein times for travel or unique setup/task require
`ments from room to room, storage areas, or any
`sellable area within an event facility, are acknowl
`edged and tracked, ensuring accurate and reasonable
`time allowances for completion of tasks (as repre
`sented in rooms data collection worksheet 1400 in
`FIG. 14, for example).
`[0045] 4) The ability to add or modify tasks to meet
`requirements for facility specific jobs and service
`standards.
`[0046] 5) The ability to create “maps”2500 (FIG.25)
`outlining all events along with sub functions respec
`tive to each event. Such maps serve as a communi
`cation tool and visual aid to instill a greater sense of
`knowledge and urgency for all employees, so that
`they’re aware of business volume, timing, and who
`is handling setup, service and teardown for each
`eVent.
`[0047] 6) The ability to create schedules 2600 (FIG.
`26) by assigning all setup, service and teardown
`oriented tasks to employees, either automatically by
`allowing the system to generate the schedule using
`HRIS selection features (outlined in #1 above), or
`manually by allowing the user to drop and drag
`assignments to specific employees.
`[0048] 7) Report (e.g., weekly flash report 2800 of
`FIG. 28) options, which allow management the
`ability to:
`[0049] a) Audit productivity
`[0050] b) Isolate labor costs and recognize vari
`ances to budget and previous years
`[0051] c) Track variances to actual hours worked
`[0052] d) Identify exceptions with regard to:
`[0053] i) inventory shortages
`[0054] ii) employee performance
`[0055] iii) event conflicts, etc...
`Workflow
`[0056] The following Workflow detail provides a brief
`outline of an “Ideal Use” scenario for the system. This
`abridged representation is intended only to provide a brief
`summary of the workflow.
`[0057] 1) Configuration
`[0058] a) At installation of the labor and resource
`scheduling system 210 at a facility, a detailed time
`and distance study analysis is performed for the
`facility encompassing at least the sellable rooms and
`
`storage areas, resources, tasks and employees that
`are specific to the respective facility. In the study, the
`times for employees to travel between any combi
`nation of the rooms is measured. Further, timing
`relating to specific resources and/or configurations
`thereof for particular events also is measured, such as
`timing to set up, preparation, take down and cleaning
`of an 8' table in both banquet and classroom con
`figurations. These measurements can be made, for
`example, using a stop watch and measurement tapes
`or wheels, etc. As discussed further below, the auto
`matic scheduling procedure bases calculations of the
`time required for various tasks for events based in
`part on this time and distance study analysis infor
`mation.
`[0059] 2) Preliminary Tasks
`[0060) a) Event Sales Staff 230 enter Banquet Event
`Orders (BEO) in their Event Management System
`(EMS) 220 as sales are made.
`[0061] b) BEO's are printed and provided to Sched
`uling Manager (SM) 240 on a weekly basis.
`[0062] c) Any changes, relative to previously booked
`BEO’s are submitted via “change order” on a daily,
`or as needed basis.
`[0063] 3) Import of EMS Information Output Data
`[0064] a) SM 240 performs initial review of BEO’s,
`after which SM 240 initiates an import from the
`labor and resource scheduling system that connects
`dynamically to EMS information output data to
`acquire needed information for the week being
`scheduled plus several days prior to and beyond the
`week.
`[0065] i) While processing the data, the following
`is performed automatically by the labor and
`resource scheduling system:
`[0066] (1) Themes and room setup styles of
`BEO’s are identified to automatically create
`service tasks and resources to be set by person
`nel.
`[0067] (2) Themes are used to identify default
`functions to perform, such as lunches, dinners,
`breaks, etc. These functions are then used to
`automa