[go: up one dir, main page]

WO2019015744A1 - Method and system for allocating resources in a production plant - Google Patents

Method and system for allocating resources in a production plant Download PDF

Info

Publication number
WO2019015744A1
WO2019015744A1 PCT/EP2017/068039 EP2017068039W WO2019015744A1 WO 2019015744 A1 WO2019015744 A1 WO 2019015744A1 EP 2017068039 W EP2017068039 W EP 2017068039W WO 2019015744 A1 WO2019015744 A1 WO 2019015744A1
Authority
WO
WIPO (PCT)
Prior art keywords
negotiation
participants
ruleset
npf
rsi
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/EP2017/068039
Other languages
French (fr)
Inventor
Michael Pirker
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Siemens Corp
Original Assignee
Siemens AG
Siemens Corp
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 Siemens AG, Siemens Corp filed Critical Siemens AG
Priority to PCT/EP2017/068039 priority Critical patent/WO2019015744A1/en
Publication of WO2019015744A1 publication Critical patent/WO2019015744A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00—Programme-control systems
    • G05B19/02—Programme-control systems electric
    • G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
    • G05B19/41865—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by job scheduling, process planning, material flow
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04—Manufacturing
    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00—Program-control systems
    • G05B2219/30—Nc systems
    • G05B2219/32—Operator till task planning
    • G05B2219/32328—Dynamic scheduling, resource allocation, multi agent negotiation
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30—Computing systems specially adapted for manufacturing

Definitions

  • ⁇ sources can be allocated in advance or during the ongoing production process.
  • One way for implementing dynamic resource allocation is based on negotiations on a virtual marketplace.
  • a nego ⁇ tiation is a process of buying and selling goods at a virtual market place, when potential buyers submit their requests, and potential sellers simultaneously submit their offer.
  • The- se negotiations are driven by production modules and prod ⁇ ucts. The negotiation participants are informed about the current negotiation status on the market, but the individual preferences, like price borders, of each participant are not disclosed .
  • negotiation-based resource alloca ⁇ tion The default approach for negotiation-based resource alloca ⁇ tion is to allow all interested plant modules to enter into negotiations. Concrete implementations of negotiation plat- forms, which realize a virtual market place that enables the negotiations, provide mechanisms to register for the negotia ⁇ tion process of a specific resource. Registering for a spe ⁇ cific negotiation is offered to all plant modules. It is an object of the invention to provide an alternative to the state of the art. According to the method for allocating resources in a produc ⁇ tion plant, the following steps are executed:
  • the system for allocating resources in a production plant comprises the following modules:
  • a negotiation participant filter configured for dynamically filtering all participants of a negotiation plat ⁇ form and obtaining a filtered list of negotiation partic ⁇ ipants
  • the method and system have the advantage that the negotiation platform is enabled to perform resource allocation between the filtered list of negotiation participants.
  • Reducing the number of negotiation partners speeds up the overall negotiation process. Since the negotiation partici ⁇ pant filter can use more complex mechanisms than thresholds, it also enables the creation of a smaller number of negotia- tion participants. This results in a quicker termination of the negotiation process.
  • the negoti ⁇ ation participant filter contains a rule engine and at least a first ruleset.
  • the negotiation participant filter processes the first ruleset with the rule engine in order to decide which participants enter the filtered list of negotiation participants .
  • This embodiment provides a rule-based system comprising rulesets and a rule engine to define and execute the dynamic negotiation participant filtering.
  • the negotiation participant filter connects the rule-based system with the negotia ⁇ tion platform and offers dynamic application of participant filtering rules based on the rulesets.
  • the negotia ⁇ tion participant filter contains several rulesets.
  • the rule engine switches from using the first ruleset to using a se ⁇ cond ruleset during operation of the production plant.
  • the negotiation participant filter can dynamically apply participant filtering rules of a ruleset selected from a set of rulesets.
  • each ruleset is optimized for a specific state or mode of opera ⁇ tion of the production plant.
  • the computer-readable storage media has stored thereon in ⁇ structions executable by one or more processors of a computer system, wherein execution of the instructions causes the computer system to perform the method.
  • the computer program is being executed by one or more proces ⁇ sors of a computer system and performs the method.
  • Fig. 1 an architecture for allocating resources in a pro ⁇ duction plant
  • Fig. 2 a first step for allocating resources
  • Fig. 3 a second step for allocating resources
  • Fig. 4 a third step for allocating resources
  • Fig. 5 a detailed view of a negotiation participant filter
  • FIG. 1 shows in addition to a standard negotiation platform NP a negotiation participant filter NPF.
  • the negotiation partici ⁇ pant filter NPF is an add-on module providing a pre- processing of registered negotiation participants before the default negotiation process starts.
  • the negotiation participant filter NPF is an add-on module to an arbitrary negotiation platform implementing a virtual market place.
  • the interfacing between the nego ⁇ tiation platform NP and the negotiation participant filter NPF is handled by the negotiation participant filter NPF us ⁇ ing standard interface calls offered by the negotiation plat ⁇ form NP (e.g. retrieving the list of participants for a spe ⁇ cific negotiation process) .
  • the following section describes the main process steps of a default virtual market place extended with dynamic selection of negotiation participants.
  • Figure 2 shows that first, as in all negotiation platforms, the participants willing to take part in a negotiation pro ⁇ cess for a specific resource, here a first participant PI, a second participant P2 and a third participant P3, register with the negotiation platform NP for this specific resource negotiation process.
  • Figure 3 shows the second step, in which the negotiation par ⁇ ticipant filter NPF selects the best suited participants from the list of all registered participants, in this case the first participant PI and the third participant P3.
  • the trig- ger for the negotiation participant filter for starting the selection process is implemented by using default mechanisms offered by the negotiation platform NP (e.g. call- back events of the negotiation platform NP that a negotiation process starts) .
  • Figure 4 shows the third step.
  • the negotiation partici ⁇ pant filter NPF has selected the best suited negotiation par ⁇ ticipants, the remaining participants, here the second par ⁇ ticipant P2, are unregistered from the participant list of the negotiation platform NP.
  • the negotiation platform NP performs the ne ⁇ gotiations between the participants in the default way, and the negotiated resource is offered to the most suited negoti ⁇ ation participant at the end of the negotiation process.
  • the purpose of the negotiation participant filter NPF is to reduce the number of negotiation partners per negotiation process, which is performed at the negotiation platform NP.
  • the negotiation participant filter NPF must therefore be pa- rameterized to choose the participants that should be removed from the list of negotiation participants.
  • the negotiation participant filter NPF can be loaded with a ruleset specify ⁇ ing the exact conditions to remove a participant from the list .
  • participant-location NOT section5 THEN remove-from-list A participant, e.g. a drilling station, that is not allocated in a specific plant location, here section 5, is not allowed to participate in the negotiation process, e.g. for a specific work
  • the set of rules loaded into the negotiation participant fil- ter NPF at start-up of the negotiation platform NP can be altered dynamically at runtime, e.g. by replacing single rules or the complete set.
  • the filter rulesets can be optimized for different plant states.
  • the execution of these filter rulesets is performed by a default rule engine.
  • Figure 5 summarizes the functionality of the previously de ⁇ scribed negotiation participant filter NPF that interacts with a negotiation platform NP through a negotiation platform interface NPI .
  • An internal rule engine RE can process a vari- ety of rulesets, for example a first ruleset RSI, a second ruleset RS2, further rulesets, and a final ruleset RSN.
  • the first ruleset RSI is opti ⁇ mized for a normal state of operation of the production plant, by allowing many negotiations.
  • the second ruleset RS2 is optimized for a maintenance state, by reducing the number of negotiations possible.
  • the final ruleset RSN is optimized for a high production volume state, by minimizing the number of negotiations to increase throughput.
  • the method can be executed by a processor such as a microcon ⁇ troller or a microprocessor, by an Application Specific Integrated Circuit (ASIC) , by any kind of computer, including mo ⁇ bile computing devices such as tablet computers, smartphones or laptops, or by one or more servers in a control room or cloud.
  • ASIC Application Specific Integrated Circuit
  • a processor, controller, or integrated circuit of the computer system and/or another processor may be configured to implement the acts described herein.
  • the above-described method may be implemented via a computer program product including one or more computer-readable stor ⁇ age media having stored thereon instructions executable by one or more processors of a computing system. Execution of the instructions causes the computing system to perform oper ⁇ ations corresponding with the acts of the method described above .
  • the instructions for implementing processes or methods de- scribed herein may be provided on non-transitory computer- readable storage media or memories, such as a cache, buffer, RAM, FLASH, removable media, hard drive, or other computer readable storage media.
  • Computer readable storage media in- elude various types of volatile and non-volatile storage me ⁇ dia.
  • the functions, acts, or tasks illustrated in the figures or described herein may be executed in response to one or more sets of instructions stored in or on computer readable storage media.
  • the functions, acts or tasks may be independ ⁇ ent of the particular type of instruction set, storage media, processor or processing strategy and may be performed by software, hardware, integrated circuits, firmware, micro code and the like, operating alone or in combination.
  • processing strategies may include multiprocessing, multitasking, parallel processing and the like.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Economics (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Manufacturing & Machinery (AREA)
  • Health & Medical Sciences (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Primary Health Care (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • General Health & Medical Sciences (AREA)
  • General Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

In order to allocate resources in a production plant, a negotiation participant filter (NPF) filters all participants (P1, P2, P3) of a negotiation platform dynamically based on rules in order to obtain a filtered list of negotiation participants. Afterwards, the negotiation platform allocates resources only between the filtered list of negotiation participants. This introduces a mechanism to reduce the number of participants in a complex and intelligent way beyond offering a mere threshold. Reducing the number of negotiation partners speeds up the overall negotiation process. Since the negotiation participant filter can use more complex mechanisms than thresholds, it also enables the creation of a smaller number of negotiation participants. This results in a quicker termination of the negotiation process.

Description

Description
Method and system for allocating resources in a production plant
In current plants, there is an increasing demand for more flexibility during the production process. Different plant resources are required for the production of work pieces or final products and must be allocated in advance. An approach for introducing increased flexibility into such plants is the dynamic allocation of the required resources. Therefore re¬ sources can be allocated in advance or during the ongoing production process. One way for implementing dynamic resource allocation is based on negotiations on a virtual marketplace. In detail, a nego¬ tiation is a process of buying and selling goods at a virtual market place, when potential buyers submit their requests, and potential sellers simultaneously submit their offer. The- se negotiations are driven by production modules and prod¬ ucts. The negotiation participants are informed about the current negotiation status on the market, but the individual preferences, like price borders, of each participant are not disclosed .
While the basic approach for increasing plant flexibility by taking advantage of negotiation mechanisms is very promising, resource allocation based on negotiation between different plant resources and products can become increasingly slow with a rising number of negotiation participants.
The default approach for negotiation-based resource alloca¬ tion is to allow all interested plant modules to enter into negotiations. Concrete implementations of negotiation plat- forms, which realize a virtual market place that enables the negotiations, provide mechanisms to register for the negotia¬ tion process of a specific resource. Registering for a spe¬ cific negotiation is offered to all plant modules. It is an object of the invention to provide an alternative to the state of the art. According to the method for allocating resources in a produc¬ tion plant, the following steps are executed:
dynamically filtering, by a negotiation participant fil¬ ter, all participants of a negotiation platform and ob¬ taining a filtered list of negotiation participants, and - performing, by the negotiation platform, resource allocation only between the filtered list of negotiation participants .
The system for allocating resources in a production plant comprises the following modules:
a negotiation participant filter, configured for dynamically filtering all participants of a negotiation plat¬ form and obtaining a filtered list of negotiation partic¬ ipants, and
- negotiation platform, connected to the negotiation participant filter and configured for performing resource allocation only between the filtered list of negotiation participants . The following advantages and explanations are not necessarily the result of the object of the independent claims. Rather, they may be advantages and explanations that only apply to certain embodiments or variants. The method and system have the advantage that the negotiation platform is enabled to perform resource allocation between the filtered list of negotiation participants. This introduc¬ es a mechanism to reduce the number of participants in a com¬ plex and intelligent way beyond offering a mere threshold (e.g. only allowing a maximum threshold of 20 participants per negotiation) . Reducing the number of negotiation partners speeds up the overall negotiation process. Since the negotiation partici¬ pant filter can use more complex mechanisms than thresholds, it also enables the creation of a smaller number of negotia- tion participants. This results in a quicker termination of the negotiation process.
In an embodiment of the method, initially all participants are registered at the negotiation platform.
In a further embodiment of the method and system, the negoti¬ ation participant filter contains a rule engine and at least a first ruleset. The negotiation participant filter processes the first ruleset with the rule engine in order to decide which participants enter the filtered list of negotiation participants .
This embodiment provides a rule-based system comprising rulesets and a rule engine to define and execute the dynamic negotiation participant filtering. The negotiation participant filter connects the rule-based system with the negotia¬ tion platform and offers dynamic application of participant filtering rules based on the rulesets. In another embodiment of the method and system, the negotia¬ tion participant filter contains several rulesets. The rule engine switches from using the first ruleset to using a se¬ cond ruleset during operation of the production plant. In this embodiment, the negotiation participant filter can dynamically apply participant filtering rules of a ruleset selected from a set of rulesets.
In yet another embodiment of the method and system, each ruleset is optimized for a specific state or mode of opera¬ tion of the production plant. The computer-readable storage media has stored thereon in¬ structions executable by one or more processors of a computer system, wherein execution of the instructions causes the computer system to perform the method.
The computer program is being executed by one or more proces¬ sors of a computer system and performs the method.
The foregoing and other aspects of the present invention are best understood from the following detailed description when read in connection with the accompanying drawings. For the purpose of illustrating the invention, there are shown in the drawings embodiments that are presently preferred, it being understood, however, that the invention is not limited to the specific instrumentalities disclosed. Included in the draw¬ ings are the following Figures:
Fig. 1 an architecture for allocating resources in a pro¬ duction plant,
Fig. 2 a first step for allocating resources,
Fig. 3 a second step for allocating resources, Fig. 4 a third step for allocating resources, and
Fig. 5 a detailed view of a negotiation participant filter
NPF. Figure 1 shows in addition to a standard negotiation platform NP a negotiation participant filter NPF. For the negotiation platform NP, any available implementation of a virtual market place can be used without changes. The negotiation partici¬ pant filter NPF is an add-on module providing a pre- processing of registered negotiation participants before the default negotiation process starts. In other words the negotiation participant filter NPF is an add-on module to an arbitrary negotiation platform implementing a virtual market place. The interfacing between the nego¬ tiation platform NP and the negotiation participant filter NPF is handled by the negotiation participant filter NPF us¬ ing standard interface calls offered by the negotiation plat¬ form NP (e.g. retrieving the list of participants for a spe¬ cific negotiation process) . The following section describes the main process steps of a default virtual market place extended with dynamic selection of negotiation participants.
Figure 2 shows that first, as in all negotiation platforms, the participants willing to take part in a negotiation pro¬ cess for a specific resource, here a first participant PI, a second participant P2 and a third participant P3, register with the negotiation platform NP for this specific resource negotiation process.
Figure 3 shows the second step, in which the negotiation par¬ ticipant filter NPF selects the best suited participants from the list of all registered participants, in this case the first participant PI and the third participant P3. The trig- ger for the negotiation participant filter for starting the selection process is implemented by using default mechanisms offered by the negotiation platform NP (e.g. call- back events of the negotiation platform NP that a negotiation process starts) .
Figure 4 shows the third step. After the negotiation partici¬ pant filter NPF has selected the best suited negotiation par¬ ticipants, the remaining participants, here the second par¬ ticipant P2, are unregistered from the participant list of the negotiation platform NP. After this only the participants selected by the negotiation participant filter NPF are still registered with the negotiation platform NP for the specific resource negotiation process. Now the default negotiation process starts. The negotiation platform NP performs the ne¬ gotiations between the participants in the default way, and the negotiated resource is offered to the most suited negoti¬ ation participant at the end of the negotiation process.
The purpose of the negotiation participant filter NPF is to reduce the number of negotiation partners per negotiation process, which is performed at the negotiation platform NP. The negotiation participant filter NPF must therefore be pa- rameterized to choose the participants that should be removed from the list of negotiation participants. The negotiation participant filter NPF can be loaded with a ruleset specify¬ ing the exact conditions to remove a participant from the list .
An example of such a rule is "IF participant- priority < 5 THEN remove-from-list " : In order to increase the efficiency of the negotiation process, a participant that is below a specific priority threshold is not allowed to take part in the negotiation process.
Another example would be the rule "IF participant-location NOT section5 THEN remove-from-list " : A participant, e.g. a drilling station, that is not allocated in a specific plant location, here section 5, is not allowed to participate in the negotiation process, e.g. for a specific work
piece/machine .
The set of rules loaded into the negotiation participant fil- ter NPF at start-up of the negotiation platform NP can be altered dynamically at runtime, e.g. by replacing single rules or the complete set.
The filter rulesets can be optimized for different plant states. The execution of these filter rulesets is performed by a default rule engine. Figure 5 summarizes the functionality of the previously de¬ scribed negotiation participant filter NPF that interacts with a negotiation platform NP through a negotiation platform interface NPI . An internal rule engine RE can process a vari- ety of rulesets, for example a first ruleset RSI, a second ruleset RS2, further rulesets, and a final ruleset RSN. In a variant of this embodiment, the first ruleset RSI is opti¬ mized for a normal state of operation of the production plant, by allowing many negotiations. The second ruleset RS2 is optimized for a maintenance state, by reducing the number of negotiations possible. The final ruleset RSN is optimized for a high production volume state, by minimizing the number of negotiations to increase throughput. The method can be executed by a processor such as a microcon¬ troller or a microprocessor, by an Application Specific Integrated Circuit (ASIC) , by any kind of computer, including mo¬ bile computing devices such as tablet computers, smartphones or laptops, or by one or more servers in a control room or cloud.
For example, a processor, controller, or integrated circuit of the computer system and/or another processor may be configured to implement the acts described herein.
The above-described method may be implemented via a computer program product including one or more computer-readable stor¬ age media having stored thereon instructions executable by one or more processors of a computing system. Execution of the instructions causes the computing system to perform oper¬ ations corresponding with the acts of the method described above .
The instructions for implementing processes or methods de- scribed herein may be provided on non-transitory computer- readable storage media or memories, such as a cache, buffer, RAM, FLASH, removable media, hard drive, or other computer readable storage media. Computer readable storage media in- elude various types of volatile and non-volatile storage me¬ dia. The functions, acts, or tasks illustrated in the figures or described herein may be executed in response to one or more sets of instructions stored in or on computer readable storage media. The functions, acts or tasks may be independ¬ ent of the particular type of instruction set, storage media, processor or processing strategy and may be performed by software, hardware, integrated circuits, firmware, micro code and the like, operating alone or in combination. Likewise, processing strategies may include multiprocessing, multitasking, parallel processing and the like.
The invention has been described in detail with reference to embodiments thereof and examples. Variations and modifica- tions may, however, be effected within the spirit and scope of the invention covered by the claims. The phrase "at least one of A, B and C" as an alternative expression may provide that one or more of A, B and C may be used. While the present invention has been described above by ref¬ erence to various embodiments, it should be understood that many changes and modifications may be made to the described embodiments. It is therefore intended that the foregoing de¬ scription be regarded as illustrative rather than limiting, and that it be understood that all equivalents and/or combi¬ nations of embodiments are intended to be included in this description .

Claims

Patent claims
1. Method for allocating resources in a production plant, with the following steps:
- dynamically filtering, by a negotiation participant fil¬ ter (NPF) , all participants (PI, P2, P3) of a negotiation platform (NP) and obtaining a filtered list of negotia¬ tion participants (PI, P3) , and
performing, by the negotiation platform (NP) , resource allocation only between the filtered list of negotiation participants (PI, P3) .
2. Method according to claim 1,
with the initial step of
- registering all participants (PI, P2, P3) at the negotia¬ tion platform (NP) .
3. Method according to claim 1 or 2,
wherein the negotiation participant filter (NPF) contains a rule engine (RE) and at least a first ruleset (RSI), and
wherein the negotiation participant filter (NPF) processes the first ruleset (RSI) with the rule engine (RE) in order to decide which participants enter the filtered list of negotiation participants (PI, P3) .
4. Method according to claim 3,
wherein the negotiation participant filter (NPF) contains several rulesets (RSI, RS2, RSN) , and
- wherein the rule engine (RE) switches from using the
first ruleset (RSI) to using a second ruleset (RS2) dur¬ ing operation of the production plant.
5. Method according to claim 4,
- wherein each ruleset (RSI, RS2, RSN) is optimized for a specific state or mode of operation of the produc¬ tion plant.
6. System for allocating resources in a production plant, with the following modules:
a negotiation participant filter (NPF) , configured for dynamically filtering all participants (PI, P2, P3) of a negotiation platform (NP) and obtaining a filtered list of negotiation participants (PI, P3) , and
negotiation platform (NP) , connected to the negotiation participant filter (NPF) and configured for performing resource allocation only between the filtered list of ne¬ gotiation participants (PI, P3) .
7. System according to claim 6,
wherein the negotiation participant filter (NPF) contains a rule engine (RE) and at least a first ruleset (RSI), and
wherein the negotiation participant filter (NPF) is configured for processing the first ruleset (RSI) with the rule engine (RE) in order to decide which participants enter the filtered list of negotiation participants (PI, P3) .
8. System according to claim 7,
wherein the negotiation participant filter (NPF) contains several rulesets (RSI, RS2, RSN) , and
wherein the rule engine (RE) is configured for switching from using the first ruleset (RSI) to using a second ruleset (RS2) during operation of the production plant.
9. System according to claim 8,
wherein each ruleset (RSI, RS2, RSN) is optimized for a specific state or mode of operation of the produc¬ tion plant.
10. Computer-readable storage media having stored thereon: instructions executable by one or more processors of a computer system, wherein execution of the instructions causes the computer system to perform the method according to one of the claims 1 to 5.
11. Computer program,
which is being executed by one or more processors of a computer system and performs the method according to one of the claims 1 to 5.
PCT/EP2017/068039 2017-07-17 2017-07-17 Method and system for allocating resources in a production plant Ceased WO2019015744A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2017/068039 WO2019015744A1 (en) 2017-07-17 2017-07-17 Method and system for allocating resources in a production plant

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2017/068039 WO2019015744A1 (en) 2017-07-17 2017-07-17 Method and system for allocating resources in a production plant

Publications (1)

Publication Number Publication Date
WO2019015744A1 true WO2019015744A1 (en) 2019-01-24

Family

ID=59350964

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2017/068039 Ceased WO2019015744A1 (en) 2017-07-17 2017-07-17 Method and system for allocating resources in a production plant

Country Status (1)

Country Link
WO (1) WO2019015744A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111694330A (en) * 2019-03-15 2020-09-22 西门子股份公司 Method and system for automatically managing buffer system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020046157A1 (en) * 1999-11-01 2002-04-18 Neal Solomon System, method and apparatus for demand-initiated intelligent negotiation agents in a distributed network
EP1528494A1 (en) * 2003-10-30 2005-05-04 Microsoft Corporation Automatic supplier sourcing
US20050114202A1 (en) * 2003-10-30 2005-05-26 Chua Tay J. Rough-cut capacity planning with production constraints and dynamic bottleneck considerations
US20060041518A1 (en) * 2004-08-21 2006-02-23 Blair William R Supplier capability methods, systems, and apparatuses for extended commerce

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020046157A1 (en) * 1999-11-01 2002-04-18 Neal Solomon System, method and apparatus for demand-initiated intelligent negotiation agents in a distributed network
EP1528494A1 (en) * 2003-10-30 2005-05-04 Microsoft Corporation Automatic supplier sourcing
US20050114202A1 (en) * 2003-10-30 2005-05-26 Chua Tay J. Rough-cut capacity planning with production constraints and dynamic bottleneck considerations
US20060041518A1 (en) * 2004-08-21 2006-02-23 Blair William R Supplier capability methods, systems, and apparatuses for extended commerce

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111694330A (en) * 2019-03-15 2020-09-22 西门子股份公司 Method and system for automatically managing buffer system

Similar Documents

Publication Publication Date Title
US11243815B2 (en) Systems and methods for distributed resource management
CN106980532A (en) A kind of job scheduling method and device
EP3425502A1 (en) Task scheduling method and device
US8850439B2 (en) Storage subsystem device driver scheduling I/O servicing according to priority of identified process
WO2019134304A1 (en) Task processing method and apparatus, electronic terminal, and readable storage medium
JP7336562B2 (en) Scheduling method, scheduling device, electronic device, storage medium and program for deep framework
US11593932B2 (en) Loading deep learning network models for processing medical images
EP2219108A1 (en) System and method for executing a complex task by sub-tasks
TWI664509B (en) Programmable controller, management device and control system
EP3819758B1 (en) Instruction executing method and apparatus, electronic device, and computer-readable storage medium
CN115033352A (en) Task scheduling method, device and equipment for multi-core processor and storage medium
CN106462452A (en) vehicle control device
US10437623B2 (en) Fast switching between virtual machines without interrupt virtualization for high-performance, secure trusted-execution environment
WO2019015744A1 (en) Method and system for allocating resources in a production plant
CN101777009A (en) Load control and management method for application program
KR100983061B1 (en) Interrupt control functions suitable for controlling the execution of interrupt requests of different criticalities
US20140344822A1 (en) Techniques for assigning priorities to streams of work
EP4024286A1 (en) Computing method and apparatus for convolutional neural network model
KR100590764B1 (en) Large Data Processing Using Scheduler in Multiprocessor System
CN114637597A (en) Task execution system and method for vehicle operating system
CN114757813A (en) A rendering system, method and electronic device
EP4414840A1 (en) Method and apparatus for controlling processor to execute tasks, and electronic device
CN110109747B (en) Apache Spark-based data exchange method, system and server
US9940207B2 (en) Failing back block objects in batch
Gratia et al. Adaptation of run to mixed-criticality systems

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17740015

Country of ref document: EP

Kind code of ref document: A1