WO2023158871A1 - Method to identify and prioritize a bottleneck in a process - Google Patents

Method to identify and prioritize a bottleneck in a process Download PDF

Info

Publication number
WO2023158871A1
WO2023158871A1 PCT/US2023/013491 US2023013491W WO2023158871A1 WO 2023158871 A1 WO2023158871 A1 WO 2023158871A1 US 2023013491 W US2023013491 W US 2023013491W WO 2023158871 A1 WO2023158871 A1 WO 2023158871A1
Authority
WO
WIPO (PCT)
Prior art keywords
asset
assets
ctt
time
server
Prior art date
Application number
PCT/US2023/013491
Other languages
French (fr)
Inventor
Dylan MCCLURE
David Jingqiu Wang
Po-Chao Lee
Girish S. RAO
Original Assignee
Beet, Inc.
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 Beet, Inc. filed Critical Beet, Inc.
Publication of WO2023158871A1 publication Critical patent/WO2023158871A1/en

Links

Classifications

    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B23/00Testing or monitoring of control systems or parts thereof
    • G05B23/02Electric testing or monitoring
    • G05B23/0205Electric testing or monitoring by means of a monitoring system capable of detecting and responding to faults
    • G05B23/0259Electric testing or monitoring by means of a monitoring system capable of detecting and responding to faults characterized by the response to fault detection
    • G05B23/0283Predictive maintenance, e.g. involving the monitoring of a system and, based on the monitoring results, taking decisions on the maintenance schedule of the monitored system; Estimating remaining useful life [RUL]
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00Programme-control systems
    • G05B19/02Programme-control systems electric
    • G05B19/418Total 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], computer integrated manufacturing [CIM]
    • G05B19/4183Total 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], computer integrated manufacturing [CIM] characterised by data acquisition, e.g. workpiece identification
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00Programme-control systems
    • G05B19/02Programme-control systems electric
    • G05B19/418Total 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], computer integrated manufacturing [CIM]
    • G05B19/4184Total 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], computer integrated manufacturing [CIM] characterised by fault tolerance, reliability of production system
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00Program-control systems
    • G05B2219/30Nc systems
    • G05B2219/31From computer integrated manufacturing till monitoring
    • G05B2219/31282Data acquisition, BDE MDE
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00Program-control systems
    • G05B2219/30Nc systems
    • G05B2219/31From computer integrated manufacturing till monitoring
    • G05B2219/31455Monitor process status

