Production Timing Computation for Overlapping Constraint Scheduling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods struggle to plan a production order that satisfies specification constraints while observing period constraints, especially when there is partial overlap in period constraints, leading to inefficiencies and increased calculation times.
Innovation Solution
A computer-readable recording medium storing a computation program that calculates probabilities for each processing specification and timing, sums these probabilities, and uses cumulative sums to determine optimal processing timings that balance specification constraints with period constraints.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If existing methods are used to plan production orders with partial overlap in period constraints, then calculation time increases and efficiency decreases, but the ability to satisfy both specification and period constraints is maintained
Solution Approach 1:
The patent segments the production planning problem by dividing objects into groups based on their period constraints and specification requirements. This segmentation allows the system to handle partial overlaps in period constraints more efficiently by processing segmented data rather than treating all objects uniformly, thereby reducing calculation time while maintaining constraint satisfaction.
Solution Approach 2:
The patent changes key parameters including probability values representing the likelihood of selecting each object at each timing, cumulative sum values for determining optimal processing sequences, and weighting factors for different constraint types. By dynamically adjusting these parameters based on period constraint overlaps and specification requirements, the system optimizes production planning efficiency without sacrificing constraint satisfaction.
2Reliability
If complex calculation methods are used to handle partial overlap in period constraints, then constraint satisfaction improves, but computational complexity increases
Solution Approach 1:
The patent performs preliminary actions by pre-calculating probability values for each object at each processing timing based on their period constraints and specification requirements. Cumulative sum values are also pre-computed to facilitate rapid determination of optimal processing sequences. This preliminary computation reduces the complexity of real-time decision-making while ensuring constraint satisfaction is maintained.
Solution Approach 2:
The patent introduces intermediary computational elements including probability distributions as mediators between period constraints and processing timing decisions, and cumulative sum values as intermediaries for determining optimal sequences. These intermediary structures simplify the relationship between complex constraints and processing decisions, reducing computational complexity while maintaining reliability.
Data Source
AI summary
A computer-readable recording medium storing a program for causing a computer to execute: on a condition that each of objects is processed at any of a plurality of processing timings for which an order is determined, a processing specification is determined for each of the objects, a processing period in which processing is performed for each of the objects is determined, and the processing period includes one or more of the processing timings, calculating a probability obtained as a reciprocal of a number of the processing timings included in the processing period for each of the processing specifications of the objects, for each processing timing; calculating a sum of probabilities of the processing specifications for each processing timing; and calculating a cumulative sum of sums of the probabilities for the processing timing; and specifying the processing timings of the objects by using the cumulative sum.