Batch Job Critical Path Traversal for Schedule Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Manual scheduling of batch jobs in large computer systems becomes impractical due to the complexity of managing hundreds or thousands of jobs with interdependencies and time constraints, making it difficult to quickly adjust schedules in response to delays or additions without extending completion times.
Innovation Solution
A computer system identifies jobs within a critical path that, when rescheduled, would have the greatest impact on reducing completion times by analyzing time gaps between jobs and traversing dependent job flows in reverse chronological order, allowing for automated identification and adjustment of critical path jobs to optimize execution times.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If manual scheduling of batch jobs is performed to meet execution time requirements, then job completion times can be controlled, but the complexity of managing hundreds or thousands of jobs with interdependencies makes it impractical and time-consuming
Solution Approach 1:
The system automatically identifies critical path jobs and calculates their impact on completion times without requiring manual operator intervention. The processor autonomously analyzes job interdependencies, determines which jobs to reschedule, and provides recommendations for reducing time gaps, enabling the scheduling system to serve itself rather than requiring manual management of complex job flows
Solution Approach 2:
The patent replaces the mechanical manual scheduling process with an automated computational system. Instead of operators manually analyzing job dependencies and adjusting schedules, a processor executes algorithms to automatically identify critical path jobs, calculate time gaps, and determine optimal rescheduling options, substituting human mechanical operations with automated information processing
2Productivity
If the schedule is quickly restructured in response to delays or job additions, then completion times can be maintained, but the volume of information required makes practical adjustment difficult or impossible
Solution Approach 1:
The system extracts and focuses attention on only the critical path jobs that actually impact completion times, rather than presenting operators with the entire schedule. By identifying and isolating the subset of jobs whose rescheduling will have the greatest impact, the system reduces the information volume from hundreds or thousands of jobs to a manageable few critical jobs, making quick adjustment feasible
Solution Approach 2:
The patent segments the complex job schedule into distinct components: critical path jobs and non-critical jobs. By separating the critical path analysis from the rest of the schedule, the system allows operators to focus on adjusting only the critical segment that determines completion times, while leaving non-critical jobs unchanged, thereby simplifying the adjustment process
3Quantity of substance
If more jobs are added or delays occur, then processing capacity is increased, but the likelihood of pushing completion times beyond required times increases
Solution Approach 1:
The system continuously monitors the schedule and automatically recalculates critical path jobs when changes occur (job additions, delays). This feedback mechanism detects scheduling violations or potential violations and triggers automatic identification of jobs that need rescheduling, allowing the system to adapt to changes in job quantity or timing while maintaining completion time requirements
Solution Approach 2:
The system performs preliminary identification of critical path jobs and potential completion time violations before they become actual problems. By proactively analyzing the schedule and identifying jobs that would be affected by upcoming changes, the system allows operators to make preventive adjustments rather than reactive corrections, maintaining reliability even as job quantities increase
Data Source
AI summary
Systems and methods for improved batch flow management are described. At least some embodiments include a computer system for managing a job flow including a memory storing a plurality of batch queue jobs grouped into Services each including a job and a predecessor job. A time difference is the difference between a scheduled job start time and an estimated predecessor job end time. Jobs with a preceding time gap include jobs immediately preceded only by non-zero time differences. The job start depends upon the predecessor job completion. The computer system further includes a processing unit that identifies jobs preceded by a time gap, selects one of the Services, and traverses in reverse chronological order a critical path of dependent jobs within the Service until a latest job with a preceding time gap is identified or at least those jobs along the critical path preceded by another job are traversed.