Definitions

  • the present disclosure relates generally to collecting and capturing process data from process equipment using a process controller in communication with a computing device, and more specifically, to identifying a bottleneck in a process using the collected process data.
  • Modem manufacturing often involves complicated processes including multiple stations.
  • the key to improving modem manufacturing efficiency is to identify the bottleneck in the process, and resolve the bottleneck once it is identified. Identifying and prioritizing the bottleneck in a complicated process including multiple processing stations can be difficult, due to the numerous interactions between stations in the complicated process generating multiple and concurrent blocked and starved condition states between the various stations. Dynamic changes in blocked and starved conditions over time may result in improper identification of those stations having the most significant contribution to the process bottleneck, potentially causes waste in the deployment of improvement resources.
  • Modem manufacturing often involves complicated processes including multiple stations.
  • the key to improving modem manufacturing efficiency is to identify the bottleneck in the process, and resolve the bottleneck once it is identified.
  • the effectiveness of improvement actions can be significantly increased by understanding which are the critical stations of a complex multi-station process contributing the most to the process bottleneck, and by prioritizing these critical stations for remedial and improvement actions. Described herein is a system and method for identifying bottlenecks in a process including multiple process stations, and prioritizing the bottlenecks for contribution to an overall process bottleneck, such that, once the bottlenecks within the individual process stations are ranked and prioritized for corrective action, the efficiency of such improvement actions can be optimized in terms of impact on reducing the overall process bottleneck.
  • the system and method described herein, for identifying and prioritizing a bottleneck in a process including a plurality of assets includes the process configured to repeatedly perform a process cycle, the process cycle including a plurality of operations, where each respective asset of the plurality of assets is configured to repeatedly perform at least one operation of the plurality of operation, and generate asset data defining an asset state of the respective asset.
  • the asset state can be, for example, a blocked state, a starved state, a running state, or a down state of the asset.
  • the system includes a controller configured to receive the asset data from the plurality of assets, and a server in communication with a database.
  • the server is configured to receive the asset data from the controller, store the asset data in the database, and, for each respective asset, associate, in the database, the asset data received from each respective asset with the respective asset, and determine, for the respective asset, a blocked time (BT), a starved time (ST), a cumulative blocked time (CBT), a cumulative starved time (CST), and a cumulative total time (CTT), where the cumulative total time is a sum of the cumulative blocked time (CBT) and the cumulative starved time (CST).
  • BT blocked time
  • ST starved time
  • CBT cumulative blocked time
  • CST cumulative starved time
  • CST cumulative starved time
  • CTT cumulative total time
  • the method and system further includes the server configured to identify a first bottleneck of the process, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset, where the first bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) in the rank ordering, identify ing a second bottleneck of the process, where the second bottleneck is the respective asset of the plurality of assets having a second largest cumulative total time (CTT) in the rank ordering, and so forth.
  • CCTT cumulative total time
  • a sampling period is defined, which can be, for example, a defined length of time such as an hour, shift, day, etc., or a defined number of cycles of the process.
  • the system and method in the present example includes collecting the asset data during the sampling period, where the server is configured to determine the cumulative total time (CTT) for the respective asset during the sampling period, and identify a largest bottleneck of the process during the sampling period, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset determined for the sampling period, and where the largest bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) during the sampling period, in the rank ordering.
  • CTT cumulative total time
  • the benefits and advantages of the system for identifying and prioritizing station bottlenecks in a multi-station complex process include providing pertinent and focused improvement actions to those process stations contributing the most to an overall process bottleneck, providing a method for analyzing starved and blocked data on a station by station basis to monitor and track improvement of station throughput performance and to improve and/or sustain overall production performance, and thus, optimize the users’ operating cost of the facility (factory), and gain efficiency by deferring improvement actions to those process stations which are not on a critical path for improvement of throughput of the overall process.
  • FIG. 1 is a schematic illustration of a system for identifying and prioritizing a bottleneck in an exemplary process included in the system, the exemplary process including a plurality of process stations (assets);
  • FIG. 2 is a schematic illustration of a method for identifying and prioritizing a bottleneck in a process, using the system shown in FIG. 1 ;
  • FIGS. 3A, 3B, 3C and 3D are each a schematic illustration of definitions of blocked and starved asset states, further illustrating input/output relationships of asset(s)/station(s) in a process and their associated state(s);
  • FIG. 4 is a schematic illustration of the production part flow through the exemplary process shown in FIG. 1, mapping blocked (BLK) and starved (STV) asset states of a plurality of stations (assets) as determined by the part flow through the process, and for use in the identifying and prioritizing a bottleneck in the process shown in FIG. 1 , using the method shown in FIG. 2;
  • BLK mapping blocked
  • STV starved
  • FIG. 5 is an illustration of a data matrix for collecting and storing asset data from the process stations (assets) of the process of FIG. 1, and for generating and storing asset data, including cumulative blocked and starved time for use in identifying bottleneck(s) in the process using the method of FIG. 2;
  • FIG. 6 is an illustration of exemplary algorithms used to generate the data matrixes and cumulative data shown in FIG. 5 and for use in the method of FIG. 2;
  • FIG. 7 is a schematic illustration of an exemplary display generated by the method of FIG. 2 using asset data collected for a sampling period, for outputting to a user interface, the display including data tables identifying and prioritizing the bottleneck of the process of FIG. 1 determined for the sampling period.
  • FIG. 1 a system generally indicated at 100 a production facility generally indicated at 10, the system 100 configmed to identify and prioritize bottlenecks in a process generally indicated 15 including a plurality of process stations (assets) 20 configmed to repeatedly perform steps of the process 15, and a method 200 (see FIG. 2) for identifying and prioritizing bottleneck(s) of the process 15 using the system 100, are described herein.
  • the system 100 and method 200 are configured for digitizing, identifying and prioritizing bottleneck(s) of a process 15 performed by a plurality of assets 20, also referred to herein as process stations, included in a production facility 10, a production line, etc.
  • the process 15 can be, by way of example, a manufacturing, assembly or other production process which includes a plurality of assets 20.
  • One or more of the assets 20, also referred to herein as process assets 20 and/or process stations 20, can include one or more process elements 25 such as devices, machines, etc., configured to perform coordinated operations, which can include automated, partially automated, and/or nonautomated operations.
  • One or more of the assets 20 can include at least one sensor 30 for sensing one or more parameters or characteristics of the station 20, station elements 25, product being processed by the station 20, the station environment, etc., and generating a sensor signal corresponding to the sensed parameter and/or characteristic.
  • Data generated by the process station 20, process element 25 and/or sensor 30 can be collected by a data collector 45 via a network 40, for use by a server 50 to identify condition states of the various process stations 20, including conditions such as blocked, starved, down and running, for use by tire server 50 in identifying and prioritizing bottleneck(s) in the process 15.
  • the system 100 includes a facility 10 having one or more production lines 15 including one or more process stations (assets) 20 controlled by one or more controllers 35.
  • the production line 15, also referred to herein as a process line 15 and/or a process 15, can include a plurality of sub-processes, which in the illustrative example shown in FIGS. 1 and 4 include sub-processes 15A, 15B, 15C, and 15D. Each of these includes at least one asset 20 for performing at least one operation of the process cycle or sequence of operations performed by the process 15.
  • the process 15 includes a plurality of process stations 20 each identified by a station identifier STAx.
  • sub-process 15A includes stations 20 identified as STA1, STA2, STA3, STA4, STA5, STA6, STA7, STA8, STA9, and STA10.
  • sub-process 15B includes a single station 20 identified as STA3A.
  • Sub-process 15C includes stations 20 identified as STA5A and STA5B.
  • Subprocess 15D includes stations 20 identified as STA11, STA12, STA 13. and STA14.
  • a sequence of N stations 20 can be selected by the server 50 and/or by a system user via a user device 60, for bottleneck analysis.
  • the sequence of N stations 20 selected for bottleneck analysis can include all stations 20 in the process 15, or a portion of the stations 20 in the process 15.
  • the sub-process 15 A is selected for bottleneck analysis, including process stations STA1 through STA10.
  • the controllers 35 are in communication with the process stations 20 and with a data collector 45.
  • the data collector 45 is configured for receiving data from the controllers 35 and, in accordance with the method 200 described herein, and for selectively transmitting data to a system server 50 for storage to a database 55.
  • the data collector 45 and/or the server 50 uses process data collected from the process stations 20, process elements 25, and/or sensors 30 to determine, for example, the condition state(s) of each respective process station 20 during a sampling period 95.
  • the condition state of a process station (asset) 20 can be, for example, at a given time, a starved, blocked, down, or running state as determined from the asset data collected from the process station 20.
  • the database 55 and/or server 50 can be configured as cloud computing resources.
  • the system 100 further includes at least one user device 60 in communication with the server 50.
  • the user device 60 includes a user interface 65 for displaying data and other process information collected and generated by the system 100, and for receiving inputs, including instructions, from a user of the user device 60.
  • Each of the stations 20, controllers 35, data collector 45, server 50, and user device(s) 60 are in communication via a network 40.
  • Examples of the network 40 include but are not limited to the internet, intranet, local area network, mobile communication network, and combinations thereof.
  • Each of the controllers 35, data collector 45, server 50, and user device(s) 60 can include a memory for receiving, storing, generating and/or providing the station (asset) data 70 and data derived therefrom including detailed data 75 including process input data, condition state data, etc., and data derived therefrom including cumulative data 80 such as a cumulative blocked time (CBT), cumulative starved time (CST) and cumulative total (blocked and starved) time (CTT) for each of the process stations 20 over a sampling period 95, within a process 15, a sub-process 15A... 15D, of the system 100, and further include a central processing unit (CPU) for executing applications and/or algorithms as required to perform the method 200 described herein.
  • CBT cumulative blocked time
  • CST cumulative starved time
  • CTT cumulative total (blocked and starved) time
  • the memory may include, by way of example, ROM, RAM, EEPROM, etc., of a size and speed sufficient, for example, for executing the applications and algorithms required to perform the method 200, receiving, storing, generating, and/or collecting the station data 70, storing the data to the database 55, and/or communicating with other devices via the network 40.
  • each controller 35 is configmed to control one or more stations 20 to perform coordinated operations, including processing steps and/or a sequence of operations.
  • a process station 20 is configured to repeatedly perform one or more processing steps, one or more operations, and/or a sequence of operations as defined (instructed) by the controller 35. It would be understood that the station 20 would, in operation, repeatedly perform the sequence of operations comprising ordered steps as an operating cycle, under control of the controller 35, such that the station data 70 generated by the station 20 can include detailed asset data 75 from each of the repeated operating cycles performed by the station 20.
  • a station 20 can include one or more station elements 25, such as devices, tools, fixtures, etc.
  • a station 20 can include one or more sensing devices 30, also referred to herein as sensors 30, for sensing one or more parameters or characteristics of the station 20, station elements 25, product being processed by the station 20, the station environment, etc., and generating a sensor signal corresponding to the sensed parameter and/or characteristic.
  • the sensor 30 is in communication with the controller 35, via the station 30 and/or the network 40, such that during operation of a production cycle, the sensor 30 is outputting sensor signals which are received by the controller 35 for processing according to the bottleneck identifying and prioritizing method 200 described further herein.
  • the production line 15 can be configured as a machine, and/or can include a plurality of machines, such that each station 20 can include one or more machines. Accordingly, the terminology production line, sub-line, main assembly line, station, machine, etc. is not intended to limit the implementation as described and/or claimed herein.
  • the station data 70 collected and/or generated by the controller 35 and/or data collector 45 can include condition state data for a station 20, where a state, which may be referred to as a condition state or as a condition, as used herein, refers to a state of the process station 20 and/or a station element 25, a state of an object (such as a product or a workpiece) being operated on by the station 20, a condition, a status, a parameter, a position, or other property of the station, operation, object, product or workpiece being monitored, measured and/or sensed.
  • a state which may be referred to as a condition state or as a condition, as used herein, refers to a state of the process station 20 and/or a station element 25, a state of an object (such as a product or a workpiece) being operated on by the station 20, a condition, a status, a parameter, a position, or other property of the station, operation, object, product or workpiece being monitored, measured and/or sensed.
  • condition states including cycle start time, cycle stop time, element start time, element travel, element stop time, position of an element or object, a dimensional measurement or parameter of an object which can include a dimensional measurement of a feature of the object, or a station element 25, a feature of a station 20, a feature of a workpiece to which an operation is being performed by a station 20 and/or station element 25, a condition of one or more of a station element 25, a station 20, a production line 15 or workpiece, or a condition of the environment within the facility 10.
  • a condition state could further include for example, operating conditions of a station 20 or station element 25, such as on, off, open, closed, auto, manual, stalled, blocked, starved, running, traveling, stopped, down, faulted, OK, good, bad, in tolerance, out of tolerance, present, not present, extended, retracted, high, low, etc., and can include for example, a measure of a physical property such as chemistry, temperature, pressure, color, shape, position, dimensional conditions such as size, surface finish, thread form, a functional parameter such as voltage, current, torque, pressure, force, etc., such that it would be understood that the terms state, condition, condition state and/or parameter as describing station data 70, detailed data 75, and summary data 80, are intended to be defined broadly.
  • the asset data 70 collected during a sampling period 95 from the process stations 20 can be used to determine, for each process station 20, die amount of time that the process station 20 is in each of a condition state of starved, blocked, down and running, for use in identifying and prioritizing the bottleneck(s) of the process 15 and/or a portion or sub-process, for example, sub-process 15A, of the process 15.
  • the condition states of starved, blocked, down and running can also be referred to herein as asset states of a process station (asset) 20.
  • a station 20 is starved with the station 20 is empty and/or waiting for an upstream station 20 to finish and send the next part over.
  • a station 20 is blocked with the process steps performed by that station 20 have been completed and that station 20 is waiting to send the part out to a downstream station 20.
  • the points in the process 15 at which a respective process station STAx can be blocked by an upstream station STA(x-l), for example, are indicated by an icon labeled STVy.
  • y represents the number of inputs to the station STAx which can place the station STAx in a starved condition (see for example, STA3 in FIG. 4 receiving inputs from upstream stations STA3A and STA2 associated respectively with starved states STV1 and STV2 of station STA3).
  • the points in the process 15 at which a respective process station STAx can starve a downstream station STA(x+l), for example, are indicated by an icon labeled BLKz where z represents the number of outputs from the station STAx which can place z downstream stations in a blocked condition (see for example, STA8 in FIG. 4, having outputs to STA9 and Pay Point 1 associated respectively with blocked states BLK1 and BLK2). See also the examples shown in FIGS.
  • a station 20 is down when the station 20 malfunctions and stops processing the part or cycling.
  • a station 20 can be down when faulted or when the station 20 generates a fault code, such that a down station 20 can also be referred to as a faulted station.
  • a station 20 is running when the station 20 is operating to complete the process steps performed up that station.
  • a running station can also be referred to herein as a station which is up.
  • the amount of time a process station 20 is determined to be in a blocked condition is referred to herein as a blocked time (BT)
  • the amount of time a process station 20 is determined to be in a starved condition is referred to herein as a starved time (ST)
  • the amount of time a process station 20 is determined to be in a down condition is referred to herein as a down time (DT)
  • the amount of time a process station 20 is determined to be in a running condition is referred to herein as an uptime or a running time (RT), where the sum of these indicates a total asset time (TT) of a sampling period 95 during which the condition states of the process station 20 are determined.
  • TT total asset time
  • a sampling period 95 can be, for example, a period of time which can be, for example, a length of time during which asset data 70 is collected from the process 15 according to a sampling plan and/or at a sampling frequency, an increment of time such as a hour, a shift, a day, etc., or a range of process cycles performed by the process 15 which can be, for example, a single process cycle, a number of consecutive cycles from which data is collected according to a sampling plan and/or al a sampling frequency, cycles completed by the process 15 in a period of time, each cycle identified by a cycle number or other cycle identifier, etc.
  • asset data 70 can be collected and analyzed continuously, such that the sampling period 95 is continuous.
  • the server 50 can be configured to select, for example, in response to sampling plan or instructions received by the server via a user interface 65, a portion of the continuous sampling period 95 for identification of the bottleneck(s) of the process 15 during the respective portion of the continuous sampling period 95, and to determine, for the respective portion of the sampling period 95, cumulative data 80 for identifying and prioritizing the bottleneck(s) of the process, and for outputting a display 90 defined by the respective portion to a user interface 90.
  • FIG. 1 shows an example system 100 for implementing a method 200 (see FIG. 2) for identifying and prioritizing a bottleneck of a process 15 including a plurality of assets 20.
  • the process 15 is a production line including a plurality of assets 20, each asset 20 identified as a process station STAx, where “x” is an identifier of that station 20.
  • the sample process 15 includes a production main line 15 A including ten stations STA1 . . . STA10 configured for processing a workpiece, such as an assembly (not shown). The process 15 receives inputs from three load points, identified in FIGS.
  • the process 15 further includes two sub-assembly lines 15B, 15C.
  • Sub-assembly line 15B also referred to herein as a sub-line 15B includes station STA3A, which receives input from Load Point 2, such that station STA3 and sub-line 15B are in a starved state (STV1) when no incoming material is available from Load Point 2, as illustrated in FIG. 4.
  • Sub-assembly line 15C includes stations STA5A and STA5B.
  • Station STA5A receives input from Load Point 3, such that station STA5 A and downstream station STA5B are in a starved stale (STV1) including 3 stalions STA3A, STA5A, STA5B.
  • the main production line 15 A receives an initial input, for example, a workpiece, from Load Point 1, which is then processed subsequently through stations STA1 and STA2.
  • an additional input such as a sub-assembly or component part, is received from station STA3Aof sub-line 15B.
  • the workpiece is further processed through station STA4 and receives a second additional input from station STA5B of sub-line 15C at STA5.
  • the workpiece is then subsequently processed through stations STA6, STA7 and STA8, where the workpiece is either outputted from the process line 15 to Pay Point 1, or outputted for additional processing to subsequent stations STA9 and STA10, and outputted from the process line to Pay Point 2 or to STA11.
  • the workpiece can be outputted to Pay Point 2 and a carrier used for conveying the workpiece through the main process 15A can be outputted to station STA11 for return as an empty carrier via sub-line 15D to station STA1 to receive a new workpiece.
  • the example is non-limiting, and other process configurations are anticipated within the scope of the disclosure.
  • the system 100 includes at least one controller 35, including, in the present examples, controllers Ml, M2 (see FIG. 1) which are connected to a data collector 45 through a factory network 40.
  • controllers Ml, M2 which are connected to a data collector 45 through a factory network 40.
  • Each of the assets 20, shown as stations STAx, are connected to and controlled by at least one of the controllers Ml, M2.
  • the data collector 35 collects the data, also referred to herein as asset data 70, from the assets 20, in the present example, from process stations STAx, via the controllers 35, and conducts preliminary' processing of the asset data 70, which can include, for example, time stamping the data, sending the data to a factory server 50 or cloud source 50 where the data 70 is processed according to the method 200 (see FIGS. 2 and 5-7) and/or using the exemplary algorithms shown in FIG.
  • the network 40 can be configured as a wired network, a wireless network, and/or a combination of these, and can include and/or be in communication via the Internet.
  • the method 200 is illustrated by FIGS. 3-6 and further described herein.
  • the method 200 begins with identifying N stations STA1.... STAx... STAN of the process 15 to be analyzed for bottleneck(s).
  • stations STA1 through STA10 of main process 15A are selected for bottleneck analysis.
  • only STV1 and BLK1 events on the main line 15A are being analyzed, as they related to movement of tire mam workpiece.
  • stations STA 3A, 5 A and 5B are excluded from the illustrated example.
  • sub-line 15D and stations STA11 through STA14 are excluded as non-production operations for returning workpiece carriers from station STA10 to station STA1, and are unrelated to movement of the main workpiece.
  • each asset or station 20 will perform its assigned task in set time (cycle time).
  • the cycle time of each asset or station 20 in the process 15 will most likely be different than the cycle time of another asset or station 20 in the process 15, such that it would be understood that an asset 20 with relatively shorter cycle time will most likely finish its task before another asset 20 performing a task with a relatively longer cycle time, and will be must wait for the asset 20 with the relatively longer cycle time to finish its job before the asset 20 with the relatively shorter cycle time can transfer the part (workpiece) out of its station 20.
  • the asset 20 is “blocked” (BLK) from taking an action (in this example, transferring out the part to a subsequent station 20), and the amount of time the asset 20 must wait to transfer out the part (in this example) is referred to as the blocked time (BT).
  • BLK blocked time
  • an asset 20 can also be starved if it transfers its part (workpiece) out and no new part arrives to its station 20 for processing.
  • the asset 20 is “starved” (STV) from taking an action (in this example, beginning to process a new part), and the amount of time the asset must wait to receive the new part (in this example) is referred to as the starved time (ST).
  • ST starved time
  • the total asset time (TT) taken by an asset (station 20) STAx to complete processing of a workpiece includes the starved time (ST) during which the asset 20 STAx is waiting for the part to be received not station STAx from an upstream station 20 STA(x-l), the run time (RT) spent in the station 20 STAx processing the part, any down time (DT) incurred while the part is in the station 20 STAx, for example, due to a fault of the station 20, and the blocked time (BT) during which the station 20 STAx is blocked from outputting the processed part to a subsequent (downstream) station 20 STA(x+l).
  • ST starved time
  • RT run time
  • DT down time
  • BT blocked time
  • an asset 20 may have one input such as a downstream process station 20 which can induce a starved condition (STV1) of the asset 20 when the downstream process station 20 does not provide a workpiece for processing by the asset 20, and may have one output such as an upstream process station 20 which can induce a blocked condition (BLK1) of the asset 20 by preventing transfer of the workpiece from the asset 20 to the upstream process station 20.
  • STV1 starved condition
  • upstream process station 20 which can induce a blocked condition (BLK1) of the asset 20 by preventing transfer of the workpiece from the asset 20 to the upstream process station 20.
  • an asset 20 may have one input which can induce a starved state (STV1) of the asset 20 and multiple outputs, such that the asset 20 may be blocked if unable to transfer out its processed workpiece to any one of the multiple outputs (BLK1, BLK2, BLK3), which may be downstream process stations.
  • an asset 20 may have multiple inputs potentially inducing a starved state of the asset 20 if a needed component is not received from any one of the inputs (upstream processes) and, in the example shown, may have one output such as a downstream process station 20 which can induce a blocked condition (BLK1) if the downstream process 20 prevents transfer of the workpiece from the asset 20.
  • FIG. 1 starved state
  • 3D shows another example of an asset 20 which may have multiple inputs which can induce multiple starved conditions (STV1, STV2, STV3), and multiple outputs which can induce multiple blocked conditions (BLK1, BLK2, BLK3).
  • each input for the asset 20 can create a starved condition STV, and each output can present a blocked condition BLK to the asset 20.
  • the main work piece movement through the asset 20 can be described as being starved (STV) for a starved time (ST), being blocked (BLK) for a blocked time (BT), being worked on for a run time (RT), and/or being faulted or down for a down time (DT), where the total of these times (TT) represents the total time the workpiece is located in the asset (process station) 20.
  • STV starved
  • ST starved time
  • BLK blocked
  • RT run time
  • DT down time
  • FIG. 4 in a non-limiting example the process (production line) 15 of FIG. 1 is shown including a key 110 referencing the various icons and symbols used in the figures, FIG. 1 illustrating workpiece (part) flow through the process 15 beginning with a load point 1 loading a workpiece to an asset (station) 20 indicated as station 1 (STA1) as the start of the main line 15 A, with work flow continuing to station 2 (STA2) and so forth, as shown in the figures.
  • station 1 station 1
  • STA2 station 2
  • the workpiece can be unloaded from the production line 15Ato a first pay point "‘Pay Point 1”, or may be further processed at station 9 (STA9) and unloaded from the production line 15Afrom station 10 (STA10) to a second pay point “Pay Point 2”.
  • Stations 11 to 14 (STA11, STA12, STA 13. STA14) are return stations for the return of part carriers which are now empty after being unloaded at station 10 (STA10), to station 1 (STA1) where the part carrier receives a new part or workpiece (indicated by the bold arrow inputting to station 1 (STA1).
  • the main process flow is between stations STA 1 to STA 10, e.g. via Stations 1 through 10, with inputs from sub-lines STA3A at STA3 and from sub-lines STA5A and STA5B at STA5.
  • all the possible blocked and starved conditions associated with this sample line have been labeled respectively with BLK1 (blocked) and STV1 (starved) designated to the main work piece flow.
  • BLK1 blocked
  • STV1 starved
  • station (asset) data 70 is collected from each of the N stations by the data collector 45, for example, via the controller 35 over a sampling period 95.
  • a blocked time (BT), a starved time (ST), a down time (DT) and a run time (RT) is determined by the controller 35, the data collector 45 and/or the server 50, using the collected asset data 70, and is associated with the respective station 20 and stored to a database 55 as detailed station data 75 shown in FIGS. 5 and 7.
  • FIG. 6 illustrates example algorithms for identifying and prioritizing bottlenecks in the process, including algorithms for determining cumulative blocked time (CBT), cumulative starved time (CST) and cumulative total time (CTT) for each station 20 of the N stations.
  • the cumulative total time (CTT) of a station STAx is a sum of the cumulative blocked time (CBT) and the cumulative starved time (CST) determined for the station STAx, as shown in the figures.
  • the cumulative total time (CTT) can also be referred to herein as the total cumulative blocked and starved time (CTT).
  • CTT total cumulative blocked and starved time
  • each asset 20 of the N assets will have its blocked time (BT), starved time (ST), down time (DT) and run time (RT), which can be determined, for example, from station data collected from the process assets 20 via the controllers 35 controlling the process assets 20 and/or from the data collector 45.
  • the first station STA1 has blocked time BT1, a starved time STI, a down time DTI and a run time RT1, determined using data collected from process station STA1.
  • the blocked time BT, starved time ST, down time DT and run time RT is determined for each of the N stations, e.g., for each of the stations STA1... STA10 in the present example.
  • the system 100 for example, via the factory server 50 and/or cloud resource 50, at step 220 of the method shown in FIG. 2, and as shown in FIG.
  • CBT cumulative blocked time
  • CST cumulative starved time
  • the cumulative starved time CST1 of station STA1 is calculated as the sum of the starved times ST2... .ST N, from stations STA2 through STAN (in the present example, STA10), as these stations are all downstream of the first station STA1.
  • the method 200 repeats the calculations, using the algorithms as shown and data collected from the respective stations 20, for each additional station STAx in the process, e g., for each of the stations STA2 through STAN (STA10 in the illustrative example), to generate a cumulative total time CTT for each of these stations, e.g., CTT2 through CTT N are each calculated.
  • the method 200 at step 225, then ranks the cumulative total times (CTT1 . . . . CTTN) determined for each of the N assets, 20 and identifies the biggest bottleneck in the process 15 as the station 20 having the highest (largest) cumulative total time CTT.
  • CTTT1 . . . CTTN cumulative total times
  • the station 20 with the highest cumulative total time CTT determined for the reported sampling period 95 is determined to be station STA5 having a cumulative total time CTT of 1,353 minutes during the reported sampling period 95.
  • the second biggest bottleneck is identified as the station 20 having the second highest (second largest) cumulative total time CTT, in the present example station STA3 having a CTT of 1,223 minutes during the sampling period 95, and so.
  • this ranking can be used to prioritize action to the biggest bottlenecks, to improve efficiency and throughput of the production line 15.
  • method 200 at step 230 in an illustrative example, can generate via the system 100, the server 50 or cloud resource 50, an output display 90 as shown in FIG.
  • the asset data 70 are displayed by station identifier (see 75A, 80A in FIG. 6) and by rank ordering the highest to lowest CTT (see 75B, 80B in FIG. 6).
  • the data display 90 can be outputted, for example, to a user device 60 in communication with the server 50 via the network 40, for display via a user interface 65 of the user device 60.
  • one or more differentiators 120 may be generated by the system 100 and displayed in the display 90, to highlight certain data.
  • asset data 75 and cumulative data 80 generated for station STA5 is differentiated by boxing the data in the display 90 with a thick-line box, to highlight station STA 5 as having the highest (largest) cumulative total time CTT and as such, presenting the biggest (largest) bottleneck to the process 15 of the N stations being analyzed.
  • the example differentiator 120 shown in FIG. 7 is nonlimiting, and it would be understood that other data display formats and differentiators 120 are anticipated within the disclosure described herein.
  • data 70 can be displayed in graphical forms such as line charts, pie charts, bar charts and the like, which may be dynamically updated over time.
  • Other forms of differentiators 120 such as icons, pop-up windows, highlighting, shading, coloring, blinking or other visual differentiators 120, and/or audio differentiators such as an audible alert when a CTT threshold is crossed, are possible.
  • one or more users of the system 100 can use the bottleneck analysis displayed in display 90 of FIG. 7 to prioritize improvement actions for those stations 20 identified as having the highest contribution to a bottleneck of the process 15.
  • FIG. 7 shown is a non-limiting example of data 70 collected from the process 15 A shown in FIG. 4, to which die method 200 and algorithms 85 shown in FIGS. 2 and 6 are applied to identify the biggest boltleneck(s) in the process 15 A, such that action can be focused on the biggest bottleneck(s) to improve product line throughput and efficiency.
  • the station times 75 e g., the blocked time BT, starved time ST, down time DT and run time RT, have been determined for each of the stations STA1 to STA10, using, for example, data 70 collected from the production line 15 and/or the stations STA1. . . STA 10, via the controller(s) 35 and the data collector (see FIGS. 1 and 4).
  • the data 70 can be collected and generated, in one example, over and for a sampling period 95 of time, such as a production shift or number of shifts, and used to calculate the asset times 75 (BT, ST, DT and RT) for each of the stations STA1 to STAN dining the sampling period 95.
  • the data 70 can be collected continuously and can be used to dynamically and/or periodically update the asset data 75 (BT, ST, DT and RT) for each of the stations STA1 to STAN to provide a dynamic indication of the blocked and starved condition states of the stations 20 and the production line 15.
  • the factory server 50 and/or cloud resource 50 as shown in FIG.
  • CBT cumulative blocked time
  • CST cumulative starved time
  • ST starved time
  • CTT CBT + CST of that station.
  • the system 100 and the method 200 at step 225 then rank orders the CTTs of the stations STA1... STA10, to determine the biggest bottlenecks in the process 15.
  • STA5 is identified as the biggest bottleneck, having a cumulative total time CTT of 1353.
  • the second biggest bottleneck is STA3, having a cumulative total time CTT of 1223.
  • STA1 is identified as the smallest contributor to process bottlenecks, having a cumulative total time CTT of 696.
  • improvement resources for example, at step 235, can be focused on the biggest (prioritized) bottlenecks STA5 and STA3, and as improvements are implemented, the CTT for each station 20 can be recalculated to determine the impact of the improvement actions, and/or to prioritize additional actions to improve production line efficiency and throughput by reducing bottlenecks.
  • a system for identifying a bottleneck in a process including a plurality of assets comprising: a process including a plurality of assets, wherein the process is configured to repeatedly perform a process cycle; the process cycle including a plurality of operations; wherein each respective asset of the plurality of assets is configured to: repeatedly perform at least one operation of the plurality of operations; and generate asset data defining an asset state of the respective asset; a controller configured to receive the asset data from the plurality of assets; a server in communication with a database; the server configmed to: receive the asset data from the controller; store, in the database, the asset data; for each respective asset: associate, in the database, the asset data received from each respective asset with the respective asset; determine, for the respective asset: a blocked time (BT); a starved time (ST); a cumulative blocked time (CBT); a cumulative starved time (CST); and a cumulative total time (CTT), wherein the cumulative total time is a sum of the cumulative blocked time (BT); a starved time (
  • Clause 2 The system of clause 1, further comprising: the server configmed to identify a first bottleneck of the process, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset; wherein the first bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) in the rank ordering.
  • CTT cumulative total time
  • Clause 3 The system of clause 2, further comprising: the server configmed to identify a second bottleneck of the process; wherein the second bottleneck is the respective asset of the plurality of assets having a second largest cumulative total time (CTT) in the rank ordering.
  • CTT cumulative total time
  • Clause 4 The system of clause 1, further comprising: a sampling period; wherein the asset data is collected during the sampling period; wherein the server is configured to: determine the cumulative total time (CTT) for the respective asset during the sampling period; and identify a largest bottleneck of the process during the sampling period, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset determined for the sampling period; wherein the largest bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) during the sampling period, in the rank ordering.
  • CTT cumulative total time
  • CTT cumulative total time
  • Clause 5 The system of clause 4, further comprising: wherein the sampling period is a defined length of time.
  • Clause 8 The system of clause 7, further comprising: the server configured to receive the asset data collected during a second sampling period; wherein the server is configured to: determine the cumulative total time (CTT) for the respective asset during the second sampling period; and compare the cumulative total time (CTT) for the respective asset during the second sampling period to the cumulative total time (CTT) for the respective asset during the first sampling period.
  • CTT cumulative total time
  • Clause 10 The system of clause 1, further comprising: a data collector in commimication with the controller and the server; the data collector configured to collect the asset data from the plurality of assets.
  • Clause 11 The system of clause 10, wherein: the data collector is configured to time stamp the asset data with a time stamp; and the server is configmed to associate the time stamp with the asset data in the database.
  • Clause 12 The system of clause 1, wherein the process includes a sub-process performed by a group of the assets selected from the plurality of assets; the system further comprising: the server configmed to: identify the group of assets performing the sub-process; determine the cumulative total time (CTT) for each respective asset of the group of assets; identify a largest bottleneck of the subprocess, by rank ordering the group of assets based on the cumulative total lime (CTT) of each respective asset; wherein the largest bottleneck of the sub-process is the respective asset of the group of assets having the largest cumulative total time (CTT) in the rank ordering.
  • CTT cumulative total time
  • CTT cumulative total lime
  • Clause 13 The system of clause 1, further comprising: at least one asset of the plurality of assets including a process element or a sensor; wherein the process element or the sensor is configmed to output the asset data.
  • Clause 14 The system of clause 2, further comprising: the server configured to generate a display defined by the asset data; the display configured to display the cumulative total time (CTT) for each respective asset.
  • CTT cumulative total time
  • Clause 16 The system of clause 15, further comprising: the server generating, in the display, a differentiator associated with the first bottleneck.
  • a method for identifying a bottleneck in a process including a plurality of assets comprising: providing a process including a lurality of assets, wherein the process is configured to repeatedly perform a process cycle; the process cycle including a plurality of operations; each respective asset of the plurality of assets: repeatedly performing at least one operation of the plurality of operations; and generating asset data defining an asset state of the respective asset; collecting, via a controller, the asset data from the plurality of assets; providing a server in communication with a database; the method further comprising the server: receiving the asset data from the controller; storing, in the database, the asset data; and for each respective asset, the server: associating, in the database, the asset data received from each respective asset with the respective asset; determining, for the respective asset: a blocked time (BT); a starved time (ST); a cumulative blocked time (CBT); a cumulative starved time (CST); and a cumulative total time (CTT), wherein the cumulative total time
  • Clause 20 The method of clause 19, further comprising: rank ordering, via the server, the plurality' of assets based on the cumulative total time (CTT) of each respective asset; identifying, via the server, a first bottleneck of the process, wherein the first bottleneck is the respective asset of the plurality' of assets having the largest cumulative total time (CTT) in the rank ordering.
  • CTT cumulative total time
  • Clause 21 The method of clause 20, further comprising: identifying, via the server, a second bottleneck of the process; wherein the second bottleneck is the respective asset of the plurality of assets having a second largest cumulative total time (CTT) in the rank ordering.
  • CTT cumulative total time
  • Clause 22 The method of clause 19, further comprising: defining a sampling period; collecting the asset data during the sampling period; the method further comprising the server: receiving the asset data collected during the sampling period; determining the cumulative total time (CTT) for the respective asset during the sampling period; and identifying a largest bottleneck of the process during the sampling period, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset determined for the sampling period; wherein the largest bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) during the sampling period, in the rank ordering.
  • CTT cumulative total time
  • Clause 23 The method of clause 22, wherein the sampling period is a defined length of time.
  • Clause 24 The method of clause 22, wherein the sampling period is a predetermined number of process cycles performed by the process.
  • Clause 26 The method of clause 25, further comprising: receiving, via the server, the asset data collected during a second sampling period; determining, via the server, the cumulative total time (CTT) for the respective asset during the second sampling period; and comparing, via the server, the cumulative total time (CTT) for the respective asset during the second sampling period to the cumulative total time (CTT) for the respective asset during the first sampling period.
  • CTT cumulative total time
  • Clause 27 The method of clause 19, further comprising: time stamping the asset data, via at least one of the controller or the server, with a time stamp; and associating, via the server, the time stamp with the asset data in the database.
  • Clause 28 The method of clause 19, further comprising: providing a data collector in communication with the controller and the server; collecting, via the data collector, the asset data from the plurality of assets.
  • Clause 29 The method of clause 28, further comprising: time stamping the asset data, via the data collector, with a time stamp; and associating, via the server, the time stamp with the asset data in the database.
  • Clause 30 The method of clause 19, wherein the process includes a sub-process performed by a group of the assets selected from the plurality of assets; the method further comprising: the server: identifying the group of assets performing the sub-process; determining the cumulative total time (CTT) for each respective asset of the group of assets; identifying a largest bottleneck of the sub-process, by rank ordering the group of assets based on the cumulative total time (CTT) of each respective asset; wherein the largest bottleneck of the sub-process is the respective asset of the group of assets having the largest cumulative total time (CTT) in the rank ordering.
  • CTT cumulative total time
  • Clause 31 The method of clause 19, further comprising: at least one asset of the plurality of assets including a process element or a sensor; wherein the process element or the sensor is configured to output the asset data.
  • Clause 32 The method of clause 20, further comprising: generating, via the server, a display defined by the asset data; the display configmed to display the cumulative total time (CTT) for each respective asset.
  • CTT cumulative total time
  • Clause 34 The method of clause 33, further comprising: generating, in the display, a differentiator associated with the first bottleneck.

Abstract

A system and method for identifying a bottleneck in a process including a plurality of assets configured to repeatedly perform a process cycle including a plurality of operations, each respective asset of the plurality of assets repeatedly performing at least one operation of the plurality of operations and generating asset data defining an asset state of the respective asset, includes a controller configured to receive the asset data from the plurality of assets, a server in communication with a database and configured to receive the asset data from the controller, store the asset data in the database, and for each respective asset, associate in the database the asset data received from each respective asset with the respective asset.

Description

METHOD TO IDENTIFY AND PRIORITIZE A BOTTLENECK IN A PROCESS
CROSS-REFERENCE TO RELATED APPLICATION
[0001] This application claims priority to and the benefit of United States Provisional Application No. 63/312,353 filed February 21, 2022, the contents of which are hereby incorporated by reference in their entirety.
TECHNICAL FIELD
[0002] The present disclosure relates generally to collecting and capturing process data from process equipment using a process controller in communication with a computing device, and more specifically, to identifying a bottleneck in a process using the collected process data.
BACKGROUND
[0003] Modem manufacturing often involves complicated processes including multiple stations. The key to improving modem manufacturing efficiency is to identify the bottleneck in the process, and resolve the bottleneck once it is identified. Identifying and prioritizing the bottleneck in a complicated process including multiple processing stations can be difficult, due to the numerous interactions between stations in the complicated process generating multiple and concurrent blocked and starved condition states between the various stations. Dynamic changes in blocked and starved conditions over time may result in improper identification of those stations having the most significant contribution to the process bottleneck, potentially causes waste in the deployment of improvement resources.
SUMMARY
[0004] Modem manufacturing often involves complicated processes including multiple stations. The key to improving modem manufacturing efficiency is to identify the bottleneck in the process, and resolve the bottleneck once it is identified. The effectiveness of improvement actions can be significantly increased by understanding which are the critical stations of a complex multi-station process contributing the most to the process bottleneck, and by prioritizing these critical stations for remedial and improvement actions. Described herein is a system and method for identifying bottlenecks in a process including multiple process stations, and prioritizing the bottlenecks for contribution to an overall process bottleneck, such that, once the bottlenecks within the individual process stations are ranked and prioritized for corrective action, the efficiency of such improvement actions can be optimized in terms of impact on reducing the overall process bottleneck.
[0005] The system and method described herein, for identifying and prioritizing a bottleneck in a process including a plurality of assets, includes the process configured to repeatedly perform a process cycle, the process cycle including a plurality of operations, where each respective asset of the plurality of assets is configured to repeatedly perform at least one operation of the plurality of operation, and generate asset data defining an asset state of the respective asset. The asset state can be, for example, a blocked state, a starved state, a running state, or a down state of the asset. The system includes a controller configured to receive the asset data from the plurality of assets, and a server in communication with a database. The server is configured to receive the asset data from the controller, store the asset data in the database, and, for each respective asset, associate, in the database, the asset data received from each respective asset with the respective asset, and determine, for the respective asset, a blocked time (BT), a starved time (ST), a cumulative blocked time (CBT), a cumulative starved time (CST), and a cumulative total time (CTT), where the cumulative total time is a sum of the cumulative blocked time (CBT) and the cumulative starved time (CST). The method and system further includes the server configured to identify a first bottleneck of the process, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset, where the first bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) in the rank ordering, identify ing a second bottleneck of the process, where the second bottleneck is the respective asset of the plurality of assets having a second largest cumulative total time (CTT) in the rank ordering, and so forth.
[0006] In one example, a sampling period is defined, which can be, for example, a defined length of time such as an hour, shift, day, etc., or a defined number of cycles of the process. The system and method in the present example includes collecting the asset data during the sampling period, where the server is configured to determine the cumulative total time (CTT) for the respective asset during the sampling period, and identify a largest bottleneck of the process during the sampling period, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset determined for the sampling period, and where the largest bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) during the sampling period, in the rank ordering.
[0007] The benefits and advantages of the system for identifying and prioritizing station bottlenecks in a multi-station complex process include providing pertinent and focused improvement actions to those process stations contributing the most to an overall process bottleneck, providing a method for analyzing starved and blocked data on a station by station basis to monitor and track improvement of station throughput performance and to improve and/or sustain overall production performance, and thus, optimize the users’ operating cost of the facility (factory), and gain efficiency by deferring improvement actions to those process stations which are not on a critical path for improvement of throughput of the overall process. [0008] The above noted and other features and advantages of the present disclosure are readily apparent from the following detailed description when taken in connection with the accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
[0009] The description herein makes reference to the accompanying drawings wherein like reference numerals refer to like parts throughout the several views, and wherein:
[0010] FIG. 1 is a schematic illustration of a system for identifying and prioritizing a bottleneck in an exemplary process included in the system, the exemplary process including a plurality of process stations (assets);
[0011] FIG. 2 is a schematic illustration of a method for identifying and prioritizing a bottleneck in a process, using the system shown in FIG. 1 ;
10012| FIGS. 3A, 3B, 3C and 3D are each a schematic illustration of definitions of blocked and starved asset states, further illustrating input/output relationships of asset(s)/station(s) in a process and their associated state(s);
[0013] FIG. 4 is a schematic illustration of the production part flow through the exemplary process shown in FIG. 1, mapping blocked (BLK) and starved (STV) asset states of a plurality of stations (assets) as determined by the part flow through the process, and for use in the identifying and prioritizing a bottleneck in the process shown in FIG. 1 , using the method shown in FIG. 2;
[0014] FIG. 5 is an illustration of a data matrix for collecting and storing asset data from the process stations (assets) of the process of FIG. 1, and for generating and storing asset data, including cumulative blocked and starved time for use in identifying bottleneck(s) in the process using the method of FIG. 2;
[0015] FIG. 6 is an illustration of exemplary algorithms used to generate the data matrixes and cumulative data shown in FIG. 5 and for use in the method of FIG. 2; and
[0016] FIG. 7 is a schematic illustration of an exemplary display generated by the method of FIG. 2 using asset data collected for a sampling period, for outputting to a user interface, the display including data tables identifying and prioritizing the bottleneck of the process of FIG. 1 determined for the sampling period.
DETAILED DESCRIPTION
[0017] In the following description, numerous details of the embodiments of the present disclosure, which should be deemed merely as exemplary, are set forth with reference to accompanying drawings to provide thorough understanding of the embodiments of the present disclosure. Therefore, those skilled in the art will appreciate that various modifications and replacements may be made in the described embodiments without departing from the protection scope and the spirit of the present disclosure. Further, for clarity and conciseness, descriptions of known functions and structures are omitted hereinafter.
[0018] Referring to the drawings, wherein like reference numbers correspond to like or similar components throughout the several figures, there is shown in FIG. 1 a system generally indicated at 100 a production facility generally indicated at 10, the system 100 configmed to identify and prioritize bottlenecks in a process generally indicated 15 including a plurality of process stations (assets) 20 configmed to repeatedly perform steps of the process 15, and a method 200 (see FIG. 2) for identifying and prioritizing bottleneck(s) of the process 15 using the system 100, are described herein. The system 100 and method 200 are configured for digitizing, identifying and prioritizing bottleneck(s) of a process 15 performed by a plurality of assets 20, also referred to herein as process stations, included in a production facility 10, a production line, etc. The process 15 can be, by way of example, a manufacturing, assembly or other production process which includes a plurality of assets 20. One or more of the assets 20, also referred to herein as process assets 20 and/or process stations 20, can include one or more process elements 25 such as devices, machines, etc., configured to perform coordinated operations, which can include automated, partially automated, and/or nonautomated operations. One or more of the assets 20 can include at least one sensor 30 for sensing one or more parameters or characteristics of the station 20, station elements 25, product being processed by the station 20, the station environment, etc., and generating a sensor signal corresponding to the sensed parameter and/or characteristic. Data generated by the process station 20, process element 25 and/or sensor 30 can be collected by a data collector 45 via a network 40, for use by a server 50 to identify condition states of the various process stations 20, including conditions such as blocked, starved, down and running, for use by tire server 50 in identifying and prioritizing bottleneck(s) in the process 15.
[0019] Referring to FIG. 1, in a non-limiting example, the system 100 includes a facility 10 having one or more production lines 15 including one or more process stations (assets) 20 controlled by one or more controllers 35. The production line 15, also referred to herein as a process line 15 and/or a process 15, can include a plurality of sub-processes, which in the illustrative example shown in FIGS. 1 and 4 include sub-processes 15A, 15B, 15C, and 15D. Each of these includes at least one asset 20 for performing at least one operation of the process cycle or sequence of operations performed by the process 15. In the illustrative example shown in FIGS. 1 and 4, the process 15 includes a plurality of process stations 20 each identified by a station identifier STAx. For example, sub-process 15A includes stations 20 identified as STA1, STA2, STA3, STA4, STA5, STA6, STA7, STA8, STA9, and STA10. In the example shown, sub-process 15B includes a single station 20 identified as STA3A. Sub-process 15C includes stations 20 identified as STA5A and STA5B. Subprocess 15D includes stations 20 identified as STA11, STA12, STA 13. and STA14. As shown in FIGS. 5 and 6, a sequence of N stations 20 can be selected by the server 50 and/or by a system user via a user device 60, for bottleneck analysis. The sequence of N stations 20 selected for bottleneck analysis can include all stations 20 in the process 15, or a portion of the stations 20 in the process 15. In an illustrative example described herein, including an exemplary bottleneck analysis output display shown in FIG. 7, the sub-process 15 A is selected for bottleneck analysis, including process stations STA1 through STA10.
[0020] Referring again to FIG. 1, the controllers 35 are in communication with the process stations 20 and with a data collector 45. The data collector 45 is configured for receiving data from the controllers 35 and, in accordance with the method 200 described herein, and for selectively transmitting data to a system server 50 for storage to a database 55. In an illustrative example, the data collector 45 and/or the server 50 uses process data collected from the process stations 20, process elements 25, and/or sensors 30 to determine, for example, the condition state(s) of each respective process station 20 during a sampling period 95. The condition state of a process station (asset) 20 can be, for example, at a given time, a starved, blocked, down, or running state as determined from the asset data collected from the process station 20. The database 55 and/or server 50, in a non-limiting example, can be configured as cloud computing resources. The system 100 further includes at least one user device 60 in communication with the server 50. The user device 60 includes a user interface 65 for displaying data and other process information collected and generated by the system 100, and for receiving inputs, including instructions, from a user of the user device 60.
[0021] Each of the stations 20, controllers 35, data collector 45, server 50, and user device(s) 60 are in communication via a network 40. Examples of the network 40 include but are not limited to the internet, intranet, local area network, mobile communication network, and combinations thereof. Each of the controllers 35, data collector 45, server 50, and user device(s) 60 can include a memory for receiving, storing, generating and/or providing the station (asset) data 70 and data derived therefrom including detailed data 75 including process input data, condition state data, etc., and data derived therefrom including cumulative data 80 such as a cumulative blocked time (CBT), cumulative starved time (CST) and cumulative total (blocked and starved) time (CTT) for each of the process stations 20 over a sampling period 95, within a process 15, a sub-process 15A... 15D, of the system 100, and further include a central processing unit (CPU) for executing applications and/or algorithms as required to perform the method 200 described herein. The memory, at least some of which is tangible and non-transitory, may include, by way of example, ROM, RAM, EEPROM, etc., of a size and speed sufficient, for example, for executing the applications and algorithms required to perform the method 200, receiving, storing, generating, and/or collecting the station data 70, storing the data to the database 55, and/or communicating with other devices via the network 40.
[0022] Referring again to FIG. 1, each controller 35 is configmed to control one or more stations 20 to perform coordinated operations, including processing steps and/or a sequence of operations. A process station 20 is configured to repeatedly perform one or more processing steps, one or more operations, and/or a sequence of operations as defined (instructed) by the controller 35. It would be understood that the station 20 would, in operation, repeatedly perform the sequence of operations comprising ordered steps as an operating cycle, under control of the controller 35, such that the station data 70 generated by the station 20 can include detailed asset data 75 from each of the repeated operating cycles performed by the station 20. As shown in FIGS. 3A-3D, a station 20 can include one or more station elements 25, such as devices, tools, fixtures, etc. for performing the various steps and/or operations as instructed and/or controlled by the controller 35. As shown in FIGS. 3A-3D, a station 20 can include one or more sensing devices 30, also referred to herein as sensors 30, for sensing one or more parameters or characteristics of the station 20, station elements 25, product being processed by the station 20, the station environment, etc., and generating a sensor signal corresponding to the sensed parameter and/or characteristic. The sensor 30 is in communication with the controller 35, via the station 30 and/or the network 40, such that during operation of a production cycle, the sensor 30 is outputting sensor signals which are received by the controller 35 for processing according to the bottleneck identifying and prioritizing method 200 described further herein. In one example, the production line 15 can be configured as a machine, and/or can include a plurality of machines, such that each station 20 can include one or more machines. Accordingly, the terminology production line, sub-line, main assembly line, station, machine, etc. is not intended to limit the implementation as described and/or claimed herein.
[0023] The station data 70 collected and/or generated by the controller 35 and/or data collector 45 can include condition state data for a station 20, where a state, which may be referred to as a condition state or as a condition, as used herein, refers to a state of the process station 20 and/or a station element 25, a state of an object (such as a product or a workpiece) being operated on by the station 20, a condition, a status, a parameter, a position, or other property of the station, operation, object, product or workpiece being monitored, measured and/or sensed. Non-limiting examples of condition states including cycle start time, cycle stop time, element start time, element travel, element stop time, position of an element or object, a dimensional measurement or parameter of an object which can include a dimensional measurement of a feature of the object, or a station element 25, a feature of a station 20, a feature of a workpiece to which an operation is being performed by a station 20 and/or station element 25, a condition of one or more of a station element 25, a station 20, a production line 15 or workpiece, or a condition of the environment within the facility 10. A condition state could further include for example, operating conditions of a station 20 or station element 25, such as on, off, open, closed, auto, manual, stalled, blocked, starved, running, traveling, stopped, down, faulted, OK, good, bad, in tolerance, out of tolerance, present, not present, extended, retracted, high, low, etc., and can include for example, a measure of a physical property such as chemistry, temperature, pressure, color, shape, position, dimensional conditions such as size, surface finish, thread form, a functional parameter such as voltage, current, torque, pressure, force, etc., such that it would be understood that the terms state, condition, condition state and/or parameter as describing station data 70, detailed data 75, and summary data 80, are intended to be defined broadly. In the illustrative example described herein, and referring to FIGS. 5-7, the asset data 70 collected during a sampling period 95 from the process stations 20 can be used to determine, for each process station 20, die amount of time that the process station 20 is in each of a condition state of starved, blocked, down and running, for use in identifying and prioritizing the bottleneck(s) of the process 15 and/or a portion or sub-process, for example, sub-process 15A, of the process 15. The condition states of starved, blocked, down and running can also be referred to herein as asset states of a process station (asset) 20. A station 20 is starved with the station 20 is empty and/or waiting for an upstream station 20 to finish and send the next part over. A station 20 is blocked with the process steps performed by that station 20 have been completed and that station 20 is waiting to send the part out to a downstream station 20. Referring to FIG. 4, in an illustrative example the points in the process 15 at which a respective process station STAx can be blocked by an upstream station STA(x-l), for example, are indicated by an icon labeled STVy. where y represents the number of inputs to the station STAx which can place the station STAx in a starved condition (see for example, STA3 in FIG. 4 receiving inputs from upstream stations STA3A and STA2 associated respectively with starved states STV1 and STV2 of station STA3). In the illustrative example, the points in the process 15 at which a respective process station STAx can starve a downstream station STA(x+l), for example, are indicated by an icon labeled BLKz where z represents the number of outputs from the station STAx which can place z downstream stations in a blocked condition (see for example, STA8 in FIG. 4, having outputs to STA9 and Pay Point 1 associated respectively with blocked states BLK1 and BLK2). See also the examples shown in FIGS. 3A, 3B, 3C and 3D, showing the relationship between the number of inputs z from downstream assets 20 and potential blocked states BLKz of an asset 20 when the inputs z are not received by the asset 20, and the relationship between the number of outputs z from an asset 20 and the number of upstream assets 20 subject to starved states STVy when the outputs z from the asset 20 are not outputted. A station 20 is down when the station 20 malfunctions and stops processing the part or cycling. A station 20 can be down when faulted or when the station 20 generates a fault code, such that a down station 20 can also be referred to as a faulted station. A station 20 is running when the station 20 is operating to complete the process steps performed up that station. A running station can also be referred to herein as a station which is up.
[0024] Referring to FIGS. 5-7, the amount of time a process station 20 is determined to be in a blocked condition is referred to herein as a blocked time (BT), the amount of time a process station 20 is determined to be in a starved condition is referred to herein as a starved time (ST), the amount of time a process station 20 is determined to be in a down condition is referred to herein as a down time (DT), the amount of time a process station 20 is determined to be in a running condition is referred to herein as an uptime or a running time (RT), where the sum of these indicates a total asset time (TT) of a sampling period 95 during which the condition states of the process station 20 are determined. A sampling period 95 can be, for example, a period of time which can be, for example, a length of time during which asset data 70 is collected from the process 15 according to a sampling plan and/or at a sampling frequency, an increment of time such as a hour, a shift, a day, etc., or a range of process cycles performed by the process 15 which can be, for example, a single process cycle, a number of consecutive cycles from which data is collected according to a sampling plan and/or al a sampling frequency, cycles completed by the process 15 in a period of time, each cycle identified by a cycle number or other cycle identifier, etc. In one example, asset data 70 can be collected and analyzed continuously, such that the sampling period 95 is continuous. The server 50 can be configured to select, for example, in response to sampling plan or instructions received by the server via a user interface 65, a portion of the continuous sampling period 95 for identification of the bottleneck(s) of the process 15 during the respective portion of the continuous sampling period 95, and to determine, for the respective portion of the sampling period 95, cumulative data 80 for identifying and prioritizing the bottleneck(s) of the process, and for outputting a display 90 defined by the respective portion to a user interface 90.
[0025] Referring to the non-limiting example illustrated by the figures, FIG. 1 shows an example system 100 for implementing a method 200 (see FIG. 2) for identifying and prioritizing a bottleneck of a process 15 including a plurality of assets 20. In the example system 100 shown in FIG. 1, the process 15 is a production line including a plurality of assets 20, each asset 20 identified as a process station STAx, where “x” is an identifier of that station 20. In the non-limiting example, the sample process 15 includes a production main line 15 A including ten stations STA1 . . . STA10 configured for processing a workpiece, such as an assembly (not shown). The process 15 receives inputs from three load points, identified in FIGS. 1 and 4 as Load Point 1 inputting to STA1, Load Point 2 inputting to station STA3A, and Load Point 3 inputting to station STA 5A. The process 15 further includes two sub-assembly lines 15B, 15C. Sub-assembly line 15B, also referred to herein as a sub-line 15B includes station STA3A, which receives input from Load Point 2, such that station STA3 and sub-line 15B are in a starved state (STV1) when no incoming material is available from Load Point 2, as illustrated in FIG. 4. Sub-assembly line 15C includes stations STA5A and STA5B. Station STA5A receives input from Load Point 3, such that station STA5 A and downstream station STA5B are in a starved stale (STV1) including 3 stalions STA3A, STA5A, STA5B. The main production line 15 A receives an initial input, for example, a workpiece, from Load Point 1, which is then processed subsequently through stations STA1 and STA2. At station STA3, an additional input, such as a sub-assembly or component part, is received from station STA3Aof sub-line 15B. The workpiece is further processed through station STA4 and receives a second additional input from station STA5B of sub-line 15C at STA5. The workpiece is then subsequently processed through stations STA6, STA7 and STA8, where the workpiece is either outputted from the process line 15 to Pay Point 1, or outputted for additional processing to subsequent stations STA9 and STA10, and outputted from the process line to Pay Point 2 or to STA11. In one example, the workpiece can be outputted to Pay Point 2 and a carrier used for conveying the workpiece through the main process 15A can be outputted to station STA11 for return as an empty carrier via sub-line 15D to station STA1 to receive a new workpiece. The example is non-limiting, and other process configurations are anticipated within the scope of the disclosure. In the example method 200 shown in FIG. 2, at step 205 a group of N stations including subsequent stations STA1 through STA 10 of process line 15Aare identified for bottleneck analysis.
[0026] The system 100 includes at least one controller 35, including, in the present examples, controllers Ml, M2 (see FIG. 1) which are connected to a data collector 45 through a factory network 40. Each of the assets 20, shown as stations STAx, are connected to and controlled by at least one of the controllers Ml, M2. The data collector 35 collects the data, also referred to herein as asset data 70, from the assets 20, in the present example, from process stations STAx, via the controllers 35, and conducts preliminary' processing of the asset data 70, which can include, for example, time stamping the data, sending the data to a factory server 50 or cloud source 50 where the data 70 is processed according to the method 200 (see FIGS. 2 and 5-7) and/or using the exemplary algorithms shown in FIG. 6, stored in a database 55, for example, as shown in the data matrices in FIGS. 4 and 7, and/or outputted as a display 90, for example, to an output device 60, such as a computer, laptop, mobile device, and/or the like including a user interface 65, wherein the output device 60 is in communication with the server 50 and/or could source 50 via the network 40. The network 40 can be configured as a wired network, a wireless network, and/or a combination of these, and can include and/or be in communication via the Internet.
[0027] Referring to FIG. 2, shown in a non-limiting example is a method 200 for identifying and prioritizing one or more bottlenecks in the process 15. The method 200 is illustrated by FIGS. 3-6 and further described herein. At step 205, the method 200 begins with identifying N stations STA1.... STAx... STAN of the process 15 to be analyzed for bottleneck(s). In the present example, stations STA1 through STA10 of main process 15A are selected for bottleneck analysis. In the illustrative example, only STV1 and BLK1 events on the main line 15A are being analyzed, as they related to movement of tire mam workpiece. As such, stations STA 3A, 5 A and 5B are excluded from the illustrated example. Further, sub-line 15D and stations STA11 through STA14 are excluded as non-production operations for returning workpiece carriers from station STA10 to station STA1, and are unrelated to movement of the main workpiece.
[0028] Referring to FIG. 3, including key 105 identifying blocked and starved icons used in the various figures, in any process 15 that contain multiple assets/stations 20, each asset or station 20 will perform its assigned task in set time (cycle time). The cycle time of each asset or station 20 in the process 15 will most likely be different than the cycle time of another asset or station 20 in the process 15, such that it would be understood that an asset 20 with relatively shorter cycle time will most likely finish its task before another asset 20 performing a task with a relatively longer cycle time, and will be must wait for the asset 20 with the relatively longer cycle time to finish its job before the asset 20 with the relatively shorter cycle time can transfer the part (workpiece) out of its station 20. During the time which the asset 20 with the relatively shorter cycle is waiting to transfer the part (workpiece) out of its station 20, the asset 20 is “blocked” (BLK) from taking an action (in this example, transferring out the part to a subsequent station 20), and the amount of time the asset 20 must wait to transfer out the part (in this example) is referred to as the blocked time (BT).
[0029] Still referring to FIG. 3, an asset 20 can also be starved if it transfers its part (workpiece) out and no new part arrives to its station 20 for processing. During the time which the asset 20 is waiting to receive a new part (workpiece) into its station 20, the asset 20 is “starved” (STV) from taking an action (in this example, beginning to process a new part), and the amount of time the asset must wait to receive the new part (in this example) is referred to as the starved time (ST). The total asset time (TT) taken by an asset (station 20) STAx to complete processing of a workpiece includes the starved time (ST) during which the asset 20 STAx is waiting for the part to be received not station STAx from an upstream station 20 STA(x-l), the run time (RT) spent in the station 20 STAx processing the part, any down time (DT) incurred while the part is in the station 20 STAx, for example, due to a fault of the station 20, and the blocked time (BT) during which the station 20 STAx is blocked from outputting the processed part to a subsequent (downstream) station 20 STA(x+l). [0030] Still referring to FIG. 3, shown are various possible configurations for each asset 20, with respect to inputs potentially starving (STV) the asset 20 and outputs from the asset 20 which potentially block (BLK) and/or prevent movement of the workpiece from the asset 20. In the example shown in FIG. 3 A, an asset 20 may have one input such as a downstream process station 20 which can induce a starved condition (STV1) of the asset 20 when the downstream process station 20 does not provide a workpiece for processing by the asset 20, and may have one output such as an upstream process station 20 which can induce a blocked condition (BLK1) of the asset 20 by preventing transfer of the workpiece from the asset 20 to the upstream process station 20. In the example shown in FIG. 3B, an asset 20 may have one input which can induce a starved state (STV1) of the asset 20 and multiple outputs, such that the asset 20 may be blocked if unable to transfer out its processed workpiece to any one of the multiple outputs (BLK1, BLK2, BLK3), which may be downstream process stations. In the example shown in FIG. 3C, an asset 20 may have multiple inputs potentially inducing a starved state of the asset 20 if a needed component is not received from any one of the inputs (upstream processes) and, in the example shown, may have one output such as a downstream process station 20 which can induce a blocked condition (BLK1) if the downstream process 20 prevents transfer of the workpiece from the asset 20. FIG. 3D shows another example of an asset 20 which may have multiple inputs which can induce multiple starved conditions (STV1, STV2, STV3), and multiple outputs which can induce multiple blocked conditions (BLK1, BLK2, BLK3). As illustrated by the examples, each input for the asset 20 can create a starved condition STV, and each output can present a blocked condition BLK to the asset 20. The main work piece movement through the asset 20 can be described as being starved (STV) for a starved time (ST), being blocked (BLK) for a blocked time (BT), being worked on for a run time (RT), and/or being faulted or down for a down time (DT), where the total of these times (TT) represents the total time the workpiece is located in the asset (process station) 20.
[0031] Referring to FIG. 4, in a non-limiting example the process (production line) 15 of FIG. 1 is shown including a key 110 referencing the various icons and symbols used in the figures, FIG. 1 illustrating workpiece (part) flow through the process 15 beginning with a load point 1 loading a workpiece to an asset (station) 20 indicated as station 1 (STA1) as the start of the main line 15 A, with work flow continuing to station 2 (STA2) and so forth, as shown in the figures. In the non-limiting example, at station 8 (STA8) the workpiece can be unloaded from the production line 15Ato a first pay point "‘Pay Point 1”, or may be further processed at station 9 (STA9) and unloaded from the production line 15Afrom station 10 (STA10) to a second pay point “Pay Point 2”. In the non-limiting example, Stations 11 to 14 (STA11, STA12, STA 13. STA14) are return stations for the return of part carriers which are now empty after being unloaded at station 10 (STA10), to station 1 (STA1) where the part carrier receives a new part or workpiece (indicated by the bold arrow inputting to station 1 (STA1).
[0032] Still referring to FIG. 4, the main process flow is between stations STA 1 to STA 10, e.g. via Stations 1 through 10, with inputs from sub-lines STA3A at STA3 and from sub-lines STA5A and STA5B at STA5. In FIG. 4, all the possible blocked and starved conditions associated with this sample line have been labeled respectively with BLK1 (blocked) and STV1 (starved) designated to the main work piece flow. As previously noted, in an illustrative example, at step 205 of the method 200, N stations STA1... .STAx... STA10 of the process line 15A are identified to be analyzed for bottleneck(s). Referring again to FIGS. 1, 2 and 4, at step 210 of the method 200, station (asset) data 70 is collected from each of the N stations by the data collector 45, for example, via the controller 35 over a sampling period 95. At step 215, for each of the N stations 20, a blocked time (BT), a starved time (ST), a down time (DT) and a run time (RT) is determined by the controller 35, the data collector 45 and/or the server 50, using the collected asset data 70, and is associated with the respective station 20 and stored to a database 55 as detailed station data 75 shown in FIGS. 5 and 7.
[0033] Referring to FIG. 5, including a key 115 referencing the abbreviations and or acronyms used in the various data tables, equations and the figures, an example data structure for collecting and storing station data 75 is shown, and an example data structure 80 for determining and storing cumulative data 80 is shown. FIG. 6 illustrates example algorithms for identifying and prioritizing bottlenecks in the process, including algorithms for determining cumulative blocked time (CBT), cumulative starved time (CST) and cumulative total time (CTT) for each station 20 of the N stations. The cumulative total time (CTT) of a station STAx is a sum of the cumulative blocked time (CBT) and the cumulative starved time (CST) determined for the station STAx, as shown in the figures. As such, the cumulative total time (CTT) can also be referred to herein as the total cumulative blocked and starved time (CTT). Assuming a process 15 having N assets (N stations), each asset 20 of the N assets will have its blocked time (BT), starved time (ST), down time (DT) and run time (RT), which can be determined, for example, from station data collected from the process assets 20 via the controllers 35 controlling the process assets 20 and/or from the data collector 45. Referring to FIGS. 5 and 6, for example, the first station STA1 has blocked time BT1, a starved time STI, a down time DTI and a run time RT1, determined using data collected from process station STA1. In the example shown, the total asset time (TT) of STA1, is the sum of these times, e.g., TT = BT1 + STI + DTI + RT1.
10034| As shown in FIGS. 5 and 6, at step 215 of the method shown in FIG. 2, using data collected from the N stations 20 of the process 15, the blocked time BT, starved time ST, down time DT and run time RT is determined for each of the N stations, e.g., for each of the stations STA1... STA10 in the present example. Once the BT, ST, DT and RT is determined for each of the N assets 20, the system 100, for example, via the factory server 50 and/or cloud resource 50, at step 220 of the method shown in FIG. 2, and as shown in FIG. 6, calculates the cumulative blocked time (CBT) for each respective station STAx, by summing the blocked time (BT) of each station upstream of the respective station and calculates the cumulative starved time (CST) for each respective station STAx, by summing the starved time (ST) of each station 20 which is downstream of the respective station STAx. The system 100 then calculates a cumulative total time (CTT) for the respective station 20 by summing the cumulative blocked time (CBT) and cumulative starved time (CST) for the respective station STAx, e.g., for each station STAx, CTT = (CBT + CST). For example, the cumulative blocked time CBT1 of station STA1 is 0, as it is the first station and has no upstream stations. The cumulative starved time CST1 of station STA1 is calculated as the sum of the starved times ST2... .ST N, from stations STA2 through STAN (in the present example, STA10), as these stations are all downstream of the first station STA1. The cumulative total time CTT1 of STA1 is the sum of both values, e.g., CTT1 = CBT1 + CST1.
[0035] Still referring to FIGS. 5-7, the method 200 repeats the calculations, using the algorithms as shown and data collected from the respective stations 20, for each additional station STAx in the process, e g., for each of the stations STA2 through STAN (STA10 in the illustrative example), to generate a cumulative total time CTT for each of these stations, e.g., CTT2 through CTT N are each calculated. The method 200, at step 225, then ranks the cumulative total times (CTT1 . . . . CTTN) determined for each of the N assets, 20 and identifies the biggest bottleneck in the process 15 as the station 20 having the highest (largest) cumulative total time CTT. In the present example shown in FIG. 7, the station 20 with the highest cumulative total time CTT determined for the reported sampling period 95, is determined to be station STA5 having a cumulative total time CTT of 1,353 minutes during the reported sampling period 95. The second biggest bottleneck is identified as the station 20 having the second highest (second largest) cumulative total time CTT, in the present example station STA3 having a CTT of 1,223 minutes during the sampling period 95, and so. Advantageously, this ranking can be used to prioritize action to the biggest bottlenecks, to improve efficiency and throughput of the production line 15. Referring to FIGS. 2 and 7, method 200 at step 230, in an illustrative example, can generate via the system 100, the server 50 or cloud resource 50, an output display 90 as shown in FIG. 7, where in the non-limiting example, the asset data 70 are displayed by station identifier (see 75A, 80A in FIG. 6) and by rank ordering the highest to lowest CTT (see 75B, 80B in FIG. 6). The data display 90 can be outputted, for example, to a user device 60 in communication with the server 50 via the network 40, for display via a user interface 65 of the user device 60. In the illustrative example shown in FIG. 7, one or more differentiators 120 may be generated by the system 100 and displayed in the display 90, to highlight certain data. In the present example, asset data 75 and cumulative data 80 generated for station STA5 is differentiated by boxing the data in the display 90 with a thick-line box, to highlight station STA 5 as having the highest (largest) cumulative total time CTT and as such, presenting the biggest (largest) bottleneck to the process 15 of the N stations being analyzed. The example differentiator 120 shown in FIG. 7 is nonlimiting, and it would be understood that other data display formats and differentiators 120 are anticipated within the disclosure described herein. For example data 70 can be displayed in graphical forms such as line charts, pie charts, bar charts and the like, which may be dynamically updated over time. Other forms of differentiators 120 such as icons, pop-up windows, highlighting, shading, coloring, blinking or other visual differentiators 120, and/or audio differentiators such as an audible alert when a CTT threshold is crossed, are possible.
[0036] At step 235 of the method shown in FIG. 2, one or more users of the system 100 can use the bottleneck analysis displayed in display 90 of FIG. 7 to prioritize improvement actions for those stations 20 identified as having the highest contribution to a bottleneck of the process 15.
[0037] Referring to FIG. 7, shown is a non-limiting example of data 70 collected from the process 15 A shown in FIG. 4, to which die method 200 and algorithms 85 shown in FIGS. 2 and 6 are applied to identify the biggest boltleneck(s) in the process 15 A, such that action can be focused on the biggest bottleneck(s) to improve product line throughput and efficiency. As shown in FIG. 7, the station times 75, e g., the blocked time BT, starved time ST, down time DT and run time RT, have been determined for each of the stations STA1 to STA10, using, for example, data 70 collected from the production line 15 and/or the stations STA1. . . STA 10, via the controller(s) 35 and the data collector (see FIGS. 1 and 4). The data 70 can be collected and generated, in one example, over and for a sampling period 95 of time, such as a production shift or number of shifts, and used to calculate the asset times 75 (BT, ST, DT and RT) for each of the stations STA1 to STAN dining the sampling period 95. In another example, the data 70 can be collected continuously and can be used to dynamically and/or periodically update the asset data 75 (BT, ST, DT and RT) for each of the stations STA1 to STAN to provide a dynamic indication of the blocked and starved condition states of the stations 20 and the production line 15. Using the collected data, the factory server 50 and/or cloud resource 50, as shown in FIG. 6, calculates the cumulative blocked time (CBT) for each respective station STAx, by summing the blocked time (BT) of each station 20 which is upstream of the respective station STAx, and calculates the cumulative starved time (CST) for each respective station STAx, by summing the starved time (ST) of each station 20 which is downstream of the respective station STAx. Using station STA5 as an example, the cumulative blocked time CBT5 for STA5 is shown having a value of 830, and is calculated by summing the blocked time (BT) of the stations upstream of STA5, e.g., CBT5 = BT1+BT2+BT3+BT4 = 305+228+102+195 = 830. The cumulative starved time CST5 for STA5 is shown having a value of 523, and is calculated by summing the blocked time (ST) of the stations downstream of STA5, e.g., CST5 = ST6+ST7+ST8+ST9+ST10 = 158+123+121+56+65 = 523. The cumulative total time CTT5 of STA5 is the sum of these two values, e.g., CTT5 = CBT5 + CST5 = 830+523 = 1353 in the example shown.
[0038] As shown in FIGS. 5-7 and step 220 of the method 200, the system 100 calculates a cumulative total time (CTT) for each respective station STA1 through STA10 (in the present example) by summing the cumulative blocked time (CBT) and cumulative starved time (CST) for the respective station, e.g., for each station, CTT = CBT + CST of that station. The system 100 and the method 200 at step 225 then rank orders the CTTs of the stations STA1... STA10, to determine the biggest bottlenecks in the process 15. In the example shown, STA5 is identified as the biggest bottleneck, having a cumulative total time CTT of 1353. The second biggest bottleneck is STA3, having a cumulative total time CTT of 1223. STA1 is identified as the smallest contributor to process bottlenecks, having a cumulative total time CTT of 696. By applying the method 200 shown, improvement resources, for example, at step 235, can be focused on the biggest (prioritized) bottlenecks STA5 and STA3, and as improvements are implemented, the CTT for each station 20 can be recalculated to determine the impact of the improvement actions, and/or to prioritize additional actions to improve production line efficiency and throughput by reducing bottlenecks.
[0039] The term “comprising” and variations thereof as used herein is used synonymously with the term “including” and variations thereof and are open, non-limiting terms. Although the terms “comprising” and “including” have been used herein to describe various embodiments, the terms “consisting essentially of’ and “consisting of’ can be used in place of “comprising” and “including” to provide more specific embodiments and are also disclosed. As used in this disclosure and in the appended claims, the singular forms “a”, “an”, “the”, include plural referents unless the context clearly dictates otherwise. [0040] The detailed description and the drawings or figures are supportive and descriptive of the disclosure, but the scope of the disclosure is defined solely by the claims. While some of the best modes and other embodiments for carrying out the claimed disclosure have been described in detail, various alternative designs and embodiments exist for practicing the disclosure defined in the appended claims. Furthermore, the embodiments shown in the drawings or the characteristics of various embodiments mentioned in the present description are not necessarily to be understood as embodiments independent of each other. Rather, it is possible that each of the characteristics described in one of the examples of an embodiment can be combined with one or a plurality of other desired characteristics from other embodiments, resulting in other embodiments not described in words or by reference to the drawings. Accordingly, such other embodiments fall within the framework of the scope of the appended claims.
[0041] The following Clauses provide example configurations of a system and method for identifying and prioritizing bottleneck(s) of a process including a plurality of process stations as disclosed herein.
[0042] Clause 1. A system for identifying a bottleneck in a process including a plurality of assets, the system comprising: a process including a plurality of assets, wherein the process is configured to repeatedly perform a process cycle; the process cycle including a plurality of operations; wherein each respective asset of the plurality of assets is configured to: repeatedly perform at least one operation of the plurality of operations; and generate asset data defining an asset state of the respective asset; a controller configured to receive the asset data from the plurality of assets; a server in communication with a database; the server configmed to: receive the asset data from the controller; store, in the database, the asset data; for each respective asset: associate, in the database, the asset data received from each respective asset with the respective asset; determine, for the respective asset: a blocked time (BT); a starved time (ST); a cumulative blocked time (CBT); a cumulative starved time (CST); and a cumulative total time (CTT), wherein the cumulative total time is a sum of the cumulative blocked time (CBT) and the cumulative starved time (CST).
[0043] Clause 2. The system of clause 1, further comprising: the server configmed to identify a first bottleneck of the process, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset; wherein the first bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) in the rank ordering.
[0044] Clause 3. The system of clause 2, further comprising: the server configmed to identify a second bottleneck of the process; wherein the second bottleneck is the respective asset of the plurality of assets having a second largest cumulative total time (CTT) in the rank ordering.
[0045] Clause 4. The system of clause 1, further comprising: a sampling period; wherein the asset data is collected during the sampling period; wherein the server is configured to: determine the cumulative total time (CTT) for the respective asset during the sampling period; and identify a largest bottleneck of the process during the sampling period, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset determined for the sampling period; wherein the largest bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) during the sampling period, in the rank ordering.
[0046] Clause 5. The system of clause 4, further comprising: wherein the sampling period is a defined length of time.
[0047] Clause 6. The system of clause 4, wherein the sampling period is a predetermined number of process cycles performed by the process.
[0048] Clause 7. The system of clause 4, wherein: the sampling period is a first sampling period; the cumulative total time (CTT) of each respective asset determined for the first sampling period is a first cumulative total time (CTT) of the respective asset.
[0049] Clause 8. The system of clause 7, further comprising: the server configured to receive the asset data collected during a second sampling period; wherein the server is configured to: determine the cumulative total time (CTT) for the respective asset during the second sampling period; and compare the cumulative total time (CTT) for the respective asset during the second sampling period to the cumulative total time (CTT) for the respective asset during the first sampling period.
[0050] Clause 9. The system of clause 1, wherein: at least one of the controller or the server is configured to time stamp the asset data; and the server is configured to associate the time stamp with the asset data in the database
[0051] Clause 10. The system of clause 1, further comprising: a data collector in commimication with the controller and the server; the data collector configured to collect the asset data from the plurality of assets.
[0052] Clause 11. The system of clause 10, wherein: the data collector is configured to time stamp the asset data with a time stamp; and the server is configmed to associate the time stamp with the asset data in the database.
[0053] Clause 12. The system of clause 1, wherein the process includes a sub-process performed by a group of the assets selected from the plurality of assets; the system further comprising: the server configmed to: identify the group of assets performing the sub-process; determine the cumulative total time (CTT) for each respective asset of the group of assets; identify a largest bottleneck of the subprocess, by rank ordering the group of assets based on the cumulative total lime (CTT) of each respective asset; wherein the largest bottleneck of the sub-process is the respective asset of the group of assets having the largest cumulative total time (CTT) in the rank ordering.
[0054] Clause 13. The system of clause 1, further comprising: at least one asset of the plurality of assets including a process element or a sensor; wherein the process element or the sensor is configmed to output the asset data. [0055] Clause 14. The system of clause 2, further comprising: the server configured to generate a display defined by the asset data; the display configured to display the cumulative total time (CTT) for each respective asset.
[0056] Clause 15. The system of clause 14, wherein the cumulative total time (CTT) for each respective asset is displayed in the rank ordering of the plurality of assets.
[0057] Clause 16. The system of clause 15, further comprising: the server generating, in the display, a differentiator associated with the first bottleneck.
[0058] Clause 17. The system of clause 16, wherein the differentiator is a visual differentiator.
[0059] Clause 18. The system of clause 16, wherein the differentiator is an audible differentiator.
[0060] Clause 19. A method for identifying a bottleneck in a process including a plurality of assets, the method comprising: providing a process including a lurality of assets, wherein the process is configured to repeatedly perform a process cycle; the process cycle including a plurality of operations; each respective asset of the plurality of assets: repeatedly performing at least one operation of the plurality of operations; and generating asset data defining an asset state of the respective asset; collecting, via a controller, the asset data from the plurality of assets; providing a server in communication with a database; the method further comprising the server: receiving the asset data from the controller; storing, in the database, the asset data; and for each respective asset, the server: associating, in the database, the asset data received from each respective asset with the respective asset; determining, for the respective asset: a blocked time (BT); a starved time (ST); a cumulative blocked time (CBT); a cumulative starved time (CST); and a cumulative total time (CTT), wherein the cumulative total time is a stun of the cumulative blocked time (CBT) and the cumulative starved time (CST).
[0061] Clause 20. The method of clause 19, further comprising: rank ordering, via the server, the plurality' of assets based on the cumulative total time (CTT) of each respective asset; identifying, via the server, a first bottleneck of the process, wherein the first bottleneck is the respective asset of the plurality' of assets having the largest cumulative total time (CTT) in the rank ordering.
[0062] Clause 21. The method of clause 20, further comprising: identifying, via the server, a second bottleneck of the process; wherein the second bottleneck is the respective asset of the plurality of assets having a second largest cumulative total time (CTT) in the rank ordering.
[0063] Clause 22. The method of clause 19, further comprising: defining a sampling period; collecting the asset data during the sampling period; the method further comprising the server: receiving the asset data collected during the sampling period; determining the cumulative total time (CTT) for the respective asset during the sampling period; and identifying a largest bottleneck of the process during the sampling period, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset determined for the sampling period; wherein the largest bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) during the sampling period, in the rank ordering.
[0064] Clause 23. The method of clause 22, wherein the sampling period is a defined length of time.
[0065] Clause 24. The method of clause 22, wherein the sampling period is a predetermined number of process cycles performed by the process.
[0066] Clause 25. The method of clause 22, wherein: the sampling period is a first sampling period; the cumulative total time (CTT) of each respective asset determined for the first sampling period is a first cumulative total time (CTT) of the respective asset.
[0067] Clause 26. The method of clause 25, further comprising: receiving, via the server, the asset data collected during a second sampling period; determining, via the server, the cumulative total time (CTT) for the respective asset during the second sampling period; and comparing, via the server, the cumulative total time (CTT) for the respective asset during the second sampling period to the cumulative total time (CTT) for the respective asset during the first sampling period.
[0068] Clause 27. The method of clause 19, further comprising: time stamping the asset data, via at least one of the controller or the server, with a time stamp; and associating, via the server, the time stamp with the asset data in the database.
[0069] Clause 28. The method of clause 19, further comprising: providing a data collector in communication with the controller and the server; collecting, via the data collector, the asset data from the plurality of assets.
[0070] Clause 29. The method of clause 28, further comprising: time stamping the asset data, via the data collector, with a time stamp; and associating, via the server, the time stamp with the asset data in the database.
[0071] Clause 30. The method of clause 19, wherein the process includes a sub-process performed by a group of the assets selected from the plurality of assets; the method further comprising: the server: identifying the group of assets performing the sub-process; determining the cumulative total time (CTT) for each respective asset of the group of assets; identifying a largest bottleneck of the sub-process, by rank ordering the group of assets based on the cumulative total time (CTT) of each respective asset; wherein the largest bottleneck of the sub-process is the respective asset of the group of assets having the largest cumulative total time (CTT) in the rank ordering.
[0072] Clause 31. The method of clause 19, further comprising: at least one asset of the plurality of assets including a process element or a sensor; wherein the process element or the sensor is configured to output the asset data.
[0073] Clause 32. The method of clause 20, further comprising: generating, via the server, a display defined by the asset data; the display configmed to display the cumulative total time (CTT) for each respective asset. [0074] Clause 33. The method of clause 32, wherein the cumulative total time (CTT) for each respective asset is displayed in the rank ordering of the plurality of assets.
[0075] Clause 34. The method of clause 33, further comprising: generating, in the display, a differentiator associated with the first bottleneck.
[0076] Clause 35. The method of clause 34, wherein the differentiator is a visual differentiator.
[0077] Clause 36. The method of clause 34, wherein the differentiator is an audible differentiator.
[0078] Clause 37. Anon-transitory computer-readable storage medium comprising computer instructions stored thereon; wherein the computer instructions are configured to enable a computer to perform the method according to clause 19.
[0079] The detailed description and the drawings or figures are supportive and descriptive of the invention, but the scope of the invention is defined solely by the claims. While some of the best modes and other embodiments for carrying out the claimed invention have been described in detail, various alternative designs and embodiments exist for practicing the invention defined in the appended claims.

Claims

CLAIMS What is claimed:
1. A system for identifying a bottleneck in a process including a plurality of assets, the system comprising: a process including a plurality of assets, wherein the process is configured to repeatedly perform a process cycle; the process cycle including a plurality of operations; wherein each respective asset of the plurality of assets is configured to: repeatedly perform at least one operation of the plurality of operations; and generate asset data defining an asset state of the respective asset; a controller configured to receive the asset data from the plurality of assets; a server in communication with a database; the server configured to: receive the asset data from the controller; store, in the database, the asset data; for each respective asset: associate, in the database, the asset data received from each respective asset with the respective asset; determine, for the respective asset: a blocked time (BT); a starved time (ST); a cumulative blocked time (CBT); a cumulative starved time (CST); and a cumulative total time (CTT), wherein the cumulative total time is a sum of the cumulative blocked time (CBT) and the cumulative starved time (CST).
2. The sy stem of claim 1, further comprising: the server configured to identify a first bottleneck of the process, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset; wherein the first bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) in the rank ordering.
3. The system of claim 2, further comprising: the server configured to identify a second bottleneck of the process; wherein the second bottleneck is the respective asset of the plurality of assets having a second largest cumulative total time (CTT) in the rank ordering.
4. The system of claim 1, further comprising: a sampling period; wherein the asset data is collected during the sampling period; wherein the server is configured to: determine the cumulative total time (CTT) for the respective asset during the sampling period; and identify a largest bottleneck of the process during the sampling period, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset determined for the sampling period; wherein the largest bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) during the sampling period, in the rank ordering.
5. The system of claim 4, further comprising: wherein the sampling period is a defined length of time.
6. The system of claim 4, wherein the sampling period is a predetermined number of process cycles performed by the process.
7. The system of claim 4, wherein: the sampling period is a first sampling period; the cumulative total time (CTT) of each respective asset determined for the first sampling period is a first cumulative total time (CTT) of the respective asset.
8. The sy stem of claim 7, further comprising: the server configmed to receive the asset data collected during a second sampling period; wherein the server is configmed to: determine the cumulative total time (CTT) for the respective asset during the second sampling period; and compare the cumulative total time (CTT) for the respective asset during the second sampling period to the cumulative total time (CTT) for the respective asset dming the first sampling period.
9. The system of claim 1, wherein: at least one of the controller or the server is configured to time stamp the asset data; and the server is configured to associate the time stamp with the asset data in the database.
10. The system of claim 1, further comprising: a data collector in communication with the controller and die server; the data collector configured to collect the asset data from the plurality of assets.
11. The system of claim 10, wherein: the data collector is configured to time stamp the asset data with a time stamp; and the server is configured to associate the time stamp with the asset data in the database.
12. The system of claim 1, wherein the process includes a sub-process performed by a group of the assets selected from the plurality of assets; the system further comprising: the server configured to: identify the group of assets performing the sub-process; determine the cumulative total time (CTT) for each respective asset of the group of assets; identify a largest bottleneck of the sub-process, by rank ordering the group of assets based on the cumulative total time (CTT) of each respective asset; wherein the largest bottleneck of the sub-process is the respective asset of the group of assets having the largest cumulative total time (CTT) in the rank ordering.
13. The sy stem of claim 1, further comprising: at least one asset of the plurality of assets including a process element or a sensor; wherein the process element or the sensor is configured to output the asset data.
14. The sy stem of claim 2, further comprising: the server configmed to generate a display defined by the asset data; the display configmed to display the cumulative total time (CTT) for each respective asset.
15. The system of claim 14, wherein the cumulative total time (CTT) for each respective asset is displayed in the rank ordering of the plurality of assets.
16. The system of claim 15, further comprising: the server generating, in the display, a differentiator associated with the first bottleneck.
17. The system of claim 16, wherein the differentiator is a visual differentiator.
18. The system of claim 16, wherein the differentiator is an audible differentiator.
19. A method for identifying a bottleneck in a process including a plurality of assets, the method comprising: providing a process including a plurality of assets, wherein the process is configured to repeatedly perform a process cycle; the process cycle including a plurality of operations; each respective asset of the plurality of assets: repeatedly performing at least one operation of the plurality of operations; and generating asset data defining an asset state of the respective asset; collecting, via a controller, the asset data from the plurality of assets; providing a server in communication with a database; the method further comprising the server: receiving the asset data from the controller; storing, in the database, the asset data; and for each respective asset, the server: associating, in the database, the asset data received from each respective asset with the respective asset; determining, for the respective asset: a blocked time (BT); a starved time (ST); a cumulative blocked time (CBT); a cumulative starved time (CST); and a cumulative total time (CTT), wherein the cumulative total time is a sum of the cumulative blocked time (CBT) and the cumulative starved time (CST).
20. The method of claim 19, further comprising: rank ordering, via the server, the plurality of assets based on the cumulative total time (CTT) of each respective asset; identifying, via the server, a first bottleneck of the process; wherein the first bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) in the rank ordering.
21. The method of claim 20, further comprising: identifying, via the server, a second bottleneck of the process; wherein the second bottleneck is the respective asset of the plurality of assets having a second largest cumulative total time (CTT) in the rank ordering.
22. The method of claim 19, further comprising: defining a sampling period; collecting the asset data during the sampling period; the method further comprising the server: receiving the asset data collected during the sampling period; determining the cumulative total time (CTT) for the respective asset during the sampling period; and identifying a largest bottleneck of the process during the sampling period, by rank ordering the plurality of assets based on the cumulative total time (CTT) of each respective asset determined for the sampling period; wherein the largest bottleneck is the respective asset of the plurality of assets having the largest cumulative total time (CTT) during the sampling period, in the rank ordering.
23. The method of claim 22, wherein the sampling period is a defined length of time.
24. The method of claim 22, wherein the sampling period is a predetermined number of process cycles performed by the process.
25. The method of claim 22, wherein: the sampling period is a first sampling period; the cumulative total time (CTT) of each respective asset determined for the first sampling period is a first cumulative total time (CTT) of the respective asset.
26. The method of claim 25, further comprising: receiving, via the server, the asset data collected during a second sampling period; determining, via the server, the cumulative total time (CTT) for the respective asset during the second sampling period; and comparing, via the server, the cumulative total time (CTT) for the respective asset during the second sampling period to the cumulative total time (CTT) for the respective asset during the first sampling period.
27. The method of claim 19, further comprising: time stamping the asset data, via at least one of the controller or the server, with a time stamp; and associating, via the server, the time stamp with the asset data in the database.
28. The method of claim 19, further comprising: providing a data collector in communication with the controller and the server; collecting, via the data collector, the asset data from the plurality of assets.
29. The method of claim 28, further comprising: time stamping the asset data, via the data collector, with a time stamp; and associating, via the server, the time stamp with the asset data in the database.
30. The method of claim 19, wherein the process includes a sub-process performed by a group of the assets selected from the plurality of assets; the method further comprising: the server: identifying the group of assets performing the sub-process; determining the cumulative total time (CTT) for each respective asset of the group of assets; identifying a largest bottleneck of the sub-process, by rank ordering the group of assets based on the cumulative total time (CTT) of each respective asset; wherein the largest bottleneck of the sub-process is the respective asset of the group of assets having the largest cumulative total time (CTT) in the rank ordering.
31. The method of claim 19, further comprising: at least one asset of the plurality of assets including a process element or a sensor; wherein the process element or the sensor is configured to output the asset data.
32. The method of claim 20, further comprising: generating, via the server, a display defined by the asset data; the display configured to display the cumulative total time (CTT) for each respective asset.
33. The method of claim 32, wherein the cumulative total time (CTT) for each respective asset is displayed in the rank ordering of the plurality of assets.
34. The method of claim 33, further comprising: generating, in the display, a differentiator associated with the first bottleneck.
35. The method of claim 34, wherein the differentiator is a visual differentiator.
36. The method of claim 34, wherein the differentiator is an audible differentiator.
37. Anon-transitory computer-readable storage medium comprising computer instructions stored thereon; wherein the computer instructions are configured to enable a computer to perform the method according to claim 19.
PCT/US2023/013491 2022-02-21 2023-02-21 Method to identify and prioritize a bottleneck in a process WO2023158871A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US202263312353P 2022-02-21 2022-02-21
US63/312,353 2022-02-21

