Workload-based task assignment

Allocate tasks based on individuals' incomplete workload

Goel, K., Fehrer, T., Röglinger, M., & Wynn, M. T. (2023). Not Here, But There: Human Resource Allocation Patterns. In Lecture Notes in Computer Science (pp. 377–394). All sources

Description

Workload-based task assignment belongs to the utilisation category of the HRAPs (Goel et al., 2023). It assigns tasks to people according to their workload, defined as the number of task instances a person has started but not yet completed. The allocation rule is usually to give the next work item to the eligible person with the lowest workload. This corresponds to the “shortest queue” distribution known from the workflow resource patterns. Workload can be reconstructed from start and complete events in an event log at any point in time. Simple counts treat all tasks as equal, so in practice you may weight work items by their expected effort.

In the study, experts named it among the most pervasive patterns. It pairs naturally with Constraint-based task assignment, the other utilisation pattern: constraints define who may do the task, and workload chooses among those people. It is also the main counterweight to the productivity patterns. Performance-based task assignment and Experience-based task assignment tend to pile work on the best people, and a workload cap keeps that in check.

For employees, the pattern is the most direct protection against chronic overload. It spreads work fairly, and that matters for well-being and for how fair the allocation feels. One side effect needs attention: people who finish quickly receive more work, so speed is “rewarded” with more load. Caps, effort weighting and transparency about how the rule works reduce this effect.

Key Takeaways

  1. Workload as open work — Workload is the number of task instances a person has started but not yet completed.
  2. Least-loaded eligible person — Combine with constraints: eligibility first, then the lowest workload.
  3. Counterweight to productivity rules — Workload caps stop performance- and experience-based allocation from overloading the best people.
  4. Weight by effort — Raw counts ignore task size; weighting by expected effort gives a fairer picture.

Performance considerations

QualityTimeFlexibilityCost080

■ This pattern   ■ Baseline

The ratings are neutral across time, cost, quality and flexibility, because the pattern redistributes work without adding capacity or changing the process. Spreading work evenly can shorten waiting time in front of overloaded people and raise overall utilisation. Routing work to whoever has the least open work, however, can send it to someone less suited, which may cost time or quality. The net effect depends on how similar the eligible people are. The main benefit is fairer, more sustainable workloads, and with them lower stress and absence, rather than a clear gain on any one performance dimension.

Example

For example, a customer-service centre could route each new e-mail ticket to the eligible agent with the fewest tickets currently in progress. Complex tickets would count double, and an agent who reaches a cap would temporarily receive no new tickets. Team leads would watch the distribution of open tickets per agent instead of just total queue size.

Spotting the opportunity in event data

Framed along the FLAC rule types — fitness, location, attribute, constraint.

Fitness: processes with start and complete timestamps per resource and a pool of interchangeable people. Location: activities and roles where open work is spread unevenly across resources, and cases waiting in front of particular people while others are free. Attributes: work in progress per resource over time (started but not completed), the spread of workload within a role, waiting time by assigned resource, and availability or working time. Constraints: without start events, workload can’t be measured as defined. Adjust for part-time work and absences, and combine with constraint and skill rules so that balancing doesn’t send work to unsuitable people.

Sources & references

  1. Goel, K., Fehrer, T., Röglinger, M., & Wynn, M. T. (2023). Not Here, But There: Human Resource Allocation Patterns. In Lecture Notes in Computer Science (pp. 377–394). Summary on this site Publisher page DOI 10.1007/978-3-031-41620-0_22

Share this pattern

Enjoy these

Foundational free Patterns

Apply Integral technology

Elevate physical constraints by applying new technology

Apply triage

Consider the division of a general activity into two or more alternative activities

Appoint case managers

Assign a responsible individual for handling each case type

Assign cases

Let workers perform as many steps as possible for single cases

Automate activities

Consider automating activities

Automate for environmental impact

Implement automation in a sustainable way

Buffer information

Buffer external information and subscribe to updates

Combine activities

Combine small activities into composite activities

Consolidate Work

Collect similar work items and work in batches

Constraint-based task assignment

Allocate tasks considering business process execution constraints

← Back

Connected to

Constraint-based task assignment

Allocate tasks considering business process execution constraints

What's Happening?

Dec 2023
New Pattern

Consolidate Work

Nov 2023
Oct 2023
Oct 2023
New Cheat sheet

Redesign Essentials

Sep 2023
Sep 2023
Aug 2023
New Pattern

Task delegation

Aug 2023
Aug 2023
New Pattern

Green Feature

Aug 2023