CN109242228B - PBS scheduling method based on rule classification autonomy - Google Patents

PBS scheduling method based on rule classification autonomy Download PDF

Info

Publication number
CN109242228B
CN109242228B CN201710555326.4A CN201710555326A CN109242228B CN 109242228 B CN109242228 B CN 109242228B CN 201710555326 A CN201710555326 A CN 201710555326A CN 109242228 B CN109242228 B CN 109242228B
Authority
CN
China
Prior art keywords
rule
queue
lane
level
business
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.)
Active
Application number
CN201710555326.4A
Other languages
Chinese (zh)
Other versions
CN109242228A (en
Inventor
原文斌
彭慧
史海波
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.)
Shenyang Institute of Automation of CAS
Original Assignee
Shenyang Institute of Automation of CAS
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 Shenyang Institute of Automation of CAS filed Critical Shenyang Institute of Automation of CAS
Priority to CN201710555326.4A priority Critical patent/CN109242228B/en
Publication of CN109242228A publication Critical patent/CN109242228A/en
Application granted granted Critical
Publication of CN109242228B publication Critical patent/CN109242228B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR 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
    • G06—COMPUTING; CALCULATING OR 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—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/04—Manufacturing
    • 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

Abstract

The invention discloses a PBS scheduling method based on rule classification autonomy. The invention comprises the following steps: abstracting the lanes of the PBS buffer area into a queue, and defining queue attributes and actions; separating the service rules of the PBS buffer area, abstracting the queue rules, and defining the attribute of the queue rules; binding the queue and the queue rule, and fourthly, establishing a master rule, and defining an attribute and a matching algorithm; and fifthly, abstracting the monitoring of the signals entering the channel and exiting the channel, coordinating queues, balancing loads and the like into overall-level processing, and defining the processing logic of the overall-level processing. After each classification processing, whether the classification meets the requirements or not is fed back to the master stage, and the master stage performs coordination and load balancing processing on the classification meeting the requirements and selects an optimal lane. The invention dynamically binds the service rule with the processing unit, realizes the separation of service and application, is beneficial to the definition and realization of the service rule, and effectively solves the problems that the production scheduling system cannot adapt to frequent and changeable service rules and is difficult to develop and maintain.

Description

