WO2023276108A1 - Programme de simulation, procédé de simulation et dispositif de traitement d'informations - Google Patents

Programme de simulation, procédé de simulation et dispositif de traitement d'informations Download PDF

Info

Publication number
WO2023276108A1
WO2023276108A1 PCT/JP2021/024939 JP2021024939W WO2023276108A1 WO 2023276108 A1 WO2023276108 A1 WO 2023276108A1 JP 2021024939 W JP2021024939 W JP 2021024939W WO 2023276108 A1 WO2023276108 A1 WO 2023276108A1
Authority
WO
WIPO (PCT)
Prior art keywords
work
simulation
objects
time
product
Prior art date
Application number
PCT/JP2021/024939
Other languages
English (en)
Japanese (ja)
Inventor
猪谷宜彦
長門毅
山▲崎▼貴司
Original Assignee
富士通株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 富士通株式会社 filed Critical 富士通株式会社
Priority to PCT/JP2021/024939 priority Critical patent/WO2023276108A1/fr
Publication of WO2023276108A1 publication Critical patent/WO2023276108A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00—Programme-control systems
    • G05B19/02—Programme-control systems electric
    • G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]

Definitions

  • This case relates to a simulation program, a simulation method, and an information processing device.
  • KPIs Key Performance Indicators
  • a non-operating time period is set for each device that works on an object in the work line, there may be objects that cannot complete the work within the workable time of the device. If such an object cannot be assigned to the device and remains during the calculation during the simulation, the calculation time will be extended.
  • an object of the present invention is to provide an information processing device, a specifying method, and a specifying program capable of reducing unnecessary calculation time.
  • a simulation program is provided in a computer, for a movement route provided with a plurality of work subjects that sequentially work on a plurality of objects, each of the plurality of work subjects includes: of the plurality of objects to the movement route on the condition that the work time required to process each of them is defined and that at least one of the plurality of work subjects has a non-operating time zone defined.
  • FIG. 10 is a diagram exemplifying the details of a simulation when products A, B, C, and D are put into a work line in this order; 5 is a diagram showing the simulation procedure of FIG. 4 as a flow chart; FIG. FIG. 10 is a flowchart showing a procedure for optimizing the loading order; (a) to (c) are diagrams for explaining non-operating time periods and unallocated items.
  • FIG. 1A is a functional block diagram showing the overall configuration of an information processing apparatus according to a first embodiment
  • FIG. 1B is a block diagram illustrating the hardware configuration of each part of the information processing apparatus
  • FIG. FIG. 4 is a diagram illustrating non-operating time zones for each device
  • FIG. 4 is a diagram illustrating cost factors for each device
  • It is the figure which represented the optimization process as a flowchart.
  • (a) to (c) are diagrams illustrating detection of unallocated items. It is a flowchart showing the detail of the simulation process of step S23. It is a figure for demonstrating an effect.
  • FIG. 1(a) is an example of a work line.
  • each product which is an object of work, advances from Start to Goal.
  • a work line is a movement route provided with one or more devices that sequentially work on each of a plurality of products.
  • each product passes through an apparatus 1-1 in which step 1 is carried out, and further through an apparatus 2-1 or 2-2 in which step 2 is carried out.
  • product A is processed in units of 20 hours by device 1-1.
  • the product A can be worked on either the device 2-1 or the device 2-2, but the work time differs between the device 2-1 and the device 2-2.
  • Product C can be worked with the device 2-1, but cannot be worked with the device 2-2. Therefore, product C cannot pass through device 2-2. In this way, whether work is possible or not is determined for each product.
  • KPI Key Performance Indicator
  • FIGS. 3(a) to 3(c) are diagrams illustrating product movement rules in the simulation.
  • FIG. 3(a) shows the work line illustrated in FIG. 1(a).
  • FIG. 3(b) is a model representing the work line of FIG. 3(a) with a plurality of cells.
  • FIG. 3(c) is a diagram exemplifying the relationship between work time and workability for each product in FIG. 1(b).
  • the work line model includes moving cells, equipment cells, and allocation cells.
  • the operations of mobile cells, equipment cells, and allocation cells are on a time unit basis.
  • the moving cell is a cell for moving the product in the direction of the arrow for each time unit.
  • An equipment cell is a cell that performs work on a product. The product stays in the device cell for the working time designated in FIG. 3(c). If one product stays in the equipment cell, other products cannot enter the equipment cell.
  • the assigned cell is the cell located at the beginning of each process. Multiple products can reside in an allocation cell.
  • the allocation cell determines the device to be moved and the timing for each unit of time according to the operating status of the device and whether or not the work can be performed as specified in FIG. 3(c).
  • the allocation cell moves each product to the equipment cell in order, giving priority to the order of loading.
  • the assigned cell gives priority to product B over product C if the work of product B can be completed within the workable time of device 1-1. and move it to the device 1-1. If the work for product B cannot be completed within the workable time of device 1-1 and the work for product C can be completed, the assigned cell does not move product B and to the device 1-1.
  • the order of product A, product B, and product C is specified in the input order, it is assumed that product A is being worked on by device 2-1. In this case, it is assumed that the work-completed product B and product C arrive at the top allocation cell of step 2. If the work for product B can be completed within the workable time of device 2-2, the assignment cell moves product B to device 2-2 in preference to product C. If the work for product B cannot be completed within the workable time of device 2-2 and the work for product C can be completed, the assigned cell does not move product B and to the device 2-2.
  • FIG. 4 is a diagram exemplifying the details of a simulation when products A, B, C, and D are put into the work line in this order.
  • a non-operating time zone which will be described later, is not set for each device.
  • the product A moves to the device 1-1.
  • the apparatus 1-1 work is performed on the product A for the designated work time.
  • the product B cannot be moved to the device 1-1 and waits.
  • the product A in the device 1-1 is completed, the product A moves to the device 2-1.
  • the device 2-1 work is performed on the product A for the designated work time unit.
  • Product B moves to device 1-1.
  • work is performed on the product B for the designated work time unit.
  • Each diagram on the right side of FIG. 4 is a diagram exemplifying the status of allocation of each product to each device.
  • the horizontal axis indicates elapsed time. If no product has been moved to the device yet, no product is assigned to each device.
  • the device 1-1 allocates a schedule for the work time unit of the product A.
  • a schedule for the unit of work time for product A is assigned in device 2-1, and the work time for product B in device 1-1 is assigned.
  • a schedule for the unit will be assigned. In this way, each product is assigned to each device.
  • FIG. 5 is a diagram showing the simulation procedure of FIG. 4 as a flow chart.
  • time t which is a time variable
  • step S1 time t
  • step S2 time t
  • step S3 it is determined whether or not the simulation has ended. If “No” is determined in step S3, 1 is added to time t (step S4). After that, the process is executed again from step S2. If it is determined as "Yes” in step S3, KPIs such as work completion time and cost are calculated (step S5). After that, the flow chart ends.
  • steps S2 to S4 are repeated 20 times.
  • the time t reaches 21
  • the work for the time unit specified by the device 1-1 is performed on the product B
  • the work for the time unit specified by the device 2-1 or the device 2-2 is performed on the product A. done.
  • the work for all the products is completed and all the products reach the goal, it is judged as "Yes" in step S3.
  • FIG. 6 is a flowchart showing the procedure for optimizing the input order.
  • an initial value for the order in which each product is to be supplied to the work line is set (step S11).
  • the simulation process of FIG. 5 is executed using the specified input order (step S12).
  • it is determined whether or not the number of repetitions has reached a predetermined value is the number of times step S12 is executed. If it is determined as "No" in step S13, the next injection order is set by the optimization algorithm (step S14). After that, the process is executed again from step S13. If "Yes" is determined in step S13, an optimum work plan is selected based on the KPI values (step S15). Execution of the flowchart then ends.
  • the work planning deadline is a deadline for the time range for each product to reach the goal after the first product is put into the work line. If the deadline for drafting the work plan is exceeded, the work cannot be carried out.
  • non-operating time periods such as break time and maintenance time are set, there is a possibility that a specific device may not be able to work on products requiring long working hours. Therefore, if a non-operating time zone is set, there is a possibility that some products (hereinafter referred to as unassigned products) cannot be worked on no matter how the products are rearranged. This unallocated item continues to remain during the calculation during the simulation, which extends the calculation time.
  • each device is set with a non-operating time zone during which work cannot be performed. If the work time for product B in process 2 is set to be long, the work may not be completed within the workable time of devices 2-1 and 2-2 by the work planning deadline. In this case, the product B cannot be moved to either the device 2-1 or the device 2-2. As described above, although priority is given to the order in which products are placed in the assigned cell, products that cannot be moved to the next device are allowed to stay in the assigned cell.
  • both processes 1 and 2 are performed for product A, product C, and product D, but for product B, the process 2 is performed after the process 1 is performed.
  • the product B cannot be moved from the first allocated cell in step 2.
  • the simulation continues until the work planning deadline under the condition that the product B cannot proceed to the step 2. That is, even after product A, product C, and product D reach the goal, the process of confirming that product B cannot proceed to process 2 is repeatedly performed in each time unit until the deadline for creating the work plan. It will be. Therefore, as exemplified in FIG. 7(a), extra calculation time is generated.
  • FIG. 8(a) is a functional block diagram showing the overall configuration of the information processing apparatus 100 according to the first embodiment.
  • the information processing apparatus 100 is a server or the like for optimization processing.
  • the information processing apparatus 100 includes a model storage unit 10, a work master storage unit 20, a non-operating time zone storage unit 30, an input order storage unit 40, a cost coefficient storage unit 50, a work time It includes a band calculation unit 60, an optimization execution unit 70, an identification unit 80, a result output unit 90, and the like.
  • the optimization execution unit 70 includes a simulation unit 71 , a determination unit 72 and an exclusion unit 73 .
  • FIG. 8(b) is a block diagram illustrating the hardware configuration of each part of the information processing device 100.
  • the information processing apparatus 100 includes a CPU 101, a RAM 102, a storage device 103, an input device 104, a display device 105, and the like.
  • a CPU (Central Processing Unit) 101 is a central processing unit.
  • CPU 101 includes one or more cores.
  • a RAM (Random Access Memory) 102 is a volatile memory that temporarily stores programs executed by the CPU 101, data processed by the CPU 101, and the like.
  • the storage device 103 is a non-volatile storage device. As the storage device 103, for example, a ROM (Read Only Memory), a solid state drive (SSD) such as a flash memory, a hard disk driven by a hard disk drive, or the like can be used.
  • the storage device 103 stores a simulation program according to this embodiment.
  • the input device 104 is an input device such as a mouse and keyboard.
  • the display device 105 is a display device such as a liquid crystal display. The display device 105 displays the results output by the result output unit 90 .
  • Each unit in FIG. 8A is implemented by the CPU 101 executing a specific program. Note that hardware such as a dedicated circuit may be used as each unit in FIG. 8A.
  • the model storage unit 10 stores a work line model as exemplified in FIG. 3(b).
  • the work line model may be input in advance by the user using the input device 104, for example.
  • the work master storage unit 20 stores, as a work master, the relationship between work time and work availability for each product illustrated in FIG. 3(c).
  • the work master may be input in advance by the user using the input device 104, for example.
  • the non-operating time period storage unit 30 stores non-operating time periods as a table or the like for each device.
  • FIG. 9 is a diagram illustrating non-operating time zones for each device. As illustrated in FIG. 9, the start time and end time of the non-operating time period are stored for each device. The non-operating hours may be input in advance by the user using the input device 104, for example.
  • the loading order storage unit 40 stores the initial loading order of each product included in the work master stored in the work master storage unit 20 .
  • the initial input order is, for example, the order in which the products are arranged according to the order received from the customer, and may be input in advance by the user using the input device 104 . Alternatively, the initial injection order may be generated by random numbers.
  • the cost coefficient storage unit 50 stores the cost coefficient of each device as a table or the like.
  • FIG. 10 is a diagram illustrating cost factors for each device. As illustrated in FIG. 10, a cost factor is stored for each device. For example, by calculating the operating time of the device times the cost coefficient, it is possible to calculate the total cost generated by each device. The "operating time of the device" is the total value of the working time performed by the device on each product.
  • the cost factor may be input in advance by the user using the input device 104, for example.
  • the work time slot calculation unit 60 calculates a work startable time slot in which work can be started in each device for each product (step S21).
  • the work-startable time zone can be calculated from the work master and the non-operating time zone.
  • the working time slot calculation unit 60 reads the non-operating time slot for each device from the non-operating time slot storage unit 30 .
  • the work time slot calculation unit 60 reads the work master from the work master storage unit 20 and calculates the work startable time slot for each device in a state where no product has been placed on the work line yet.
  • the work time of device 1-1 is assumed to be in units of 30 hours.
  • the work for the product D can be completed using the device 1-1. Since it is possible, it is the time when work can be started.
  • the device 1-1 can be used to complete the work for the product D during the period from the end of the non-operating time period to 30 hours before the time of the work planning deadline, the work can be started. possible time period.
  • the work-startable time period can be similarly calculated for the devices 2-1 and 2-2 as well.
  • the period from the start time of the simulation to the start time of the first non-operating time period is shorter than the working time for product D using device 2-2, so the first non-operating time period Until then, there will be no time slot in which work can be started. Since the period from the end time of the second non-operating time period to the work planning deadline is also shorter than the work time for working on the product D using the device 2-2, there is no work startable time period. .
  • the optimization execution unit 70 reads the initial placement order from the placement order storage unit 40 (step S22). Next, the optimization execution unit 70 stores the work model stored in the model storage unit 10 , the work master stored in the work master storage unit 20 , and the non-working model stored in the non-operating time storage unit 30 . A simulation is performed using the time zone (step S23).
  • the optimization execution unit 70 determines whether or not the number of repetitions of step S23 has reached a specified value (step S24). When it is determined as "No" in step S24, the optimization execution unit 70 sets the next input order using an optimization algorithm such as a genetic algorithm (step S25). For example, the input order is optimized so that the production completion time is short and the cost is low. After that, the process is executed again from step S23. By executing steps S23 to S25, the simulation is repeated for the prescribed number of input orders.
  • an optimization algorithm such as a genetic algorithm
  • step S24 the specifying unit 80 selects the optimum production plan (step S26). For example, the specifying unit 80 specifies the input order in which the KPI satisfies the desired value (step S26). The result output unit 90 outputs the input order specified by the specifying unit 80 together with the KPI and the like in the input order. Execution of the flowchart then ends.
  • FIG. 13 is a flowchart showing the details of the simulation process in step S23.
  • the simulation unit 71 sets the time t, which is a time variable, to 1 (step S31).
  • the simulation unit 71 executes processing for the t-th time unit (step S32).
  • the determination unit 72 updates the status of allocation of each product to each device (step S33).
  • the determination unit 72 checks the current process for each product and whether or not there is a work-startable time period after the current time (step S34). For example, as exemplified in FIG. 12(b), product A, product B, and product C have already been assigned to device 1 at the present time, and product A has also been assigned to device 2-1. Since product A has already been assigned to device 2-1, whether it is possible to complete the work for product B within the time range from the work completion time for product A in device 2-1 to the non-operating time zone is determined. In FIG.
  • product C is assigned to device 2-1
  • product B is assigned to device 2-2
  • workable time is short for both device 2-1 and device 2-2.
  • neither the device 2-1 nor the device 2-2 can complete the work for the product D within the workable time. Therefore, there is no time slot in which work can be started for the product D.
  • step S35 judges whether or not a product (unallocated product) with no work-startable time slot has been detected. If it is determined “No” in step S35, the simulation unit 71 determines whether or not the simulation has ended (step S36). If determined as “No” in step S36, the simulation unit 71 adds 1 to time t (step S37). After that, the process is executed again from step S32. If it is determined as "Yes” in step S36, the simulation unit 71 calculates KPI such as work completion time and cost (step S38). After that, the flow chart ends.
  • KPI such as work completion time and cost
  • step S35 the exclusion unit 73 excludes the unallocated item from the simulation (step S39).
  • product D is detected as an unallocated item.
  • step S40 judges whether or not all products have completed work or become unallocated. If the determination in step S40 is "Yes”, step S38 is executed. If “No” is determined in step S40, step S36 is executed.
  • the presence or absence of unallocated items is checked for each unit of time, and when an unallocated item is detected, the unallocated item is excluded from the simulation.
  • work completion time and work cost are used as KPIs, but they are not limited to this.
  • the number of delivery delays can be used as a KPI. Delivery delay means that the product cannot reach the goal by the delivery date.
  • the operating time of each device can be used as a KPI.
  • each device on the work line is an example of a work subject that sequentially works on each of a plurality of objects.
  • a work line is an example of a movement route provided with a plurality of the work subjects.
  • the simulation unit 71 determines that each of the plurality of work subjects has a working time required to process each of the plurality of objects, and that at least one of the plurality of work subjects has a non-operating time period.
  • An example of a simulation unit that performs a simulation on the time required for the plurality of objects to reach a predetermined point on the movement route according to the order in which the plurality of objects are thrown onto the movement route, under the condition that is.
  • the determination unit 72 For each time unit of the simulation, the determination unit 72 detects whether or not an object whose work cannot be completed in a workable time zone of any of the plurality of work subjects is detected among the plurality of objects. It is an example of a judgment unit that judges.
  • the excluding unit 73 is an example of an excluding unit that, when an object whose work cannot be completed within the workable time zone is detected, excludes the object from the simulation.
  • model storage unit 20 work master storage unit 30 non-operating time period storage unit 40 input order storage unit 50 cost coefficient storage unit 60 work time period calculation unit 70 optimization execution unit 71 simulation unit 72 determination unit 73 exclusion unit 80 identification unit 90 Result output unit 100
  • Information processing device 101 CPU 102 RAMs 103 storage device 104 input device 105 display device

