Directional Genetic Scheduling for On-Time Jobs and Low Inventory

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Current genetic algorithm-based scheduling systems often result in jobs being completed too early, leading to disruptive downstream processes and excessive inventory buildup, while backward scheduling can schedule tasks in the past, making them impractical.

Innovation Solution

A computing device implements directional scheduling within a genetic algorithm, allowing jobs to be backward scheduled if possible, and switching to forward scheduling when necessary, ensuring tasks are completed on time without excess inventory.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If backward scheduling is used to schedule jobs from due date backward, then on-time completion is improved, but tasks may be scheduled to start in the past which makes them impractical

Engineering Contradiction:

Improveon-time completionVSAvoidpracticality of schedule

Core Design Contradiction:

ReliabilityVSEase of operation

Solution Approach 1:

The patent applies dynamics by making the scheduling direction adjustable rather than fixed. The system dynamically switches between backward scheduling (to ensure on-time completion) and forward scheduling (to maintain practicality), allowing the scheduling approach to adapt based on the specific constraints and requirements of each job, thereby resolving the contradiction between reliability and ease of operation

Inventive Principle:

Principle #15Dynamics

Solution Approach 2:

The patent changes the parameter of scheduling direction from a static choice to a dynamic variable. By adjusting the scheduling direction parameter between backward and forward modes depending on job characteristics and constraints, the system achieves both on-time completion and practical implementability

Inventive Principle:

Principle #35Parameter changes

2Ease of operation

If forward scheduling is used to schedule jobs from present forward, then practicality is improved, but jobs are completed too early causing downstream disruptions and excessive inventory

Engineering Contradiction:

Improvepracticality of scheduleVSAvoidexcessive inventory

Core Design Contradiction:

Ease of operationVSLoss of substance

Solution Approach 1:

The patent employs feedback mechanisms where the scheduling system continuously monitors job completion status, inventory levels, and downstream process readiness. This feedback allows the system to adjust scheduling decisions in real-time, switching between forward and backward scheduling modes to prevent both excessive inventory buildup and downstream disruptions while maintaining practicality

Inventive Principle:

Principle #23Feedback

3Productivity

If traditional genetic algorithm scheduling is used, then schedule generation is achieved, but computational load is excessive

Engineering Contradiction:

Improveschedule generation capabilityVSAvoidcomputational load

Core Design Contradiction:

ProductivityVSUse of energy by moving object

Solution Approach 1:

The patent applies segmentation by dividing the scheduling problem into smaller sub-problems that can be handled more efficiently. Instead of optimizing the entire schedule at once using traditional genetic algorithms, the system segments the scheduling task into manageable portions that can be processed with reduced computational load while still achieving effective schedule generation

Inventive Principle:

Principle #1Segmentation

Data Source

PatentUS20260017102A1Directional scheduling within a genetic algorithm

Publication Date: 2026.01.15 NMETRIC LLC

AI summary

Systems and methods in which a scheduling computing system reduces the computational load required by a computing device to generate a schedule by generating a schedule of tasks within a genetic algorithm using directional scheduling within the genetic algorithm. To do so, the computing device is programmed to obtain a plurality of jobs and determine whether the jobs can be backward scheduled. If so, the computing device fits the job, task by task, into the schedule via backward scheduling.