Planner and Scheduler for IT Change Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current change management processes in computing systems are manual, time-consuming, and prone to errors, making it difficult to create effective plans and schedules for accommodating multiple change requests within a change window.
Innovation Solution
A system and method for planning and scheduling tasks within a computing system that includes deciding whether to perform a Request For Change (RFC), assigning tasks to acceptable servers, and determining start times for each task, using a Planner and Scheduler (P&S) that employs randomized algorithms to maximize profits by optimizing task execution within constraints.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If manual change management processes are used, then flexibility in handling individual changes is maintained, but time consumption and error rates increase significantly
Solution Approach 1:
The system enables automated self-service change management where the planning and scheduling system automatically generates change plans and schedules without manual intervention. The system autonomously processes RFCs, assigns tasks to servers, determines optimal execution times, and manages dependencies, transforming a manual service into an automated self-executing process that dramatically improves efficiency while reducing time loss.
2Productivity
If multiple RFCs are processed concurrently, then overall system change capacity increases, but complexity of coordination and scheduling increases
Solution Approach 1:
The system segments the complex scheduling problem into distinct manageable components: RFC acceptance decisions, task decomposition, server assignment, time scheduling, and dependency management. Each segment is handled by specialized algorithms that work independently but coordinate through standardized interfaces, allowing concurrent processing of multiple RFCs while maintaining manageable complexity through modular architecture.
Solution Approach 2:
The system dynamically adjusts scheduling parameters such as change window timing, server resource allocation, task priority levels, and dependency constraints based on system state and RFC characteristics. By treating scheduling as a parameter optimization problem rather than a fixed process, the system can efficiently coordinate multiple concurrent RFCs by continuously adapting parameters to balance workload and resolve conflicts.
3Productivity
If automated planning and scheduling is implemented, then efficiency and accuracy improve, but system complexity increases
Solution Approach 1:
The automated planning and scheduling system is designed as a universal multi-functional platform that handles diverse RFC types, multiple server environments, various dependency scenarios, and different scheduling constraints through a single integrated architecture. This universal design consolidates what would otherwise require multiple specialized tools into one system, improving efficiency while managing complexity through unified rather than distributed functionality.
Data Source
AI summary
Methods and arrangements for planning and scheduling change management requests in computing systems are disclosed. Included are an arrangement for deciding whether or not an RFC should be done, an arrangement for assigning individual tasks to acceptable servers for each RFC to be done, and an arrangement for assigning the start times to said individual tasks for each RFC to be done.