PBS scheduling method based on rule classification autonomy
Technical Field
The invention relates to a rule-based hierarchical autonomous PBS (packet switched buffer) scheduling method, in particular to a rule-based hierarchical autonomous scheduling method for a finished automobile production line PBS buffer, and belongs to the field of production scheduling.
Background
The whole vehicle production is customer order oriented production and is mainly characterized by small order batch, various varieties and short delivery date. Therefore, the whole vehicle production line is a mixed-flow assembly line, multiple vehicle types are produced in a collinear way, different vehicle types have different requirements on an engine, a gearbox, a skylight, an inner decoration and the like, and different key parts have different required processing working hours and required assembly modes. In the assembly process of a final assembly workshop, the material types and the assembly modes need to be changed continuously, so that the problems of unbalanced load, increased production period, low productivity and the like are caused.
The entire truck shop sets up pbs (bonded Body storage) buffers in the paint shop and the assembly shop, where the vehicles are reordered to optimize production. The PBS buffer types mainly comprise a linked list buffer, a stack buffer, a ring buffer, a linear buffer, a backward buffer and a free buffer. The chain table type buffer area, the stack type buffer area, the ring buffer area and the free type buffer area are simple. The present invention is primarily directed to such buffers that combine linear and circular, which take advantage of both linear and circular buffers, but also increase the difficulty of sorting.
There are many business rules affecting the PBS buffer, and the combination of the business rules increases exponentially with the increase of the business rules. Different business rules are combined, and the obtained sequencing results are different. Therefore, it is infeasible to rely on manual calculation alone, and a reasonable production scheduling method is urgently needed.
From the above, the realization of the PBS scheduling method based on rule-based hierarchical autonomy is of great significance. The classification autonomy mode separates the business rules, the magnitude of the business rules processed by each autonomy unit is reduced, and dynamic binding with the business rules can be realized.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a PBS scheduling method based on rule classification autonomy.
The technical scheme adopted by the invention for realizing the purpose is as follows: a PBS scheduling method based on rule hierarchical autonomy comprises the following steps:
step 1: abstracting a lane of a PBS buffer area into a first-in first-out queue T, defining queue attributes and actions, and determining a unique identifier of the queue;
step 2: separating the service rules of the PBS buffer area into a total-level rule and a grading queue rule; the logic abstraction of the queue rule P is a rule set formed by arranging and combining business rules, and is expressed as
Figure BDA0001345573710000021
Wherein R isiIs a business rule, n is a natural number; according to business rules RiDetermining R as an attribute ofiThe method comprises the following steps of (1) determining a unique identifier of a business rule, wherein the business rule belongs to which business rule type;
and step 3: binding the queue and the queue rule, and expressing as { T, P }, wherein the bound queue and the queue rule and the rule logic process to form a hierarchy;
and 4, step 4: the total level rule F is logically abstracted into a rule set formed by arranging and combining the total business rules, and is expressed as:
Figure BDA0001345573710000022
wherein O isiIs a total business rule; according to general business rules OiIs determined by the attribute of (1)iDetermining the type of the business rule, and determining the unique identifier of the total business rule;
and 5: the monitoring module, the processing logic of the master level and the master business rule set form a master level;
step 6: each hierarchy registers with the master hierarchy; after monitoring the channel entering signal and the channel exiting signal, the master level monitoring module broadcasts signals to each registered level; and after calling and executing the hierarchical rule logic processing in each hierarchy, feeding back information to the total level, wherein the total level obtains the dispatched lane according to the priority of the queue in the hierarchy for sending the feedback information.
The set of attributes of the queue is: { queue unique identification, capacity, available capacity, priority, queue type, queue description }.
The set of attributes of the queue rule is: { unique identification of rule, priority, description of rule, logical processing of rule }.
The actions of the queue include: the method comprises the following steps of enqueuing action, dequeuing action, queue judgment as empty action, queue priority acquisition action, queue priority setting action, First acquisition action, Last acquisition action, enqueuable judgment action and dequeuable judgment action.
The actions of the queue are used to be invoked and executed by the staging and/or staging levels.
The entry signal comprises current entry vehicle information, and the exit signal comprises current exit vehicle information.
The logic processing of calling and executing the grading rules in each grade specifically comprises the following steps: and logically processing each hierarchical classification rule to obtain vehicle information and lane information according to the hierarchical queue rule.
A rule-based hierarchical autonomous PBS scheduling system, comprising:
the main level is used for processing according to the entry signal, the exit signal and each grading feedback information to obtain a lane finally used for dispatching;
and the grading is used for executing the queue rule and feeding back information to the overall grade.
The overall stage includes:
the monitoring module is used for monitoring the channel entry signal and the channel exit signal and sending the signals to the processing logic;
the master rule is used for setting according to the service requirement;
and the processing logic is used for processing or executing a general level rule according to the entry signal, the exit signal and each level feedback information to obtain a lane finally used for scheduling.
The grading comprises the following steps:
a queue for representing a lane;
the queue rule is used for setting according to the scheduling requirement;
and the rule logic process is used for executing the queue rule and feeding back information to the overall level.
The invention has the following advantages and beneficial effects:
1. the complex routing scheduling rules are separated and classified, each stage of unit only needs to process the relevant rules, and the method effectively simplifies the routing scheduling and is easy to realize.
2. The dynamic binding of the service rule and the processing unit realizes the separation of the service and the application, is beneficial to the definition and the realization of the service rule, and effectively solves the problems that the production scheduling system cannot adapt to frequent and changeable service rules and is difficult to develop and maintain.
Drawings
FIG. 1 is a system architecture diagram of the present invention;
FIG. 2 is a diagram of a vehicle entering a lane;
FIG. 3 is a diagram of a vehicle exiting a lane;
fig. 4 is a diagram of a vehicle leaving a lane.
Detailed Description
The invention is further described in detail below with reference to the accompanying drawings and embodiments.
As shown in fig. 1, a PBS scheduling method based on rule-based hierarchical autonomy includes the following steps:
step 1: abstracting a lane of a PBS buffer area into a first-in first-out queue T, defining queue attributes and actions, and determining a unique identifier (queue identifier) of the queue;
step 2: separating the service rules of the PBS buffer area into a total-level rule and a grading queue rule; the queue rule P is logically abstracted into a rule set formed by arranging and combining a series of basic business rules, and is expressed as
Figure BDA0001345573710000041
Wherein R isiThe basic business rules are classified into the following types: vehicle type centralization rules and first-in first-out rules, wherein n represents the number of business rules; according to basic business rules RiDetermining R as an attribute ofiThe method comprises the following steps of (1) determining a unique identifier of a business rule, wherein the business rule belongs to which business rule type;
vehicle type centralization rule: when entering the lane, vehicles of the same type enter the same lane, and when leaving the lane, vehicles of the same type preferentially leave the lane.
First-in first-out rule: and vehicles entering the lane first and vehicles leaving the lane first in the same lane.
And step 3: binding the queues and the queue rules according to the user requirements, expressing as { T, P }, and forming a hierarchy by the bound queues and the queue rules of each group and the logic processing of the rules;
the rule logic process is used for executing the queue rule and is realized by calling an action.
And 4, step 4: the overall level rule F is logically abstracted into a rule set formed by arranging and combining a series of basic overall business rules, and is represented as:
Figure BDA0001345573710000042
wherein, OiThe basic total business rules are divided into the following types: a first-out rule with the longest waiting time, an emergency order priority rule, a repair priority rule and a fast track priority rule, wherein n represents the number of total business rules; according to basic general business rules OiIs determined by the attribute of (1)iDetermining the type of the business rule, and determining the unique identifier of the total business rule;
latency longest first out rule: the vehicle with the longest waiting time is the first to exit.
Emergency order priority rules: vehicles of emergency orders enter and exit the lane preferentially.
Rework priority rules: the repaired vehicle is preferentially out of the way.
Fast track priority rules: the express way has a vehicle to exit preferentially.
And 5: defining a master level structure, including a monitoring module, a master level processing logic and a master level rule;
the monitoring module is used for monitoring the channel entering signal and the channel exiting signal and sending the signals to the processing logic of the master stage;
and the overall-level processing logic is used for processing according to each hierarchical feedback information to obtain a lane finally used for scheduling. In addition, the lane can be finally selected according to the overall rule (the longest waiting time first-out rule, the emergency order priority rule, the repair priority rule and the express way priority rule).
Step 6: each hierarchy registers with the master hierarchy; the monitoring module of the main level monitors the entering signal and the exiting signal, broadcasts the signal to each registered grading, after calling the grading rule logic processing for logic judgment, feeds back information (lane information and vehicle information) to the main level, and the main level selects the optimal lane for grading meeting the entering/exiting requirement (if the feedback information of grading is received, if not, the feedback information of grading is met) according to the queue priority. And moving the vehicle to be dispatched into or out of the lane according to the entering signal and the exiting signal.
The lane information comprises lane numbers, lane types, lane capacity, lane priority and lane states;
the vehicle information includes a vehicle number, a vehicle type, an offline date, an engine type, a transmission type, and a vehicle state.
The main set of attributes of the queue is: { queue unique identification, capacity, available capacity, priority, queue type, queue description }.
The main set of attributes of the queue rule are: { unique identification of rules, priority, description of rules, hierarchical rule logic processing }. The hierarchical rules logic processes the inputs: an in/out signal; and (3) outputting: lane information, vehicle information; the treatment method comprises the following steps: and (4) business rule matching, namely a vehicle type centralizing rule and a first-in first-out rule.
The main actions of the queue include: the method comprises the following steps of enqueuing action, dequeuing action, queue judgment as empty action, queue priority acquisition action, queue priority setting action, queue head acquisition action, queue tail acquisition action, enqueuable judgment action and dequeuable judgment action.
And when the total level or the grading level is processed according to the total level rule or the grading rule, calling and executing the corresponding action to obtain the vehicle information and the lane information.
The enqueue action is represented as a continuous operation: 1. the occupied capacity of the queue is added by 1; 2) and setting the vehicle type of the entering queue as the current vehicle type of the entering.
The dequeue action is represented as a continuous operation: 1. the occupied capacity of the queue is reduced by 1; 2) the queue judges whether the queue is empty; 3) if the First is not obtained for the empty, the vehicle type of the exit queue is set as the First vehicle type, and if the First is not obtained for the empty, the vehicle type of the exit queue is set as the empty.
The get queue priority action is represented as a continuous operation: 1) the queue priority is returned.
The set queue priority action is represented as a continuous operation: 1) and setting queue priority.
The get head of line action is represented as a continuous operation: 1) judging whether the queue is empty; 2) and if the queue is not empty, returning the vehicle information of the first position, otherwise, returning to be empty.
The acquisition queue tail action is represented as a continuous operation: 1) judging whether the queue is empty; 2) if the queue is not empty, vehicle information is returned for the (occupied capacity) th location, otherwise empty is returned.
The enqueueable determination is represented as a continuous operation: 1) judging whether the queue is full; 2) and judging whether the enqueue rule level is met, if so, enqueuing the queue, and if not, enqueuing the queue.
The dequeuable determination is represented as a continuous operation: 1) judging whether the queue is empty; 2) and judging whether the dequeuing rule level is met, if so, dequeuing the queue, and if not, dequeuing the queue.
Table 1 describes the PBS buffer layout, and the present invention is directed to buffer types that are a combination of linear and circular. The buffer area has 5 lanes, 4 lanes are FIFO type lanes, and one lane is used as a return lane. The return track can be used for sequencing the vehicles in the buffer area.
TABLE 1
Lane name Type of lane Lane capacity Available capacity Priority of lane Direction of lane
Lane 1 Ordinary FIFO 10 10 1 Forward direction
Lane 2 Ordinary FIFO 10 10 2 Forward direction
Lane 3 Ordinary FIFO 10 10 3 Forward direction
Lane 4 Ordinary FIFO 10 10 4 Forward direction
Lane 5 Return FIFO 10 10 0 Reverse direction
Table 2 describes PBS buffer traffic rules.
TABLE 2
Business rule identification Business rule description Business rule types Business rule classes
R1 Priority of delivery Total stage Entering/exiting lane
R2 Vehicle type centralization Grading Entering/exiting lane
R3 High, medium and low ratio Grading Entering/exiting lane
Table 3 describes the binding relationship between the lane queues and the classification rules
TABLE 3
Figure BDA0001345573710000071
Suppose there are 5 types of vehicle types as A, B, C, D, E, the high, medium and low configurations are numerically expressed as 1, 2 and 3, and the ratio of high, medium and low of A type is expressed as A1、A2、A3}. Assuming that there are 35 vehicles to enter the buffer, it is expressed as: { A1[001]，A1[002]，B1[003]，B2[004]，C3[005]，C3[006]，A3[007]，A3[008]，A3[009]，D1[010]，E1[011]，A2[012]，A2[013]，B3[014]，B3[015]，A2[016]，A2[017]，B2[018]，B2[019]，C2[020]，C2[021]，D3[022]，D3[023]，D2[024]，D2[025]，E3[026]，E3[027]，C1[028]，C1[029]，A3[030]，A3[031]，B1[032]，B2[033]，B3[034]，B3[035]}。
Vehicle to be driven { A1[001]，A1[002]Calculating each lane according to rules to form an optional lane set { lane 1, lane 2, lane 3 and lane 4}, and determining that the lane 1 is occupied by the total-level processing logic and the occupied capacity is 2;
vehicle to be driven { B1[003]，B2[004]Calculating each lane according to rules to form an optional lane set { lane 2, lane 3 and lane 4}, confirming that the lane 2 is formed by the overall-level processing logic, and the occupied capacity is 2;
vehicle to be driven { C3[005]，C3[006]Calculating each lane according to rules to form an optional lane set { lane 3, lane 4}, and determining that the lane 3 is occupied by the total-level processing logic and the occupied capacity is 2;
vehicle to be driven { A3[007]，A3[008]，A3[009]Calculating each lane according to rules to form an optional lane set { lane 1, lane 4}, and determining that the lane 1 is occupied by the total-level processing logic and the occupied capacity is 5;
vehicle to be driven { D1[010]Calculating each lane according to rules to form an optional lane set { lane 4}, and determining that the occupied capacity of the lane 4 is 1 by a total-level processing logic;
vehicle to be driven { E1[011]Calculating each lane according to rules, determining that the selectable lane set is empty, and determining that the lane 1 is occupied by a total level processing logic according to the priority, wherein the occupied capacity is 6;
vehicle to be driven { A2[012]，A2[013]Calculating each lane according to rules, determining that the selectable lane set is empty, and determining that the lane 1 is occupied by a total level processing logic according to the priority, wherein the occupied capacity is 8;
vehicle to be driven { B3[014]，B3[015]Calculating each lane according to rules to form an optional lane set { lane 2}, confirming that the lane is lane 2 and the occupied capacity is 4 by a total-level processing logic;
vehicle to be driven { A2[016]，A2[017]Calculating each lane according to rules to form an optional lane set { lane 1}, determining that the lane 1 is occupied by the total-level processing logic, wherein the occupied capacity is 10, and the lane 1 is temporarily closed;
vehicle to be driven { B2[018]，B2[019]Calculating each lane according to rules to form an optional lane set { lane 2}, confirming that the lane 2 is the lane 2 by the overall level processing logic and the occupied capacity is 6;
vehicle to be driven { C2[020]，C2[021]Calculating each lane according to rules to form an optional lane set { lane 3}, and determining that the lane 3 is the lane 3 and the occupied capacity is 4 by the overall level processing logic;
vehicle to be driven { D3[022]，D3[023]，D2[024]，D2[025]Calculating each lane according to rules to form an optional lane set { lane 4}, and determining that the lane 4 is occupied by the total-level processing logic, wherein the occupied capacity of the lane 4 is 5;
vehicle to be driven { E3[026]，E3[027]Calculating each lane according to rules, wherein the set of selectable lanes is empty, and the set of selectable lanes is confirmed to be lane 2 by the total-level processing logic, and the occupied capacity is 8;
vehicle to be driven { C1[028]，C1[029]Calculating each lane according to rules to form an optional lane set { lane 3}, and determining that the lane 3 is occupied by the total-level processing logic, wherein the occupied capacity of the lane 3 is 6;
vehicle to be driven { A3[030]，A3[031]Calculating each lane according to rules, wherein the set of selectable lanes is empty, and the lane 2 is confirmed by the total-level processing logic to be the lane 2, the occupied capacity is 10, and the state of the lane 2 is temporarily closed;
vehicle to be driven { B1[032]，B2[033]，B3[034]，B3[035]Calculating each lane according to rules, wherein the set of selectable lanes is empty, and the total-level processing logic determines that the occupied capacity of the lane 3 is 10;
the entry results are shown in FIG. 2.
Fig. 3 and 4 show buffer zone vehicle egress.
Each lane forms an optional lane according to the calculation of rulesThe lane set { lane 1, lane 2, lane 3, lane 4} is confirmed by the overall processing logic as lane 1, departure { A }1[001]，A1[002]，A3[007]，A3[008]，A3[009]Occupied capacity is 5;
calculating each lane according to rules, if the lane set of the vehicle is empty, only calculating according to load balancing rules by the overall processing logic, confirming lane 1, and vehicle out { E }1[011]Entering a lane 5, wherein the occupied capacity of the lane 1 is 4, and the occupied capacity of the lane 5 is 1;
each lane is calculated according to rules to form a selectable lane set { lane 1}, and the lane set is confirmed as lane 1 and is output { A } by the overall processing logic2[012]，A2[013]，A2[016]，A2[017]Occupied capacity is 0;
each lane is calculated according to rules to form a selectable lane set { lane 2}, and the lane set is confirmed as lane 2 and the vehicle is driven out { B } by the overall processing logic1[003]，B2[004]，B3[014]，B3[015]，B2[018]，B2[019]Occupied capacity is 4;
calculating each lane according to rules, if the lane set of the vehicle is empty, only calculating according to load balancing rules by the overall processing logic, confirming lane 2, and vehicle out { E }3[026]，E3[027]Entering a lane 5, wherein the occupied capacity of the lane 2 is 2, and the occupied capacity of the lane 5 is 3;
each lane is calculated according to rules to form a selectable lane set (lane 2), and the lane 2 and the vehicle exit (A) are confirmed by the overall processing logic3[030]，A3[031]Occupied capacity is 0;
each lane is calculated according to rules to form a selectable lane set (lane 3), and the lane 3 and the vehicle exit { C) are determined by overall processing logic3[005]，C3[006]，C2[020]，C2[021]，C1[028]，C1[029]Occupied capacity is 4;
each lane is calculated according to rules to form a selectable lane set (lane 3), and the lane 3 and the vehicle B are determined by the overall processing logic1[032]，B2[033]，B3[034]，B3[035]Occupied capacity is 0;
each lane is calculated according to rules to form a selectable lane set { lane 4}, and the lane 4 and the vehicle exit { D } are determined by overall processing logic1[010]，D3[022]，D3[023]，D2[024]，D2[025]Occupied capacity is 0;
each lane is calculated according to rules, the set of optional lanes is empty, the total-level processing logic confirms that the vehicles in lane 5 enter lane 1 and exit, and exit { E }1[011]，E3[026]，E3[027]And the occupied capacity of the lane 1 and the lane 5 is 0.

Claims (10)

1. A PBS scheduling method based on rule hierarchical autonomy is characterized by comprising the following steps:
step 1: abstracting a lane of a PBS buffer area into a first-in first-out queue T, defining queue attributes and actions, and determining a unique identifier of the queue;
step 2: separating the service rules of the PBS buffer area into a total-level rule and a grading queue rule; the logic abstraction of the queue rule P is a rule set formed by arranging and combining business rules, and is expressed as
Figure FDA0003023952820000011
Wherein R isiIs a business rule, n is a natural number; according to business rules RiDetermining R as an attribute ofiThe method comprises the following steps of (1) determining a unique identifier of a business rule, wherein the business rule belongs to which business rule type;
and step 3: binding the queue and the queue rule, and expressing as { T, P }, wherein the bound queue and the queue rule and the rule logic process to form a hierarchy;
and 4, step 4: the total level rule F is logically abstracted into a rule set formed by arranging and combining the total business rules, and is expressed as:
Figure FDA0003023952820000012
wherein O isiIs a total business rule; according to general business rules OiIs determined by the attribute of (1)iDetermining the type of the business rule, and determining the unique identifier of the total business rule;
and 5: the monitoring module, the processing logic of the master level and the master business rule set form a master level;
step 6: each hierarchy registers with the master hierarchy; after monitoring the channel entering signal and the channel exiting signal, the master level monitoring module broadcasts signals to each registered level; and after calling and executing the hierarchical rule logic processing in each hierarchy, feeding back information to the total level, wherein the total level obtains the dispatched lane according to the priority of the queue in the hierarchy for sending the feedback information.
2. The method of claim 1, wherein the queue has a set of attributes: { queue unique identification, capacity, available capacity, priority, queue type, queue description }.
3. The method of claim 1, wherein the queue rule has a set of attributes: { unique identification of rule, priority, description of rule, logical processing of rule }.
4. The method of claim 1, wherein the queue action comprises: the method comprises the following steps of enqueuing action, dequeuing action, queue judgment as empty action, queue priority acquisition action, queue priority setting action, First acquisition action, Last acquisition action, enqueuable judgment action and dequeuable judgment action.
5. A method as claimed in claim 1 or 4, wherein the queue action is invoked and executed by a hierarchical and/or overall level.
6. The PBS scheduling method of claim 1, wherein the in-lane signal comprises current in-lane vehicle information and the out-lane signal comprises current out-lane vehicle information.
7. The PBS scheduling method based on rule-based hierarchical autonomy as claimed in claim 1, wherein the hierarchical calling and executing hierarchical rule logic processing specifically comprises: and logically processing each hierarchical classification rule to obtain vehicle information and lane information according to the hierarchical queue rule.
8. A PBS scheduling system based on rule-based hierarchical autonomy, comprising:
the main level is used for processing according to the entry signal, the exit signal and each grading feedback information to obtain a lane finally used for dispatching;
the classification is used for executing the queue rule and feeding back information to the overall level;
the PBS scheduling system is used for executing the following steps:
step 1: abstracting a lane of a PBS buffer area into a first-in first-out queue T, defining queue attributes and actions, and determining a unique identifier of the queue;
step 2: separating the service rules of the PBS buffer area into a total-level rule and a grading queue rule; the logic abstraction of the queue rule P is a rule set formed by arranging and combining business rules, and is expressed as
Figure FDA0003023952820000021
Wherein R isiIs a business rule, n is a natural number; according to business rules RiDetermining R as an attribute ofiThe method comprises the following steps of (1) determining a unique identifier of a business rule, wherein the business rule belongs to which business rule type;
and step 3: binding the queue and the queue rule, and expressing as { T, P }, wherein the bound queue and the queue rule and the rule logic process to form a hierarchy;
and 4, step 4: the total level rule F is logically abstracted into a rule set formed by arranging and combining the total business rules, and is expressed as:
Figure FDA0003023952820000022
wherein O isiIs a total business rule; according to general business rules OiIs determined by the attribute of (1)iDetermining the type of the business rule, and determining the unique identifier of the total business rule;
and 5: the monitoring module, the processing logic of the master level and the master business rule set form a master level;
step 6: each hierarchy registers with the master hierarchy; after monitoring the channel entering signal and the channel exiting signal, the master level monitoring module broadcasts signals to each registered level; and after calling and executing the hierarchical rule logic processing in each hierarchy, feeding back information to the total level, wherein the total level obtains the dispatched lane according to the priority of the queue in the hierarchy for sending the feedback information.
9. The PBS scheduling system of claim 8, wherein the overall hierarchy comprises:
the monitoring module is used for monitoring the channel entry signal and the channel exit signal and sending the signals to the processing logic;
the master rule is used for setting according to the service requirement;
and the processing logic is used for processing or executing a general level rule according to the entry signal, the exit signal and each level feedback information to obtain a lane finally used for scheduling.
10. The system of claim 8, wherein the ranking comprises:
a queue for representing a lane;
the queue rule is used for setting according to the scheduling requirement;
and the rule logic process is used for executing the queue rule and feeding back information to the overall level.
CN201710555326.4A 2017-07-10 2017-07-10 PBS scheduling method based on rule classification autonomy Active CN109242228B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710555326.4A CN109242228B (en) 2017-07-10 2017-07-10 PBS scheduling method based on rule classification autonomy

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710555326.4A CN109242228B (en) 2017-07-10 2017-07-10 PBS scheduling method based on rule classification autonomy

Publications (2)

Publication Number Publication Date
CN109242228A CN109242228A (en) 2019-01-18
CN109242228B true CN109242228B (en) 2021-06-11

Family

ID=65082764

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710555326.4A Active CN109242228B (en) 2017-07-10 2017-07-10 PBS scheduling method based on rule classification autonomy

Country Status (1)

Country Link
CN (1) CN109242228B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115685951B (en) * 2023-01-04 2023-03-31 中汽研汽车工业工程(天津)有限公司 Automobile production PBS buffer area scheduling control method and system
CN116205471B (en) * 2023-05-05 2023-08-08 华侨大学 Cache region scheduling method, device and equipment for automobile manufacturing
CN116500999B (en) * 2023-06-26 2023-09-26 广汽埃安新能源汽车股份有限公司 Vehicle body PBS (phosphate buffer solution) library scheduling method, system, electronic equipment and storage medium

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8548918B1 (en) * 2006-12-18 2013-10-01 Qurio Holdings, Inc. Methods and systems for automated content distribution
CN101582913A (en) * 2008-05-14 2009-11-18 北京帮助在线信息技术有限公司 Equipment and method for graded dispatching of platforms
CN101621457B (en) * 2008-07-01 2012-05-23 大唐移动通信设备有限公司 Multi-service scheduling method and system
CN102270385A (en) * 2010-06-01 2011-12-07 上海经达实业发展有限公司 Intelligent public transport scheduling and management system
US8744890B1 (en) * 2013-02-14 2014-06-03 Aktana, Inc. System and method for managing system-level workflow strategy and individual workflow activity
CN103473642A (en) * 2013-09-10 2013-12-25 中国科学院沈阳自动化研究所 Method for rule engine for production dispatching
CN103927689A (en) * 2014-05-06 2014-07-16 安徽工程大学 Dispatching control method for batch processor of reentrant manufacturing system
CN105045243B (en) * 2015-08-05 2017-08-25 同济大学 A kind of Dynamic Schedule of Semiconductor Fabrication Line device
US9804895B2 (en) * 2015-08-28 2017-10-31 Vmware, Inc. Constrained placement in hierarchical randomized schedulers
CN105302638B (en) * 2015-11-04 2018-11-20 国家计算机网络与信息安全管理中心 MPP cluster task dispatching method based on system load
CN105321047A (en) * 2015-11-10 2016-02-10 中国电力科学研究院 Multi-dimensional verification method for schedule plan data
CN105873233B (en) * 2016-03-29 2019-03-01 西安电子科技大学 IEEE802.11ax based on layering scheduling accesses Enhancement Method
CN106408153A (en) * 2016-08-12 2017-02-15 武汉科技大学 Case reasoning-based steel enterprise production dynamic scheduling adjustment method and expert system
CN106447211B (en) * 2016-10-11 2021-01-15 深圳同耕科技股份有限公司 System and method for sorting products in cache area between production workshops of product manufacturing enterprise
CN106712117B (en) * 2017-01-03 2019-03-19 国电南瑞科技股份有限公司 The interconnected network two-level scheduler AGC coordinated control system and method shared based on ACE

Also Published As

Publication number Publication date
CN109242228A (en) 2019-01-18

Similar Documents

Publication Publication Date Title
CN109242228B (en) PBS scheduling method based on rule classification autonomy
US8134743B2 (en) Methods and systems for routing and processing jobs in a production environment
Cao et al. Integrated quay crane and yard truck schedule problem in container terminals
CN116113899A (en) Robot production environment for vehicles
WO2016074538A1 (en) Sent order ranking system and method for reducing no-load running and waiting time in online taxi renting
CN110084505A (en) A kind of smart shift scheduling method and device based on passenger flow, mobile end equipment, server
CN101604416A (en) A kind of transportation dispatching method and dispatching system thereof of joining the center based on the third-party logistics collection
CN108416559B (en) Intelligent carpooling matching method for maximizing vehicle owner income of freight platform
CN101739655A (en) Method for scheduling public slow system dynamically based on rolling horizon scheduling algorithm
CN112085271B (en) Crowdsourcing mode-based traditional industry cluster goods collection path optimization method
WO2019027715A1 (en) An interactive real time system and real time method of use thereof in conveyance industry segments
CN112241871A (en) Bus driver intelligent scheduling method based on segmentation and combination optimization
CN115456296A (en) Truck dynamic scheduling method, device, equipment and storage medium
CN112801336B (en) Freight regulation and control method for combined collage
CN113344336A (en) Vehicle scheduling method and device and storage medium
CN116205471B (en) Cache region scheduling method, device and equipment for automobile manufacturing
CN109242230B (en) Scheduling method for solving WBS (work breakdown Structure) sorting problem
Cheng et al. Optimization for vehicle scheduling in iron and steel works based on semi-trailer swap transport
CN111036559B (en) Cross belt type multistage sorting equipment and method
CN101594380A (en) Logistic information systems and information issuing method based on vehicle-mounted GPRS system
Nakashima et al. Management of a disassembly line using two types of kanbans
He et al. A hybrid two-stage flowshop scheduling problem
US20190156284A1 (en) Logistics data management method and system thereof
CN111709570B (en) Optimization method for network drop-and-drop transport scheduling
CN105374100A (en) Car-pooling method and system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant