WO2017061021A1 - Système de planification et procédé de planification - Google Patents

Système de planification et procédé de planification Download PDF

Info

Publication number
WO2017061021A1
WO2017061021A1 PCT/JP2015/078706 JP2015078706W WO2017061021A1 WO 2017061021 A1 WO2017061021 A1 WO 2017061021A1 JP 2015078706 W JP2015078706 W JP 2015078706W WO 2017061021 A1 WO2017061021 A1 WO 2017061021A1
Authority
WO
WIPO (PCT)
Prior art keywords
schedule
simulator
transportation
transport
warehouse
Prior art date
Application number
PCT/JP2015/078706
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/JP2015/078706 priority Critical patent/WO2017061021A1/fr
Publication of WO2017061021A1 publication Critical patent/WO2017061021A1/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]
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]

Definitions

  • the present invention relates to a scheduling system and method for transporting a product from a production facility to a predetermined warehouse or the like.
  • Patent Document 1 holds order information, progress information, constraint conditions and scheduling parameters used to create work scheduling for each process, and work schedule for each process in order to create a schedule for each process in a series of production processes. A technique is disclosed in which each process creates a work schedule based on this information.
  • Patent Document 1 is premised on the existence of an entity that manages the whole. That is, it is not assumed that there are a plurality of parallel processes, and each process is operated by a different business operator, and the schedules of the plurality of business operators cannot be adjusted.
  • the scheduling system includes a production simulator that performs a simulation of product shipment, and a transport simulator that performs a simulation of a transportation facility.
  • the production simulator receives a change in the operation time of the production facility.
  • the first shipping schedule is calculated based on the change, the calculated first shipping schedule is transmitted to the transport simulator, and the transport simulator calculates the first transport schedule based on the first shipping schedule and calculates
  • the first transportation schedule is evaluated based on a predetermined index, and if the evaluation result satisfies a predetermined standard, the first transportation schedule is transmitted to the production simulator, and the production simulator is based on the received first transportation schedule.
  • the second shipping schedule is calculated and the calculated second
  • the load schedule is evaluated based on a predetermined index, and if the evaluation result satisfies a predetermined standard, the fact that the first transport schedule is acceptable is transmitted to the transport simulator, and the transport simulator When it is received that acceptance is possible, the first transportation schedule is set as a fixed schedule.
  • FIG. 1 It is a block diagram which shows the structure of a scheduling system. It is a figure which shows the function structure of the subsystem in the system which each main body possesses. It is a figure which shows the geographical positional relationship of each main body, and the outline of a transportation means. It is a figure which shows the shipping schedule of the product of the factory A, the factory B, and the factory C. It is a figure which shows the carrying-in schedule of the product of the warehouse A and the warehouse B. FIG. It is the figure which showed typically the operation schedule at the time of the plan of a railway. It is a figure which shows the sequence of a schedule adjustment process. It is a figure explaining the loading schedule which is a simulation result supposing the case where the factory B implements temporary equipment maintenance.
  • FIG. It is the figure which showed typically the loading schedule which is a simulation result supposing the case where the factory B implements temporary equipment maintenance. It is a figure explaining the unloading schedule of the warehouse A and the warehouse B corresponding to the train schedule at the time of the temporary equipment maintenance of the factory B.
  • FIG. It is the figure which showed typically the unloading schedule of the warehouse A and the warehouse B corresponding to the train schedule at the time of the temporary equipment maintenance of the factory B.
  • FIG. It is a figure explaining the simulation result of warehouse A and warehouse B.
  • FIG. It is the figure which showed typically the simulation result of the warehouse A and the warehouse B.
  • FIG. It is the figure which showed typically the unloading schedule of the warehouse A and the warehouse B corresponding to the train schedule at the time of the temporary equipment maintenance of the factory B.
  • FIG. It is a schematic diagram which shows the railroad service diagram which is a countermeasure simulation result which a transportation means system implements. It is a figure which shows the KPI comparison of an original plan and various simulation results. It is a figure which shows the loading schedule of the factory A, the factory B, and the factory C based on the railroad schedule which is a countermeasure simulation result which a transportation means system implements. It is a figure which shows the KPI comparison table of each schedule.
  • FIG. 1 is a block diagram illustrating a configuration of a scheduling system according to the first embodiment.
  • the transportation management system of this embodiment is a transportation means that is a subsystem that manages the operation of the transportation means, the factory A system 101, the factory B system 102, and the factory C system 103, which are subsystems that manage the factory as the production base.
  • the system 104 includes a warehouse A system 105 and a warehouse B system 106 which are subsystems for storing products. Each subsystem is connected via the network 107.
  • Each subsystem has an operation system that operates the equipment and a simulator function that predicts the operation of the equipment under specified conditions.
  • the functions of each subsystem are realized by a processor (CPU) executing a program stored in the memory.
  • the factory subsystems 101, 102, and 103 are configured by operation systems 1011, 1021, and 1031 and simulators 1012, 1022, and 1032, respectively.
  • the operation systems 1011, 1021, and 1031 have a function of monitoring and controlling factory equipment, and provide current status information of the equipment to an administrator and other systems.
  • the simulators 1012, 1022, and 1032 perform equipment operation prediction based on the equipment state information and the set conditions. In addition, conditions are input from the outside via a network, and simulation results are output to the outside.
  • Each subsystem has a terminal that displays information to the administrator, and displays the equipment status and simulation results on the screen.
  • the transportation means subsystem 104 has an operation system that manages the operation of the transportation means and a simulator function that predicts the operation of the transportation means under the set conditions.
  • the transport means subsystem 104 includes an operation system 1041 and a simulator 1042.
  • the operation system 1041 has a function of monitoring the current location of the transportation means and managing the destination and the like, and provides the current state information of the transportation means to the manager and other systems.
  • the simulator 1042 predicts the operation of the transportation means based on the state information of the transportation means and the set conditions. In addition, conditions are input from the outside via a network, and simulation results are output to the outside.
  • the transportation means subsystem is provided with a terminal for displaying information to the administrator, and displays the state of transportation means, simulation results, etc. on the screen.
  • the warehouse subsystems 105 and 106 have an operation system for managing the warehouse and a simulator function for predicting the state of the warehouse under the set conditions.
  • the warehouse subsystems 105 and 106 are constituted by operation systems 1051 and 1061 and simulators 1052 and 1062, respectively.
  • the operation systems 1051 and 1061 have a function of managing the carry-in status and inventory status to the warehouse, and provide the status information to the administrator and other systems.
  • the simulators 1052 and 1062 perform warehouse state prediction based on the warehouse state information and set conditions. In addition, conditions are input from the outside via a network, and simulation results are output to the outside.
  • FIG. 2 is a diagram showing a functional configuration of subsystems in a system possessed by each subject.
  • the simulation processing unit 001 performs a simulation process of the control target equipment based on the simulation condition, and stores the simulation result in the simulation result DB 003.
  • the simulation conditions are stored in the simulation condition DB 002 and set via the communication unit 004.
  • the simulation evaluation result unit 005 performs a process of calculating KPI (Key Performance Indicators) from the simulation result.
  • KPI Key Performance Indicators
  • the evaluation result is stored in the simulation result DB 005 in association with the simulation result to be evaluated.
  • the control plan creation unit 006 creates a control plan based on the simulation result and the state of the equipment, and stores it in the control plan DB 007.
  • the equipment control unit 008 controls the equipment to be controlled based on the control plan stored in the control plan DB.
  • the facility monitoring unit 009 acquires the state information of the control target facility and stores it in the monitoring log DB 010 as a monitoring log.
  • the administrator user interface 011 is an interface for the user to browse the contents of each DB and operate each processing unit.
  • FIG. 3 is a diagram showing an outline of the geographical positional relationship of each main body and the means of transportation connecting them.
  • 201 indicates the factory A
  • 202 indicates the factory B
  • 203 indicates the factory C
  • 204 indicates the warehouse A
  • 205 indicates the location of the warehouse B, and these are connected as shown in the figure by a railroad as a means of transportation. ing.
  • FIG. 4 is a table showing the carry-out schedule of the products of factory A, factory B, and factory C.
  • Reference numeral 301 denotes a factory A
  • 302 denotes a factory B
  • 303 denotes a factory C carrying-out schedule. Is set.
  • FIG. 5 is a table showing the delivery schedule of the products in the warehouse A and the warehouse B.
  • Reference numeral 401 denotes a warehouse A
  • 402 denotes a delivery schedule of the warehouse B, and information on a train number, a delivery start time, and a delivery completion time are set.
  • FIG. 6 is a train schedule of a transportation means and is a diagram schematically showing the schedules of FIGS. 4 and 5.
  • the train numbers are the same as those shown in FIGS.
  • FIG. 7 is a diagram showing a sequence showing schedule adjustment processing.
  • the schedule adjustment process of the present embodiment is a process for changing the entire schedule when it is difficult to execute the initial schedule due to a trouble occurring at the factory B.
  • This schedule adjustment process may be repeatedly executed at predetermined time intervals, or may be started by a request from any subsystem.
  • S101 is a process in which the simulation unit of the subsystem in which the trouble has occurred or the subsystem that has predicted the occurrence of the trouble performs a simulation according to the trouble content.
  • simulation is carried out assuming that temporary equipment maintenance is performed in the factory B and the factory is scheduled to stop for 12 hours the next day. That is, the factory B subsystem 102 performs a simulation on the influence of the equipment stop by the factory B simulator 1022.
  • the factory B subsystem 102 performs a simulation on the influence of the equipment stop by the factory B simulator 1022.
  • the output information in S101 will be described with reference to FIGS.
  • S102 is a process in which the communication unit notifies the transportation means subsystem 104 of the loading schedule (FIGS. 8 and 9) which is a simulation result.
  • S103 is a process in which the transportation means subsystem 104 executes a railway operation simulation using the loading schedule (FIGS. 4 and 9) notified from the factory B subsystem 102 as input information. Details of the output information in S103 will be described with reference to FIGS.
  • S104 is a process of calculating the KPI from the result of the railway operation simulation and the initial plan, comparing the calculated KPI with the KPI of the initial plan, and determining whether or not a predetermined condition is satisfied as a result of the comparison. If the predetermined condition is satisfied, the process proceeds to S107 with the simulation result as an update schedule. If the predetermined condition is not satisfied, the process proceeds to S105.
  • the KPI to be compared for example, a production amount and a transport amount of a product in a predetermined period, or a time required for completing a predetermined amount of processing is adopted.
  • the predetermined condition for example, the difference from the KPI of the original plan is within minus 10% or the like. That is, as a result of the comparative evaluation of KPI, if the decrease value of KPI exceeds a predetermined value, the process proceeds to countermeasure simulation processing in S105. In this example, it is assumed that the KPI falls within the aforementioned minus 10%. That is, it is assumed that the countermeasure simulation in S105 is unnecessary and the process proceeds to S107.
  • S105 is a process for implementing a countermeasure simulation.
  • a countermeasure plan may be formulated in advance, or may be set as appropriate by the administrator. If it is formulated in advance, a rule is set for each subject. Examples of rules when the means of transport is the main are: ⁇ If there is a trouble in factory A, change the train destination to factory B or C.
  • S106 is a process of calculating the KPI of the countermeasure simulation result of S105 and evaluating the KPI of the simulation result in the same manner as S104. As a result of the evaluation, if the above condition is satisfied, the countermeasure plan is selected and the process proceeds to S107. If the condition is not satisfied and another countermeasure plan exists, the process proceeds to S105 to execute a simulation of another countermeasure plan. If there is no other countermeasure plan, the simulated countermeasure plan and the simulation result of S103 are compared, and a plan with a better KPI is selected.
  • S107 is a process of notifying the other subject together with the calculated KPI, using the simulation result of S103 or the simulation result selected in 106 as an update schedule proposal.
  • the notification destination may be only an entity that is affected by the schedule change, or may be all entities including entities that are not affected.
  • the railway schedule is changed as shown in a diagram of FIG. 14 to be described later, and it is the warehouse A, the warehouse B, and the factory B that are changed from the original plan.
  • the schedule data of warehouse A, warehouse B, and factory B and the calculated KPI values are transmitted to warehouse A, warehouse B, and factory B, respectively.
  • S108 is a process in which the simulator of each subject that has received the update schedule data and the KPI executes a simulation in each subsystem based on the update schedule proposal. Details of the output information in S108 will be described with reference to FIGS.
  • S109 is processing for determining whether or not an update schedule can be realized for the result of the simulation performed in S108. If the update schedule can be realized, the process proceeds to S110. If this is not feasible, an alternative schedule is generated.
  • the method for creating an alternative schedule is the same as S104 to S106 described above. That is, when the update schedule cannot be realized, a countermeasure simulation is performed based on a predetermined rule to calculate the KPI and determine whether the KPI satisfies the condition. If there is no countermeasure that satisfies the conditions, the countermeasure proposal that has been simulated and the simulation result of S108 are compared, and a proposal with a better KPI is selected.
  • the criterion for determining whether or not the update schedule can be realized is that the difference from the KPI of the original plan is within minus 10%, for example.
  • S110 is a process for notifying the other subject of the result obtained in S109. In this example, notification is made only to the transportation system that connects the respective main bodies, but all other main bodies may be notified.
  • S111 is a process in which the transportation means system confirms the result received from each main body. Specifically, a process of comparing the schedule received from each subject in S110 and the schedule notified to each subject in S107 is performed. If there is no change as a result of the comparison, the process proceeds to S112.
  • S112 is a process of notifying another subject that the update schedule has been determined.
  • the subject receiving the notification sets the update schedule as a new plan.
  • the record 4015 ′′ (recording start time of warehouse A) is the earliest time among the records 4015 ′′, 4018 ′′, records 4026 ′′, 4029 ′′ of update records shown in FIG. Therefore, the schedule until 2015/2/2 10:00 will be confirmed.
  • FIG. 8 is a diagram showing the result of the equipment stop condition simulation of factory B in S101.
  • FIG. 9 is a graph showing the transition of the production inventory amount of the factory B calculated by the simulation of S101. If factory B has a production rate of 1000 pieces / hour, a train loading capacity of 8000 pieces, and a loading speed of 4000 pieces / hour, the initial plan shows inventory transitions and cumulative production as indicated by the solid line. In the forecast when is stopped, it is the inventory transition and cumulative production shown by the dotted line.
  • FIG. 10 is a diagram showing the simulation result of the railway operation in S103.
  • the row 4013 ', the row 4016', the row 4019 ', the row 4024', and the row 4027 ' are updated from the initial plan shown in FIG.
  • the arrival and departure times of the trains B0002, B0004, and B0006 are delayed by 12 hours.
  • the arrival and departure times of the B0003 and B0005 trains are 12 hours behind.
  • FIG. 11 is a diagram showing a result of the railway operation simulation in S103, and is a diagram schematically showing FIG.
  • the schedules of the factory B, the warehouse A, and the warehouse B are updated as described above.
  • the schedule of factory A and factory C is no different from the original plan.
  • FIG. 12 is a diagram showing a simulation result of each subsystem in S108.
  • the locations (4015 ′′ row, 4018 ′′ row, 4026 ′′ row, 4029 ′′ row, which are determined to be unexecutable. ) Is updated from the schedule of FIG. This is because an operation rule is assumed in the warehouse that at least two hours of preparation time are required for maintenance before and after loading and unloading.
  • the arrival and departure times of trains B0002 and B0004 are two hours behind.
  • the arrival and departure times of trains B0003 and B0005 are two hours behind.
  • FIG. 13 is a diagram showing a simulation result of each subsystem in S108, and is a diagram schematically showing FIG. The description of each element is the same as the description of FIG.
  • FIG. 14 is a diagram showing the result of the railway operation simulation in S103, which was performed again.
  • the record 4015 '' (4018 '', record 4026 '', 4029 '') of the update record shown in FIG. The schedule until 2015/2/2 10:00 has been confirmed. And it turns out that the area
  • FIG. 15 is a diagram schematically showing a railway operation diagram as a result of countermeasure simulation performed by the transportation means system of S105.
  • the B0002 train changed the diamond from the factory B to the warehouse A to the diamond from the factory C to the warehouse A
  • the C0002 train changed the diamond from the factory C to the warehouse B from the factory A to the warehouse B.
  • A0003 train changed the diamond going from factory A to warehouse A to diamond going from factory C to warehouse A
  • B0003 train changed the diamond going from factory B to warehouse B to diamond going from factory A to warehouse B
  • A0004 train changed the diamond from factory A to warehouse A to the diamond from factory B to warehouse B
  • train B0004 changed the diamond from factory B to warehouse A to the diamond going from factory A to warehouse A.
  • Train A0005 changes the schedule from factory A to warehouse A to the schedule from factory B to warehouse A, and train B0005 moves from factory B to warehouse B.
  • the schedule for changing the schedule from factory A to warehouse B is changed to A0006, the schedule going from factory A to warehouse B is changed to the schedule going from factory B to warehouse B, and train B0006 is changed from factory B to warehouse A.
  • the diamond going to the factory is changed to the diamond going from the factory A to the warehouse A.
  • FIG. 16 is a table showing the initial plan, the first simulation result of S103, the second simulation result of S103, the countermeasure simulation result of S105, and the KPI of each schedule.
  • the column of “plan” 1201 indicates the KPI of the original plan schedule (FIG. 6)
  • the column of “prediction 1” 1202 indicates the KPI of the first simulation result of S103 (schedule in FIG. 11)
  • the column indicates the KPI of the second simulation result of S103 (schedule in FIG. 14)
  • the column “countermeasure” 1204 indicates the KPI of the countermeasure simulation result of S105 (schedule in FIG. 15).
  • the factory KPI is “2/3 12:00”
  • the railway KPI is “2/3 12:00”
  • the warehouse KPI is “2/3 12:00” Amount ".
  • FIG. 17 is a diagram showing a loading schedule of factory A, factory B, and factory C based on the railway operation diagram, which is a simulation result of measures implemented by the transportation means system.
  • trains loaded at factory A are 6 to 7 trains
  • trains loaded at factory B are 6 to 4
  • trains loaded at factory C Changes from six to seven.
  • warehouse A and warehouse B are not changed from the planned schedule shown in FIG.
  • FIG. 18 is a diagram showing a KPI comparison table for each schedule.
  • the column “plan” 1501 indicates the KPI of the original plan schedule (FIG. 6)
  • the column “prediction 2” 1502 indicates the KPI of the second simulation result of S103 (schedule in FIG. 14)
  • the column “measure” 1503. Indicates the KPIs of the countermeasure simulation result of S105 (schedule in FIG. 15).
  • Prediction 2 1502 shows that the efficiency of the factory B where the facility stoppage has occurred is lower than that of the planned schedule, and that causes a decrease in the efficiency of the railway, warehouse A, and warehouse B. The efficiency is reduced.
  • Countermeasure 1503 further reduces the efficiency of factory B, but the efficiency of factory A and factory C improves the efficiency of railway, warehouse A, and warehouse B to the same level as the planned schedule. You can see that
  • the factory B can improve the loss cost by allowing the flexible transportation capacity to be interchanged from the factory A and the factory C.
  • the transport management for transporting the factory product to the warehouse by rail has been described in the embodiment of the present invention.
  • the transport product is used to transport the product from the production base to the accumulation base. It can be applied to transportation management in other industries.
  • it can be applied to a management system for transporting agricultural products from the production base to the market, transporting ores from the mine to the port, etc.
  • this invention is not limited to the Example mentioned above, Various modifications and an equivalent structure are included. For example, another part of the configuration of the embodiment may be added, deleted, or replaced.
  • each of the above-described configurations, functions, processing units, processing means, etc. may be realized in hardware by designing a part or all of them, for example, with an integrated circuit, and the processor realizes each function. It may be realized by software by interpreting and executing the program to be executed.
  • Information such as programs, tables, and files that realize each function can be stored in a storage device such as a memory, a hard disk, and an SSD (Solid State Drive), or a recording medium such as an IC card, an SD card, and a DVD.
  • a storage device such as a memory, a hard disk, and an SSD (Solid State Drive), or a recording medium such as an IC card, an SD card, and a DVD.
  • control lines and information lines indicate what is considered necessary for the explanation, and do not necessarily indicate all control lines and information lines necessary for mounting. In practice, it can be considered that almost all the components are connected to each other.

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)

