Workflow Scheduling Optimization via Stochastic Constraint Programming

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Current workflow planning lacks efficient mechanisms for modeling and managing resource demands, as well as optimizing scheduling to achieve business targets, particularly during peak seasonal workloads, leading to challenges in resource allocation and workflow completion.

Innovation Solution

The implementation of constraint programming and linear programming in conjunction with stochastic modeling to optimize resource allocation and scheduling, allowing for dynamic resource assignment, task interleaving, and 'what if' analysis to ensure workflow constraints and business objectives are met.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional workflow planning is used, then the system is simple to operate, but it lacks efficient mechanisms for modeling and managing resource demands and optimizing scheduling

Engineering Contradiction:

Improveworkflow execution efficiencyVSAvoidscheduling system complexity

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent replaces manual workflow planning and scheduling with automated constraint programming and linear programming systems. The mechanical system of manual resource allocation is substituted with computational algorithms that automatically optimize scheduling based on constraints and objectives, thereby improving productivity while managing complexity through automation rather than manual processes

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

Solution Approach 2:

The patent introduces constraint programming and linear programming as intermediary mechanisms between resource availability and workflow execution. These programming frameworks act as mediators that translate complex resource constraints and workflow requirements into optimized scheduling solutions, enabling efficient resource allocation without requiring direct manual intervention in the scheduling process

Inventive Principle:

Principle #24Intermediary (Mediator)

2Reliability

If more resources are allocated to workflows, then the probability of workflow completion increases, but the resource consumption increases

Engineering Contradiction:

Improveworkflow completion probabilityVSAvoidresource consumption

Core Design Contradiction:

ReliabilityVSQuantity of substance

Solution Approach 1:

The patent applies constraint programming to dynamically adjust resource allocation parameters based on workflow constraints and objectives. By changing the parameters of resource assignment rather than simply increasing resource quantity, the system optimizes the balance between workflow completion probability and resource consumption, allocating resources efficiently based on actual workflow requirements and constraints

Inventive Principle:

Principle #35Parameter changes

Solution Approach 2:

The patent uses linear programming to determine optimal resource allocation that provides sufficient resource capacity to meet workflow completion requirements without excessive resource consumption. The system calculates the minimum necessary resource allocation needed to satisfy constraints and achieve business objectives, avoiding both under-provisioning and over-provisioning of resources

Inventive Principle:

Principle #16Partial or excessive action

3Reliability

If workflows are scheduled to meet SLA constraints, then business objectives are satisfied, but the scheduling complexity increases

Engineering Contradiction:

ImproveSLA constraint satisfactionVSAvoidscheduling optimization complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The patent replaces manual SLA-based scheduling with automated constraint programming systems that handle SLA constraints mathematically. The mechanical process of manually coordinating SLA requirements is substituted with computational algorithms that automatically find schedules satisfying all constraints, reducing the operational complexity of meeting SLA requirements while maintaining reliability

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

Solution Approach 2:

The patent applies preliminary action by using constraint programming to pre-determine optimal schedules that satisfy SLA constraints before workflows execute. The system performs preliminary scheduling optimization based on forecasted workloads and constraints, establishing schedules in advance that guarantee SLA compliance without requiring complex real-time adjustments during execution

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS8583467B1Method and system for optimized scheduling of workflows

Publication Date: 2013.11.12 FMR CORP

AI summary

A computer-implemented method is provided for optimizing scheduling and resource allocation for a workflow. The method includes receiving i) resource information representing resources available for allocation to the workflow and ii) one or more workflow constraints. The method determines one or more probable sequences for executing the workflow. Each probable sequence includes tasks usable to execute at least a portion of the workflow. Each task is assigned a probability of task execution. The method assigns a probability of sequence execution to each of the probable sequences based on the probability of task execution of the tasks forming the probable sequence. The method further determines an optimized scenario for scheduling the workflow based on the probable sequences. The optimized scenario can have an optimized probability of completion.