Dynamic Task Scheduling with Priority-Based Rearrangement
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing information processing systems fail to effectively rearrange tasks in a schedule when a new task with higher priority is introduced, often not placing it before a registered task with lower priority, which hampers efficient task management.
Innovation Solution
An information processing system that links task management and schedule management, allowing for the automatic arrangement of new tasks based on the priority, deadline, difficulty, and work type of both new and registered tasks, and rearranging registered tasks as needed to accommodate the new ones, ensuring optimal scheduling.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a new task is automatically registered in the schedule without rearranging existing tasks, then the schedule structure remains stable, but the new task cannot be properly prioritized over existing lower-priority tasks
Solution Approach 1:
The schedule management system dynamically adjusts task arrangements based on priority levels. When a new task is registered, the system automatically evaluates its priority against existing tasks and rearranges the schedule accordingly, making the schedule flexible rather than static. This resolves the contradiction by allowing priority management to improve while the system adapts its complexity only when necessary.
Solution Approach 2:
The system performs self-service by automatically rearranging tasks based on priority rules without requiring manual intervention. The schedule management apparatus autonomously evaluates task priorities, determines optimal time slots, and adjusts the schedule structure, thereby improving priority management while avoiding the complexity of manual schedule rearrangement processes.
2Productivity
If the schedule is rigidly maintained without automatic rearrangement, then the existing schedule structure is preserved, but efficient task management with priority-based scheduling cannot be achieved
Solution Approach 1:
The schedule management system automatically performs rearrangement operations based on task priority, eliminating the need for manual schedule adjustment. This self-service mechanism improves task management efficiency by ensuring high-priority tasks are properly scheduled while removing the operational burden from users.
Solution Approach 2:
The system incorporates feedback mechanisms that monitor task priorities and automatically trigger rearrangement operations when priority changes occur. This feedback loop ensures that task management efficiency is maintained through automatic adjustments, while users are freed from manual operation complexity.
3Measurement precision
If manual schedule adjustment is required for each new task, then precise control over task placement is achieved, but the operation becomes complex and time-consuming
Solution Approach 1:
The system automatically determines optimal task placement based on priority levels and schedule constraints, achieving precise task placement without manual intervention. This self-service approach maintains measurement precision for task placement while eliminating the operational complexity of manual schedule editing.
Solution Approach 2:
The system uses feedback from task priority information and existing schedule structure to automatically calculate optimal placement positions. This feedback-driven automatic placement achieves the same precision as manual adjustment would provide, but without the operational burden.
4Productivity
If automatic task arrangement is implemented, then task management efficiency improves, but the system complexity increases
Solution Approach 1:
The system implements dynamic arrangement processing that activates automatically when tasks are registered or priorities change. This dynamic approach improves schedule management efficiency by performing arrangements only when necessary, rather than maintaining constant complex processing, thus balancing productivity improvement with acceptable system complexity.
Data Source
AI summary
An apparatus, system, method, and a program stored on a non-transitory recording medium, each of which: acquires a registered task arranged in a schedule; arranges a new task in the schedule, based on the arrangement of the registered task; and changes the arrangement of the registered task, based on the arrangement of the new task.