Dynamic Schedule Augmentation for Unscheduled Worker Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Unpredictable variations in available staff complicate the allocation of tasks in facilities, making automatic task allocation computationally intractable and leading to suboptimal or manual adjustments.
Innovation Solution
A computing device generates auxiliary schedule segments based on real-time presence data to automatically allocate tasks to unscheduled workers, enhancing the facility's task allocation system by dynamically augmenting the schedule data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If automatic task allocation is implemented, then task distribution efficiency is improved, but computational complexity becomes intractable due to unpredictable staff variations
Solution Approach 1:
The patent segments the scheduling problem by separating scheduled workers from unscheduled workers. The system generates auxiliary schedule segments for unscheduled workers based on their presence data, dividing the complex allocation problem into manageable parts: scheduled workers follow pre-defined segments while unscheduled workers receive dynamically generated segments, reducing overall computational complexity
Solution Approach 2:
The system performs preliminary actions by pre-generating auxiliary schedule segments for unscheduled workers before task allocation occurs. Presence data is processed in advance to create these segments, so when task allocation needs to occur, the computational burden is already reduced and workers are pre-prepared for assignment
2Adaptability or versatility
If schedule data is dynamically augmented with auxiliary segments, then adaptability to unscheduled workers is improved, but data processing complexity increases
Solution Approach 1:
The patent introduces an intermediary component that generates auxiliary schedule segments based on presence data. This intermediary layer translates raw presence data into structured schedule segments that can be seamlessly integrated with existing scheduled worker data, enabling adaptability without directly complicating the core allocation system
Solution Approach 2:
The system creates simplified copies of schedule segment structures for unscheduled workers. Instead of developing entirely new complex scheduling logic, auxiliary segments replicate the basic structure and format of regular schedule segments, making them compatible with existing systems while accommodating unscheduled workers
Data Source
AI summary
A method in a computing device includes: obtaining schedule data for a facility, the schedule data including a plurality of segments, each segment having (i) a start time, (ii) an end time, and (iii) a worker identifier assigned to the segment from a plurality of worker identifiers; obtaining presence data including, for each of the plurality of worker identifiers, whether a corresponding worker is present at a facility; detecting, from the presence data, a worker present at the facility, having a first worker identifier that is not assigned to any of the segments in the schedule data; generating an auxiliary segment having (i) a start time based on the presence data, (ii) an end time based on a comparison of the schedule data with the presence data, and (iii) the first worker identifier; and providing the auxiliary segment to a task allocator with the schedule data.