Graph-Based Production Scheduling Logic for New Manufacturing Lines

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing technologies struggle to configure production scheduling logic for manufacturing lines without similar past records, leading to inefficiencies in source code development and production scheduling.

Innovation Solution

An information processing apparatus that includes a processor and memory, which identifies graphs of manufacturing lines, extracts tasks, and selects scheduling logic based on task information and rules, enabling appropriate configuration even without similar past records.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of time

If source code reuse based on past mathematical models is used, then development time is reduced, but it cannot handle new cases without similar past records

Engineering Contradiction:
Improvesource code development timeVSAvoidcapability to handle new cases
Core Design Contradiction:
Loss of timeVSAdaptability or versatility

Solution Approach 1:

The patent segments the production scheduling problem into basic modules (graph units) that can be independently identified and recombined. By breaking down complex manufacturing lines into standardized graph components, the system can efficiently match and reuse existing source code for common patterns while maintaining the ability to handle new cases through modular composition.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a graph-based dimensional representation for manufacturing lines, transforming traditional flat process flow descriptions into structured graph models with nodes and edges. This dimensional change enables more sophisticated matching and reuse of production scheduling logic across different manufacturing scenarios.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Adaptability or versatility

If comprehensive production scheduling logic is created for all possible process flows, then all cases can be handled, but system complexity increases significantly

Engineering Contradiction:
Improvecoverage of process flowsVSAvoidproduction scheduling system complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent creates universal graph-based basic modules that can represent multiple process flow patterns. These standardized graph units serve multiple functions across different manufacturing scenarios, enabling a single modular framework to handle diverse production scheduling requirements without requiring separate complex logic for each case.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The patent uses parameter-based graph representations where manufacturing lines are described through configurable parameters (nodes, edges, attributes). By changing parameters rather than restructuring entire scheduling systems, the same framework can adapt to different process flows, reducing overall system complexity.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS12405602B2Information processing apparatus, information processing system, and information processing method
Publication Date: 2025.09.02 HITACHI LTD
  • US12405602B2 patent drawing
  • US12405602B2 patent drawing
  • US12405602B2 patent drawing

AI summary

Even if there is no similar record of plan generation for a manufacturing line, a logic of production scheduling is appropriately configured. An information processing apparatus stores a graph showing a manufacturing line configured to manufacture a plurality of items, task information indicating graphs showing basic modules and tasks of production scheduling, and a rule for selecting a logic of the production scheduling based on the tasks, identifies graphs showing basic modules included in the graph showing the manufacturing line by referring to the task information, extracts tasks corresponding to the identified graphs of the basic modules, selects a logic corresponding to the extracted tasks by referring to the rule, and outputs information indicating the selected logic.