Publications (1)

Publication Number Publication Date
WO2023158871A1 true WO2023158871A1 (en) 2023-08-24

Family

ID=87578904

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2023/013491 WO2023158871A1 (en) 2022-02-21 2023-02-21 Method to identify and prioritize a bottleneck in a process

Country Status (1)

Country Link
WO (1) WO2023158871A1 (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060085084A1 (en) * 2004-10-19 2006-04-20 Nickolaou James N Method, system and storage medium for managing automated system events
US20070198135A1 (en) * 2006-02-22 2007-08-23 Qing Chang Applying real-time control to a production system
US7379782B1 (en) * 2007-03-26 2008-05-27 Activplant Corporation System and method of monitoring and quantifying performance of an automated manufacturing facility
US20110022212A1 (en) * 2007-12-27 2011-01-27 Yoichi Nonaka Bottleneck device extracting method and bottleneck device extracting assistance device
US20150286212A1 (en) * 2014-02-28 2015-10-08 Invensys Systems, Inc. Manufacturing execution system and method of determining production metrics for a line
US20180150917A1 (en) * 2016-11-29 2018-05-31 Rockwell Automation Technologies, Inc. Energy key performance indicators for the industrial marketplace
US20210333771A1 (en) * 2014-05-08 2021-10-28 Beet, Inc. Automation management interface

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060085084A1 (en) * 2004-10-19 2006-04-20 Nickolaou James N Method, system and storage medium for managing automated system events
US20070198135A1 (en) * 2006-02-22 2007-08-23 Qing Chang Applying real-time control to a production system
US7379782B1 (en) * 2007-03-26 2008-05-27 Activplant Corporation System and method of monitoring and quantifying performance of an automated manufacturing facility
US20110022212A1 (en) * 2007-12-27 2011-01-27 Yoichi Nonaka Bottleneck device extracting method and bottleneck device extracting assistance device
US20150286212A1 (en) * 2014-02-28 2015-10-08 Invensys Systems, Inc. Manufacturing execution system and method of determining production metrics for a line
US20210333771A1 (en) * 2014-05-08 2021-10-28 Beet, Inc. Automation management interface
US20180150917A1 (en) * 2016-11-29 2018-05-31 Rockwell Automation Technologies, Inc. Energy key performance indicators for the industrial marketplace

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
LIN LI ; QING CHANG ; JUN NI ; GUOXIAN XIAO ; STEPHAN BILLER: "Bottleneck Detection of Manufacturing Systems Using Data Driven Method", ASSEMBLY AND MANUFACTURING, 2007. ISAM '07. IEEE INTERNATIONAL SY MPOSIUM ON, IEEE, PI, 1 July 2007 (2007-07-01), Pi , pages 76 - 81, XP031125439, ISBN: 978-1-4244-0562-6 *

Similar Documents

Publication Publication Date Title
CN109814431B (en) System for controlling automation
EP1697893B1 (en) Industrial control system and data processing method therefore
US9262254B2 (en) Method and apparatus to manage information between a scan tool and networked devices
EP3425573A1 (en) Work data management system and work data management method
CA2680476A1 (en) System and method of monitoring and quantifying performance of an automated manufacturing facility
CN111260181B (en) Workshop self-adaptive production scheduling device based on distributed intelligent manufacturing unit
CN105824304A (en) Flexible job shop dynamic scheduling method taking availability of machining equipment into consideration
CN112766655B (en) Automatic scheduling method, device, equipment and computer readable storage medium
CN112085597A (en) Loan processing method and system
CN104423317A (en) Data acquisition device for acquiring cause of stoppage of drive axis and information relating thereto
Ruppert et al. Estimation of machine setup and changeover times by survival analysis
CN113961374A (en) Data transmitting and receiving method and system, storage medium and electronic equipment
CN110969222A (en) Information providing method and system
CN103927228A (en) Job execution prediction method and job execution prediction device
WO2023158871A1 (en) Method to identify and prioritize a bottleneck in a process
CN110989509B (en) Automatic control method and device for production line, terminal equipment and storage medium
US10295997B2 (en) Diagnostic tool and diagnostic method for determining an interruption in a plant
EP3361342B1 (en) Programmable display, display control method, and display control program
US7443395B2 (en) Multi-variable operations
US11487270B2 (en) Industrial machine management system, method for managing industrial machine, and non-transitory computer-readable storage medium
US20200073777A1 (en) Method for Automatically Evaluating Alarm Clusters
US10691106B2 (en) Numerical controller
CN111857055A (en) Machining support device, numerical controller, and machining support system
JP5359312B2 (en) Manufacturing line process management method and process management system
EP2009532A1 (en) A method for real-time scheduling of processes at distributed manufacturing sites

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: 23756952

Country of ref document: EP

Kind code of ref document: A1