Abstract

L'objectif de la présente invention est de régler le planning de chaque société d'une pluralité de sociétés différentes dans un cas où une pluralité de processus parallèles est gérée par les sociétés. La présente invention comprend un simulateur de production et un simulateur de transport. Le simulateur de production calcule un premier planning d'expédition si un changement de planning pour l'exploitation d'une installation de production est entré, puis transmet le planning d'expédition au simulateur de transport. Le simulateur de transport calcule un premier planning de transport sur la base du premier planning d'expédition, évalue le premier planning de transport sur la base d'un indicateur prédéterminé, et si les résultats d'évaluation correspondent à une norme prédéterminée, transmet le premier planning de transport au simulateur de production. Le simulateur de production calcule un second planning d'expédition sur la base du premier planning de transport, évalue le second planning d'expédition sur la base d'un indicateur prédéterminé, et si les résultats d'évaluation correspondent à une norme prédéterminée, effectue une transmission, au simulateur de transport, indiquant que le premier planning de transport est acceptable. Le simulateur de transport définit le premier planning de transport comme le planning final.
PCT/JP2015/078706 2015-10-09 2015-10-09 Système de planification et procédé de planification WO2017061021A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2015/078706 WO2017061021A1 (fr) 2015-10-09 2015-10-09 Système de planification et procédé de planification

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2015/078706 WO2017061021A1 (fr) 2015-10-09 2015-10-09 Système de planification et procédé de planification

Publications (1)

Publication Number Publication Date
WO2017061021A1 true WO2017061021A1 (fr) 2017-04-13

Family

ID=58488132

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2015/078706 WO2017061021A1 (fr) 2015-10-09 2015-10-09 Système de planification et procédé de planification

Country Status (1)

Country Link
WO (1) WO2017061021A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109118107A (zh) * 2018-08-29 2019-01-01 苏州汇通软件科技有限公司 一种工厂用智能排班系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007004391A (ja) * 2005-06-22 2007-01-11 Nippon Steel Corp 生産・物流スケジュール作成装置及び方法、生産・物流プロセス制御装置及び方法、コンピュータプログラム、並びにコンピュータ読み取り可能な記録媒体
JP2012243024A (ja) * 2011-05-18 2012-12-10 Kobe Steel Ltd 生産スケジュール作成装置及び生産スケジュール作成方法
WO2013143846A1 (fr) * 2012-03-30 2013-10-03 Abb Research Ltd Surveillance de la progression d'une activité planifiée dans un processus industriel
JP2014123227A (ja) * 2012-12-20 2014-07-03 Kawasaki Heavy Ind Ltd 生産スケジュール作成方法および装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007004391A (ja) * 2005-06-22 2007-01-11 Nippon Steel Corp 生産・物流スケジュール作成装置及び方法、生産・物流プロセス制御装置及び方法、コンピュータプログラム、並びにコンピュータ読み取り可能な記録媒体
JP2012243024A (ja) * 2011-05-18 2012-12-10 Kobe Steel Ltd 生産スケジュール作成装置及び生産スケジュール作成方法
WO2013143846A1 (fr) * 2012-03-30 2013-10-03 Abb Research Ltd Surveillance de la progression d'une activité planifiée dans un processus industriel
JP2014123227A (ja) * 2012-12-20 2014-07-03 Kawasaki Heavy Ind Ltd 生産スケジュール作成方法および装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109118107A (zh) * 2018-08-29 2019-01-01 苏州汇通软件科技有限公司 一种工厂用智能排班系统

Similar Documents

Publication Publication Date Title
Hall et al. Impact of information sharing on supply chain performance
Lynch et al. Optimal spares and preventive maintenance frequencies for constrained industrial systems
US11861739B2 (en) Programmable manufacturing advisor for smart production systems
WO2016121076A1 (fr) Système de gestion d'entrepôt
Consilvio et al. A rolling-horizon approach for predictive maintenance planning to reduce the risk of rail service disruptions
Sleptchenko et al. Joint optimization of redundancy level and spare part inventories
KR20210042776A (ko) 인바운드 구입 주문의 인텔리전트 조정에 의한 제품 재고 최적화를 위한 시스템 및 방법
Almaktoom et al. Assurance of system service level robustness in complex supply chain networks
Zhang et al. Resilience-cost tradeoff supply chain planning for the prefabricated construction project
Zhang et al. Dynamic decision-making for reliability and maintenance analysis of manufacturing systems based on failure effects
Arts et al. Maintenance service logistics
Zhang et al. Reliability evaluation and component importance measure for manufacturing systems based on failure losses
Comes et al. Critical airport infrastructure disaster resilience: A framework and simulation model for rapid adaptation
Zhou et al. Optimization of buffer allocation in unreliable production lines based on availability evaluation
WO2017061021A1 (fr) Système de planification et procédé de planification
Lima et al. Simulation‐Based Planning and Control of Transport Flows in Port Logistic Systems
CN111861302B (zh) 物流订单的断更处理方法、装置、电子设备及存储介质
KR101690276B1 (ko) 컨테이너 터미널 내 장비들의 스케줄 조정 방법
KR101367550B1 (ko) 협업형 설비 생산 통합 관리 시스템
JP2017117049A (ja) 物流管理支援装置および物流管理支援方法
Şen et al. Applied materials uses operations research to design its service and parts network
KR101151261B1 (ko) 열차 운행 예측 및 밀집운행 방지 시스템 및 방법
Zeng et al. A transient queuing model for analyzing and optimizing gate congestion of railway container terminals
Zhao et al. Allocating freight empty cars in railway networks with dynamic demands
JP6625164B2 (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: 15905840

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15905840

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: JP