# US 12,008,499 B2 · Information processing device, work planning method, and storage medium

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 12,008,499 B2
- Document ID: US12008499B2
- Status: Granted
- Kind: B2
- Application number: 17/691,166
- Filed: 2022-03-10
- Published: 2023-01-19
- Granted: 2024-06-11
- Earliest claimed: 2021-07-16
- Assignees: Fujitsu Limited
- Applicants: Fujitsu Limited
- Inventors: Toshiyuki Shibuya; Daichi Shimada; Kenji Gotsubo; Takafumi Anraku
- Web page: https://patentgrep.com/patent/US12008499B2

## CPC

- G06Q 10/0631: Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q 10/06316: {Sequencing of tasks or work}
- G06Q 10/04: Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202)
- G06Q 10/0633: Workflow analysis
- G06Q 50/04: Manufacturing
- Y02P 90/30: Computing systems specially adapted for manufacturing
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- Y02P: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS

## Abstract

A non-transitory computer-readable storage medium storing a work planning program that causes at least one computer to execute a process, the process includes dividing a plurality of objects into a plurality of groups according to a type of a constraint condition set to each of the plurality of objects, the constraint condition being related to an order in which the plurality of objects are worked in a work line; and acquiring an order of the plurality of objects in the work line so that the constraint condition is satisfied in each of the plurality of groups.

## Claims

### Claim 1

A non-transitory computer-readable storage medium storing a work planning program that causes a computer, which is configured to perform work planning for a multiproduct mixed flow work using a mathematical programming solver, to execute a process, the process comprising:
obtaining a plurality of objects from product data stored in a memory of the computer, each of the plurality of objects included in the product data being associated with one or more constraint conditions of a plurality of constraint conditions, each of the plurality of constraint conditions being a constraint condition related to an order in which the plurality of objects are worked in a work line of the multiproduct mixed flow work;
dividing a plurality of objects into a plurality of groups by assigning, for each object of the plurality of objects, a label from among a plurality of labels based on a type of the one or more constraint conditions set to the object, each of the plurality of labels being a label classified to any one of the plurality of groups, each group of the plurality of groups including, among the plurality of objects, one or more objects each of which is assigned with a same label of the plurality of label;
optimizing, for each group of the plurality of groups, an order of the one or more objects included in the group in the work line by using the mathematical programming solver so that each of the one or more constraint conditions common to the one or more objects included in the group is satisfied; and
outputting an optimization result by using results obtained by the optimizing performed for each group of the plurality groups.

### Claim 2 (depends on 1)

The non-transitory computer-readable storage medium according to claim 1, wherein the optimizing includes optimizing the order so that each constraint condition between adjacent groups is satisfied.

### Claim 3 (depends on 1)

The non-transitory computer-readable storage medium according to claim 1, wherein the dividing includes:
calculating, for each label of the plurality of labels, an appearance rate being a rate of a number of objects assigned with the label;
dividing, based on the appearance rate of each label, the plurality of objects into the plurality of groups so as to reduce unbalance among the plurality of groups in the number of objects belonging to each group.

### Claim 4 (depends on 1)

The non-transitory computer-readable storage medium according to claim 1, wherein the plurality of constraint conditions includes a condition that provides a predetermined interval between certain objects to which a same work is performed in the work line and that works one or more other objects during the predetermined interval between the certain objects.

### Claim 5 (depends on 1)

The non-transitory computer-readable storage medium according to claim 1, wherein one of the plurality of constraint conditions is determined using a formula of:
|j1−j2|≥CmXi1j1Xi2j2
∀(i1,i2)∈Rm,∀(j1,j2),m∈M (3)
wherein M represents a set constraint m regarding an interval of the plurality of objects, Cm represents a distance of the interval to be followed in the m, and Rm represents a set of the plurality of objects to which the m is applied.

### Claim 6

An information processing device configured to perform work planning for a multiproduct mixed flow work using a mathematical programming solver, the information processing device comprising:
one or more memories; and
one or more processors coupled to the one or more memories, the one or more processors being configured to perform processing including:
obtaining a plurality of objects from product data stored in the one or more memories, each of the plurality of objects included in the product data being associated with one or more constraint conditions of a plurality of constraint conditions, each of the plurality of constraint conditions being a constraint condition related to an order in which the plurality of objects are worked in a work line of the multiproduct mixed flow work;
dividing a plurality of objects into a plurality of groups by assigning, for each object of the plurality of objects, a label from among a plurality of labels based on a type of the one or more constraint conditions set to the object, each of the plurality of labels being a label classified to any one of the plurality of groups, each group of the plurality of groups including, among the plurality of objects, one or more objects each of which is assigned with a same label of the plurality of label;
optimizing, for each group of the plurality of groups, an order of the one or more objects included in the group in the work line by using the mathematical programming solver so that each of the one or more constraint conditions common to the one or more objects included in the group is satisfied; and
outputting an optimization result by using results obtained by the optimizing performed for each group of the plurality groups.

### Claim 7 (depends on 6)

The information processing device according to claim 6, wherein the optimizing includes optimizing the order so that each constraint condition between adjacent groups is satisfied.

### Claim 8 (depends on 6)

The information processing device according to claim 6, wherein the dividing includes:
calculating, for each label of the plurality of labels, an appearance rate being a rate of a number of objects assigned with the label,
dividing, based on the appearance rate of each label, the plurality of objects into the plurality of groups so as to reduce unbalance among the plurality of groups in the number of objects belonging to each group.

### Claim 9 (depends on 6)

The information processing device according to claim 6, wherein the plurality of constraint conditions includes a condition that provides a predetermined interval between certain objects to which a same work is performed in the work line and that works one or more other objects during the predetermined interval between the certain objects.

### Claim 10

A work planning method implemented by a computer, which is configured to perform work planning for a multiproduct mixed flow work using a mathematical programming solver, the work planning method comprising:
obtaining a plurality of objects from product data stored in a memory of the computer, each of the plurality of objects included in the product data being associated with one or more constraint conditions of a plurality of constraint conditions, each of the plurality of constraint conditions being a constraint condition related to an order in which the plurality of objects are worked in a work line of the multiproduct mixed flow work;
dividing a plurality of objects into a plurality of groups by assigning, for each object of the plurality of objects, a label from among a plurality of labels based on a type of the one or more constraint conditions set to the object, each of the plurality of labels being a label classified to any one of the plurality of groups, each group of the plurality of groups including, among the plurality of objects, one or more objects each of which is assigned with a same label of the plurality of label;
optimizing, for each group of the plurality of groups, an order of the one or more objects included in the group in the work line by using the mathematical programming solver so that each of the one or more constraint conditions common to the one or more objects included in the group is satisfied; and
outputting an optimization result by using results obtained by the optimizing performed for each group of the plurality groups.

### Claim 11 (depends on 10)

The work planning method according to claim 10, wherein optimizing includes optimizing the order so that each constraint condition between adjacent groups is satisfied.

### Claim 12 (depends on 10)

The work planning method according to claim 10, wherein the dividing includes:
calculating, for each label of the plurality of labels, an appearance rate being a rate of a number of objects assigned with the label,
dividing, based on the appearance rate of each label, the plurality of objects into the plurality of groups so as to reduce unbalance among the plurality of groups in the number of objects belonging to each group.

### Claim 13 (depends on 10)

The work planning method according to claim 10, wherein the plurality of constraint conditions includes a condition that provides a predetermined interval between certain objects to which a same work is performed in the work line and that works one or more other objects during the predetermined interval between the certain objects.