Landscapes

  • Engineering & Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Manufacturing & Machinery (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Automation & Control Theory (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • General Factory Administration (AREA)

Abstract

La présente invention amène un ordinateur à exécuter : un processus qui, le long d'un itinéraire de déplacement sur lequel une pluralité de corps de travail sont disposés qui effectuent un travail en séquence sur chaque objet d'une pluralité d'objets, effectue une simulation relative au temps jusqu'à ce que la pluralité d'objets atteignent un point prescrit sur l'itinéraire de déplacement en fonction de l'ordre dans lequel la pluralité d'objets sont introduits sur l'itinéraire de déplacement, la simulation étant effectuée dans des conditions où, pour chaque corps de travail de la pluralité de corps de travail, le temps de travail requis pour le traitement de chaque objet de la pluralité d'objets est défini, et une période de temps d'absence d'opération est définie pour au moins un corps de travail de la pluralité de corps de travail; un processus qui détermine, dans des unités de temps individuelles dans la simulation, si un objet parmi la pluralité d'objets a été détecté pour lequel le travail n'a pas pu être achevé dans une période de temps sur laquelle le travail aurait pu être achevé par n'importe lequel des corps de travail; et un processus qui, lorsqu'un objet pour lequel le travail n'a pas pu être achevé dans la période de temps de possibilité d'achèvement de travail a été détecté, exclut cet objet de la simulation.　
PCT/JP2021/024939 2021-07-01 2021-07-01 Programme de simulation, procédé de simulation et dispositif de traitement d'informations WO2023276108A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2021/024939 WO2023276108A1 (fr) 2021-07-01 2021-07-01 Programme de simulation, procédé de simulation et dispositif de traitement d'informations

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2021/024939 WO2023276108A1 (fr) 2021-07-01 2021-07-01 Programme de simulation, procédé de simulation et dispositif de traitement d'informations

Publications (1)

Publication Number Publication Date
WO2023276108A1 true WO2023276108A1 (fr) 2023-01-05

Family

ID=84691682

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2021/024939 WO2023276108A1 (fr) 2021-07-01 2021-07-01 Programme de simulation, procédé de simulation et dispositif de traitement d'informations

Country Status (1)

Country Link
WO (1) WO2023276108A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11151641A (ja) * 1997-11-20 1999-06-08 Sumitomo Metal Ind Ltd 操業計画作成方法、操業計画作成装置及び記録媒体
JP2007157065A (ja) * 2005-12-08 2007-06-21 Jfe Steel Kk 連続設備の材料投入順序決定方法及びその装置
WO2017212530A1 (fr) * 2016-06-06 2017-12-14 富士通株式会社 Procédé de génération de plan d'entrée, programme de génération de plan d'entrée, et système de génération de plan d'entrée

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH11151641A (ja) * 1997-11-20 1999-06-08 Sumitomo Metal Ind Ltd 操業計画作成方法、操業計画作成装置及び記録媒体
JP2007157065A (ja) * 2005-12-08 2007-06-21 Jfe Steel Kk 連続設備の材料投入順序決定方法及びその装置
WO2017212530A1 (fr) * 2016-06-06 2017-12-14 富士通株式会社 Procédé de génération de plan d'entrée, programme de génération de plan d'entrée, et système de génération de plan d'entrée

Similar Documents

Publication Publication Date Title
Zhang et al. A simulation-based genetic algorithm approach for remanufacturing process planning and scheduling
Chen et al. Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm
Gan et al. Joint optimization of maintenance, buffer, and spare parts for a production system
US8983881B2 (en) Benchmarking progressive systems for solving combinatorial problems
US7715936B2 (en) System and method for the production of goods or products
JP6962539B2 (ja) 業務計画最適化方法
Atmaca et al. Defining order picking policy: A storage assignment model and a simulated annealing solution in AS/RS systems
JP5134601B2 (ja) 生産スケジュール作成装置
US11386373B2 (en) Work management device, work management method, and program storage medium
JP7054668B2 (ja) 動的生産計画システムおよび動的生産計画装置
Manavizadeh et al. A multi-objective mixed-model assembly line sequencing problem in order to minimize total costs in a Make-To-Order environment, considering order priority
CN108629476A (zh) 非暂时性计算机可读存储介质、工序规划方法和装置
CN110794788A (zh) 一种生产排程装置、方法、设备及计算机可读存储介质
Rahman et al. Multiple-order permutation flow shop scheduling under process interruptions
CN115053248A (zh) 信息处理装置、工作计划决定方法以及工作计划决定程序
Mak et al. A simulation analysis of the impact of production lot size and its interaction with operator competence on manufacturing system performance
WO2023276108A1 (fr) Programme de simulation, procédé de simulation et dispositif de traitement d'informations
CN117611029A (zh) 一种仓储物流系统的进程式仿真方法及系统
Vaghefinezhad et al. A genetic algorithm approach for solving a flexible job shop scheduling problem
JP7386010B2 (ja) 出荷作業支援システム、その方法、及びコンピュータプログラム
JP5063444B2 (ja) ライン生産管理支援方法および装置
CN112990716A (zh) 一种双资源约束柔性车间调度和布局集成优化方法及系统
JP2007122127A (ja) 鉄鋼製品の生産計画装置及び方法
JP4655494B2 (ja) 組立製造ラインにおける作業工程別タクトタイム推定方法、全体工程編成方法、装置およびプログラム
JP5870637B2 (ja) 運用支援方法および運用支援装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21948412

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE