Constraint-Based Task Scheduling for Feasible Production Plans
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing process planning methods rely on unsupportable schedule-based assumptions, leading to erroneous models and conflicts between general managers, project managers, resource managers, and subject matter experts, resulting in infeasible plans and costly rework in complex projects.
Innovation Solution
The approach separates tasks into closure and precursor portions based on input availability, allowing for finish-to-start relationships and data-driven scheduling, which distinguishes between parallel and serial activities, and constructs schedules using critical path or alpha chain algorithms to create robust and resource-feasible plans.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If schedule-based planning methods are used, then planning simplicity is maintained, but plan feasibility deteriorates due to conflicts between managers and experts
Solution Approach 1:
The patent replaces traditional schedule-based planning mechanisms with a constraint-based planning system that uses logical relationships and resource constraints to generate feasible plans automatically, eliminating the need for manual schedule adjustment and reducing conflicts between stakeholders
Solution Approach 2:
The patent introduces a planning system that acts as an intermediary between managers and subject matter experts, translating managerial requirements into constraint models that automatically generate feasible schedules without direct conflict between parties
2Productivity
If traditional schedule-based planning is used, then planning speed is maintained, but rework costs increase due to infeasible plans
Solution Approach 1:
The patent performs preliminary constraint analysis and feasibility checking before final plan generation, identifying potential conflicts and infeasibilities early in the planning process to prevent costly rework later
Solution Approach 2:
The patent implements feedback mechanisms where the planning system continuously monitors plan feasibility against resource constraints and automatically adjusts schedules to maintain feasibility, preventing the accumulation of errors that lead to rework
3Device complexity
If discrete schedule estimates are used, then planning complexity is reduced, but measurement precision deteriorates
Solution Approach 1:
The patent transforms discrete schedule estimates into continuous constraint models with precise logical relationships, allowing for more accurate representation of task dependencies and resource requirements while maintaining computational tractability
Data Source
AI summary
A method is provided that includes receiving process-related information describing a logical sequence of tasks to produce respective internal products of a process for production of a product. At least some of the tasks have a precedence relationship whereby the internal product produced by one task is an input utilized or required by another task. The method includes for at least some of the tasks, separating each of the at least some of the tasks into a closure portion that requires availability of the last input of its task before being initiated, and a distinct precursor portion capable of being initiated before the respective last input is available; and constructing a schedule for execution of the at least some of the tasks. Construction of the schedule includes temporally sequencing the closure portions of the respective tasks without intervening precursor portions, and prepending the precursor portions to respective, temporally-sequenced closure portions.