[go: up one dir, main page]

CN109767118A - A Dynamic Capacity Reservation Method for Limited Buffers in a Passenger Car Paint Shop with Reentrant Processes - Google Patents

A Dynamic Capacity Reservation Method for Limited Buffers in a Passenger Car Paint Shop with Reentrant Processes Download PDF

Info

Publication number
CN109767118A
CN109767118A CN201910026384.7A CN201910026384A CN109767118A CN 109767118 A CN109767118 A CN 109767118A CN 201910026384 A CN201910026384 A CN 201910026384A CN 109767118 A CN109767118 A CN 109767118A
Authority
CN
China
Prior art keywords
buffer
probability
time
passenger car
station
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.)
Pending
Application number
CN201910026384.7A
Other languages
Chinese (zh)
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 Jianzhu University
Original Assignee
Shenyang Jianzhu University
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 Jianzhu University filed Critical Shenyang Jianzhu University
Priority to CN201910026384.7A priority Critical patent/CN109767118A/en
Publication of CN109767118A publication Critical patent/CN109767118A/en
Pending legal-status Critical Current

Links

Classifications

    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30Computing systems specially adapted for manufacturing

Landscapes

  • Automobile Manufacture Line, Endless Track Vehicle, Trailer (AREA)

Abstract

一种在具有可重入工序的客车涂装车间中有限缓冲区动态容量预留方法,属于客车生产工艺技术领域。通过预测客车将折返执行可重入工序的工位上加工的客车发生变化情况,即折返执行可重入工序所对应缓冲区资源释放概率,在排产过程中为执行可重入工序的客车将折返要进入的缓冲区动态预留容量,使得将执行可重入工序的客车能够顺利折返进入到有限缓冲区中,不会滞留在其当前工位中,从而使得该工位出现阻塞的概率下降,降低因客车争夺缓冲区资源而导致严重连续阻塞现象对生产进程的影响,降低生产过程中死锁现象发生的概率,从而保证了客车涂装车间生产进程能够顺利的进行。The invention relates to a method for reserving dynamic capacity of a limited buffer zone in a bus painting workshop with re-entrant processes, belonging to the technical field of bus production technology. By predicting the change of the bus to be processed at the station where the reentrant process is performed, that is, the release probability of the buffer resources corresponding to the reentrant process, during the production scheduling process, the reentrant process for the bus will be The dynamic reserved capacity of the buffer zone to be reentrant allows the passenger car that performs the reentrant process to be smoothly reentrant into the limited buffer zone and will not stay in its current station, thereby reducing the probability of blockage at the station. , reducing the impact of the serious continuous blocking phenomenon on the production process caused by the competition for buffer resources by the passenger cars, and reducing the probability of deadlock in the production process, thus ensuring the smooth production process of the passenger car painting workshop.

Description

A kind of limited buffer dynamic appearance in there is the bus body painting workshop that can reentry process Measure method for obligating
Technical field
The present invention relates to a kind of in having the bus body painting workshop that can reentry process, and limited buffer dynamic capacity is reserved Method belongs to bus coating technology field.
Technical background
The production method of customization brings the difference of car process flow, and the bus coating period is longer, needs a large amount of Buffer area parking stall carry out the car to be processed such as temporary storage.In the actual production process, it is being made since car belongs to large volume Product can only be arranged a limited number of buffer areas in parking stall on bus coating line, lead to the offer production capacity in workshop and the need of production task Ask production capacity that cannot be well matched with, when the matching relationship of the two fluctuates, the car quantity stored in buffer area is easy Reach capacity the upper limit, car a upper procedure after processing is completed, not can enter buffer area, car can only be in current station The release of pending buffer area, this will lead to production process and choking phenomenon occurs, and then increase uncertain in production process.Work as production In the presence of when can reentry process in the process flow of task, the produce load that will lead to workshop is multiplied, and improves railway car manufacture The complexity of Workshop Production control, further increases the uncertainty of production process.During railway car manufacture, passenger car body The different colour bar patterns of upper air brushing are enterprise technology personnel in advance according to colour bar template complexity, and colour bar is resolved into a variety of face Color, it is every to be gone over " patch colour bar ", " spray painting ", a kind of color of " baking finish " process air brushing, global pattern is formed by multipass air brushing, So bus body painting workshop multipass colour bar process section is that one kind can typically reentry the production phase.There is the visitor that can reentry process In vehicle Painting Shop, the car that process can be reentried by executing has the characteristics that be reinserted into queue to be processed, if executed It is complete in a upper procedure for the buffer area when can reentry the car of process the buffer pool size for entrance of turning back being had reached the upper limit Work car can not enter the buffer area, so that there is choking phenomenon in the production link before the buffer area, meanwhile, it to hold Row can reentry the car of process because detecting without residual capacity in the buffer area to be entered, then the car, which remains in, works as In preceding station, cause station where it that can not discharge in time, so that should enter the car of the station can not carry out normally Production and processing is led so that choking phenomenon occurs in the production link after the buffer area, and then forms chain production obstruction It causes entire production process that deadlock situation occurs, seriously affects normal production process, the presence of limited buffer and process can be reentried Presence will lead to and generate higher misfortune between the car of Continuous maching and close property, if having the car quantity for reentrying process to increase Add, then can further increase the probability of deadlock situation appearance, will lead to production process under serious situation and stagnate completely, manufactured Cheng Wufa is carried out, and significantly increases the difficulty of the production management tissue of enterprise.If the car that execution can reentry process will be rolled over Returning the buffer area to be entered then can reentry process for execution for that need to execute the car advance reservation capacity that can reentry process Car will not turn back to execute because of car and can reentry the buffer area of process and reach its maximum size and be trapped in its current station, Car will turn back execute reentry process buffer area can receive the car so that the station of car processing tasks is completed There is the probability blocked decline, and then the probability of deadlock situation appearance can be reduced.
In order to solve this problem, China's patent of invention, Patent No. CN103927689A's " one kind can reentry type manufacture System batch processor dispatch control method ", disclose a kind of dispatch control method based on pull-type rule.This method is directed to because can Reentry process with it is non-reentry between process lack manufacture cooperate with the problem of studied, pass through the scheduling based on pull-type rule Control method realization can reentry process and it is non-reentry good Collaborative Manufacturing between process, reducing can reentry in type manufacture system The probability that choking phenomenon occurs.But this method is studied only for the workshop with unlimited buffer area, is not considered The limited situation in buffer area in workshop.
For occurring production blocking even deadlock situation in the production process of manufacturing shop, adjusted in academic article frequently with dynamic Whole buffer pool size or the method for adding common buffer solve, but for actual railway car manufacture workshop, bus coating line Once being completed by construction, the buffer pool size between process just is substantially fixed, while setting on car disengaging production line The common buffer set will increase the transhipment time of car, and then influence total complete time, so dynamic adjustment buffer pool size Or the method limitation by all many conditions in practical engineering applications of common buffer is added, therefore can weigh currently for having Enter the production obstruction and deadlock situation occurred during the limited bus coating of process and buffer pool size, there is no effective solution Method.
Summary of the invention
It is reserved that the present invention provides a kind of limited buffer dynamic capacity in having the bus body painting workshop that can reentry process Method is turned back and is held by predicting that the car execution that will turn back can reentry the car processed on the station of process and change situation Row can reentry the release probability of buffer resource corresponding to process, and the car that can reentry process during scheduled production for execution will turn back The buffer area dynamic reserved capacity to be entered, enable will execute the car that can reentry process smoothly turn back enter it is limited slow It rushes in area, is not detained in its current station, so that the probability blocked decline occurs in the station, reduce because of car contention Buffer resource and lead to serious continuous influence of the choking phenomenon to production process, reduce what deadlock situation in production process occurred Probability, to ensure that bus body painting Workshop Production process can be carried out smoothly.
To achieve the above object, the present invention, which solves the technical solution of technical problem, is:
Step 1: the Markov state transfer matrix based on bus body painting workshop historical production data is established, for predicting Process Oper can be reentriedrmUCorresponding buffer area bu resource discharges probability, is ready for buffer pool size is reserved.Pass through analysis The production history data in bus body painting workshop, process Oper can be reentried in the execution that will turn back of the interior car of unit time t ' by establishingj(j =rmU) each station transition probability matrix Py(y=1...MU).Wherein
Indicate station WS at the beginning of unit time t 'U, kuThe car of upper processing does not change, but passes through Cross unit time t ' later, the unchanged probability of the car processed on station.
Indicate station WS at the beginning of unit time t 'U, kuThe car of upper processing does not change, but passes through Cross unit time t ' later, the probability that the car processed on station changes.
Indicate station WS at the beginning of unit time t 'U, kuThe car of upper processing changes, but passes through Unit time t ' later, the unchanged probability of the car processed on station.
Indicate station WS at the beginning of unit time t 'U, kuThe car of upper processing changes, but passes through Unit time t ' later, the probability that the car processed on station changes.
MUIndicate that car turned back execution reentries process Operj(j=rmU) the parallel number of stations of maximum;WithTable In the case where showing that station processing car does not occur or changes at the beginning of unit time t ', when by unit Between t ' later, the car processed on station changes, i.e., the station free time must occurs and to be stored in and can weigh unit time t ' is interior Enter process OperrmUCar in corresponding buffer area bu is able to enter the station and is processed, meanwhile, buffer resource is released It discharges therewith.Therefore, it is considered as in varied situations, unit time t ' internal buffer resource discharges probability.
Step 2: judging whether that starting executes limited buffer dynamic capacity method for obligating, having for process can be reentried when having Limit buffer area bus body painting manufacture process proceeds to t moment, and production run state is as shown in Figure 1.If meeting following item Part thens follow the steps 3, calculates buffer resource and discharges probability.
1. in t moment, from the non-completion car J for reentrying process sectionnrmTo enter process OperrmUBuffer area bu;
2. in t moment, process OperrmUBuffer area bu store car numberLess than buffer area bu maximum size BZSU, AndI.e. in t moment, process OperrmUBuffer area residual capacity can only store a workpiece;
3. car execution of turning back can reentry production process Oper in t momentrmUStation be in occupied state;
4. process Oper can be reentried in t momentrmDStation on exist need to traverse the car that can reentry process section again;
5. on the basis of meeting above-mentioned 4 conditions, if process Oper can be reentriedrmUStation on the visitor that completes at first Vehicle JUCompletion dateLess than production process Oper can be reentriedrmDIn the car J that completes at firstDCompletion time t2, then Execute the subsequent operation of Network with Finite Buffers method for obligating.
Wherein, process Oper can be reentriedrmUIn the car that completes at first to enter the time of buffer area bd be t1(t1>=t), because To be likely to occur choking phenomenon under conditions of buffer pool size is limited, so will appear car JUIt is still trapped in after completion to add Situation on work station can reentry process OperrmUIn the car J that completes at firstUInto the time t of buffer area bd1It is more than or equal toProcess Oper can be reentriedrmDIn the car J that completes at firstDCompletion time be t2
If being unsatisfactory for above-mentioned condition, without executing the subsequent operation of Network with Finite Buffers method for obligating.Such as Fig. 1 institute Show.
Step 3: it will be turned back by prediction car and execute the situation of change for processing car on the station that can reentry process, i.e., it is slow Area resource release probability is rushed, to judge whether its corresponding buffering area residual capacity is that the car reentried is reserved.
In t moment, t is predicted by Prediction of Markov method2Moment can reentry process OperrmUParallel station on most The car J first to completeUPlace station WSU, kuThe changed probability P of the car of upper processing2(i.e. prediction t2Moment station WSU, kuAdd The probability of work difference car) and station WSU, kuUpper processing car does not change, is constantly in by same car occupied state Probability P1.Assuming that t2Moment station WSU, kuProcess different cars, it is known that in t2Before moment, process can be reentried by being stored in OperrmUCorresponding buffering area bu microbus entrance can reentry process OperrmUStation WSU, kuIn, then buffer resource is also therewith Release, in t2Moment can reentry process OperrmDIn the car J that completes at firstDWhen being prepared to enter into buffer area bu, buffer area bu exists Residual capacity.Therefore, WSU, kuProcess the probability P of different cars2It is equivalent to the probability of buffer area bu resource release.It is pre- by acquiring Survey t2Moment station WSU, kuProcess the probability P of different cars2And then obtain probability (the i.e. t of buffer area bu resource release2Moment, Station WSU, kuProcess different car probability Ps2), and then dynamic judges whether buffer area bu residual capacity is car JDIt is reserved, it reduces Because of car JnrmWith JDBetween fight for buffer resource and generate the probability of deadlock situation.
Step 3.1: the car for executing and can reentrying and processing on the station of process of being turned back by calculating car is changed general Rate is obtained in the following t2Moment buffer area bu resource discharges probability.
The probability of car variation of the t moment in the interior station processing of unit time t ' is calculated by the method for probability statistics a2
S0=(a1, a2), (a1+a2=1) (2)
A in formula (2)1Indicate that the production process data by analysis since production until t moment, statistics obtain 0 to t In the period at moment, station WSU, kuThe quantity of the upper processing unchanged unit time t ' of car was arrived with 0 in the time of t moment Ratio comprising unit time t ' sum, i.e., the probability occupied in t moment, the interior station of unit time t ' by same car.
A in formula (2)2Indicate that the production process data by analysis since production until t moment, statistics obtain 0 to t In the period at moment, station WSU, kuThe quantity of unit time t ' that upper processing car changes and packet in 0 to t moment time The ratio of the sum of the t ' containing unit time, i.e., the probability occupied in t moment, the interior station of unit time t ' by different cars.
S0Indicate the probability vector of the car processed in t moment, the interior station of unit time t ' variation.
Pass through current t moment station WSU, kuThe probability vector S of the car variation of upper processing0It will calculate according to formula (3) in future t2Moment station WSU, kuThe probability vector S of the car variation of upper processingv, according to required result (i.e. in t2Moment station WSU, kuOn The probability vector S of the car variation of processingv) obtain process OperrmUIn the car J that completes at firstUThe station WS at placeU, kuIt is upper to add The car of work does not change, is constantly in the probability P of occupied state1(i.e. prediction t2Moment, station WSU, kuThe probability of occupancy) With station WSU, kuThe changed probability P of the car of upper processing2(i.e. prediction t2Moment, process OperrmUBuffer resource release Put probability).
V indicates the sum in the time at t to t2 moment comprising unit time t ' in formula (3).
Step 3.2: showing that buffer resource discharges probability and determines that the car execution that will turn back can reentry work by step 3.1 Whether buffer area corresponding to sequence will reserve residual capacity for the car, and detailed process is as follows:
Process Oper can be reentried according to car execution of turning back has been found outrmUThe car J to complete at firstUThe station at place WSU, kuThe changed probability of processing car (buffer resource release probability) judge buffer area bu residual capacity whether be Process Oper can be reentriedrmDIn the car J that completes at firstDIt is reserved.
If P2≤P1, t2Moment station WSU, kuThe probability for processing different cars is lower, in t2Buffer area bu is deposited before moment Process Oper can be reentried by putting car entrancermUStation WSU, kuProbability it is lower, buffer resource is difficult to discharge, if buffer area bu Allow car JnrmInto, seize buffer area bu unique resource, cause reentry car JDCar with from the non-process section of reentrying Car JnrmCompetition buffer resource fails and rests on its current station, causes the generation of choking phenomenon.If JDPlace can weigh Enter process OperrmDThe car execution that all needs to turn back of other stations processing can reentry process OperrmU, then can cause continuously to hinder The generation of phenomenon is filled in, and then causes deadlock situation (as indicated with 2).With JDBetween fight for buffer resource and cause deadlock situation, such as Shown in Fig. 2, therefore, process Oper can be reentriedrmUThe residual capacity of place buffer area bu is car JDIt is reserved, meanwhile, from it is non-can Reentry the car J of processnrmProcess section can be reentried by being prohibited from entering.
If P2> P1, indicate predicted, t2Moment station WSU, kuThe probability for processing different cars is higher, in t2Moment it Preceding buffer area bu storage car entrance can reentry process OperrmUStation WSU, kuProbability it is higher, buffer resource is easy to get to releasing It puts.Work as t2Moment can reentry process OperrmDIn the car J that completes at firstDWhen being prepared to enter into buffer area bu, buffer area bu has higher There may be residual capacities.Therefore in t moment, process Oper can be reentriedrmUBuffer area need not reserved capacity, therefore allow come From the non-car J for reentrying processnrmInto process section can be reentried.
Step 4: if deviation occurs in prediction, (i.e. prediction buffer area bu resource release probable deviation, leads to JnrmInto buffering Area bu, seizes unique resource, causes still generate deadlock situation in production process), to avoid going out for prediction deviation It is existing, process Oper can be reentried according to t momentrmDThe execution that need to be turned back of whole stations can reentry process OperrmUReentry car account for Threshold alpha is set with rate, deviation compensation measure is added in the result of step 3.2.If step 3.2 show that prediction result allows to come From the non-car for reentrying process into process section can be reentried, then t moment is calculated, process Oper can be being reentriedrmDIn, occupying should (execution that needs to turn back again can reentry process Oper to the car of the station of processrmUCar) quantity and process can be reentried OperrmDThe parallel number of stations M of the maximum for includingDRatio cc, meanwhile, generate range be (0,1) a random number r1
If P2> P1And r1> α indicates the method by generating random number and threshold value comparison size, it is not necessary to step 3.2 Result carry out deviation compensation, then can reentry process OperrmUBuffer area bu residual capacity be not car JDIt is reserved.
If P2> P1And r1≤ α, indicates the method by generating random number and threshold value comparison size, and determination needs step 3.2 result carries out deviation compensation and (as makes up prediction and deviation, J occurnrmDo not enter buffer area bu, process Oper can be reentriedrmU Buffer area bu residual capacity be car JDIt is reserved).
If (car execution of turning back can reentry process Oper when α=1rmDCar on station is needed all to traverse again and can be weighed Enter process), when opening, buffer area dynamic is reserved, it is possible that bus body painting workshop only has car to turn back execution at current time Process Oper can be reentriedrmUThere are residual capacity, other buffer pool sizes to be saturated for place buffer area.Meanwhile on each station There is car.If prediction result there is deviation, the execution that causes to turn back can reentry process OperrmUBuffer area existing for residue Parking stall is occupied from the non-car for reentrying process section, so that the buffer pool size that execution of turning back can reentry process section is equal Reach saturation, then will appear, which can reentry the car of process section, all rests on its current location, and then deadlock situation occurs, such as schemes Shown in 2.Random number r is judged if be added after the prediction result obtained at this time1With the relationship of α, r1Because of the shadow of its value range It rings and it is caused centainly to be less than α, so even if deviation occurs in the prediction result at current time, r1< α also can make car that will turn back The buffer area residual capacity corresponding to process of reentrying executed is bound to as car JDIt is reserved, and then avoid the prediction because of appearance Deadlock situation caused by result error.
Wherein correlation model parameters and variable are provided that
MDIndicate that car execution of turning back can reentry process Operj(j=rmD) the parallel number of stations of maximum;
N indicates online processing car sum;
Indicate t moment, car JiProcess is executed in process flow FLqThe serial number of middle processing sequence, l ∈ 1 ... .., omi};
FLqThe process flow for indicating processing car is production process microbus according to processing flow sequence process processing work The set of sequence;
omiIndicate car JiIn processing flow FLqSum of the microbus Jing Guo manufacturing procedure, counterweight be added with the process of work into Row stored count, omi≥m;
M indicates the total process number of Painting Shop;
Indicate t moment car Ji, in its process flow FLqIt is middle to execute theA process, the process are that can reentry work Sequence OperrmU, in the station WS of the processU, kuOn end process time.
Step 5: according to the judging result of step 3.2 and step 4, it is determined whether executive buffer is that the car reentried is reserved Volume operation.
If showing that the car execution that will turn back can reentry process Oper by step 3.2 and step 4rmUFor the car of reentry Reserved capacity, then from the non-car J for reentrying process sectionnrmProcess section can be reentried by not entering, will not occupy limited buffer Residual capacity, remain in current station, therefore process Oper can be reentriedrmUCorresponding buffering area bu is to receive execution of turning back The car J of process can be reentriedDIt is ready.When production process proceeds to t2When the moment, from process Oper can be reentriedrmDCar JDCan enter can reentry process OperrmUIn corresponding buffer area bu, as shown in Figure 3.
If showing that the car execution that will turn back can reentry process Oper by step 3.2 and step 4rmUIt is not necessarily reentry Car reserved capacity, then from the non-car J for reentrying process sectionnrmInto process Oper can be reentriedrmUCorresponding buffering area bu, such as Shown in Fig. 4.
A kind of limited buffer dynamic capacity in having the bus body painting workshop that can reentry process proposed by the present invention is pre- Stay method flow as shown in Figure 5.
Advantages of the present invention and effect: the car processed on the station of process can be reentried by predicting that car will turn back to execute Change situation, that is, execution of turning back can reentry the release probability of buffer resource corresponding to process, executes during scheduled production The car of process can be reentried by the buffer area dynamic reserved capacity to be entered of turning back, the car that can reentry process will be executed by enabling Enough smoothly turn back enters in limited buffer, is not detained in its current station, so that blocking occurred in the station Probability decline, reducing leads to serious continuous influence of the choking phenomenon to production process because car fights for buffer resource, reduces The probability that deadlock situation occurs in production process, to ensure that bus body painting Workshop Production process can be carried out smoothly.
Detailed description of the invention
Fig. 1 is t moment bus body painting Workshop Production status diagram
Fig. 2 is bus body painting workshop deadlock situation schematic diagram
Fig. 3 is to turn back to execute to reentry the car of process and enter reserved buffer schematic diagram
Fig. 4 is can to reentry process section schematic diagram from the non-car entrance for reentrying process section
Fig. 5 is a kind of limited buffer dynamic capacity method for obligating in having the bus body painting workshop that can reentry process Flow diagram.
Fig. 6 is to meet bus body painting Workshop Production operating status when executing Network with Finite Buffers reservation operations condition to illustrate Figure
Fig. 7 is to turn back to execute the car that can reentry process into the buffer area schematic diagram for executing reservation operations for it
Specific embodiment
Step 1: the Markov state transfer matrix based on bus body painting workshop historical production data is established, for predicting Process corresponding buffering area resource release probability can be reentried, is ready for buffer pool size is reserved.By analyzing bus body painting vehicle Between production history data, process Oper can be reentried by establishing the car execution that will turn back in unit time t '=10j(j=rmU) Each station transition probability matrix Py(y=1...3).
Step 2: judging whether that starting executes limited buffer dynamic capacity method for obligating, having for process can be reentried when having Limit buffer area bus body painting manufacture process proceeds to the t=70 moment, and production run state is as shown in Figure 6.If meet with Lower condition, then execute Network with Finite Buffers reservation operations, and buffer area bu is allowed to be to execute the car reserved capacity that can reentry process.
1. from the non-completion car J for reentrying process sectionnrmTo enter process OperrmUBuffer area bu;
2. t moment process OperrmUBuffer area bu store car numberLess than buffer area bu maximum size BZSU= 2, and
3. car is turned back, execution can reentry production process OperrmUStation be in by car occupied state;
4. production process Oper can be reentriedrmDStation on exist need to traverse the car that can reentry process section again;
5. car execution of turning back can reentry process Oper on the basis of meeting above-mentioned 4 conditionsrmUIn at first complete Car JUCompletion dateLess than process Oper can be reentriedrmDIn the car J that completes at firstDCompletion time t2= 95Then start and executes limited buffer dynamic capacity reservation operations.Such as Fig. 6.
Step 3: it will be turned back by prediction car and execute the situation of change for processing car on the station that can reentry process, i.e., it is slow Area resource release probability is rushed, to judge whether its corresponding buffering area residual capacity is that the car reentried is reserved.
At the t=70 moment, t is predicted by Prediction of Markov method2=95 moment, process OperrmUThe visitor to complete at first Station WS where vehicle JUU, ku=WSU, 1Process the changed probability P of car2(i.e. prediction t2=95 moment buffer area bu resources Discharge probability) and station WSU, 1Processing car does not change, is constantly in the probability P of occupied state1(i.e. prediction t2When=95 Carve the probability that station occupies).
Step 3.1: the car for executing and can reentrying and processing on the station of process of being turned back by calculating car is changed general Rate is obtained in t2=95 moment buffer area bu resources discharge probability.
The probability a of car variation of the t moment in the interior station processing of unit time t ' is calculated by the method for probability statistics2 =0.48.
S0=(0.52,0.48)
al=0.52 indicates that the production process data by analysis since production until t moment, statistics obtain 0 to t In the period at moment, station WSU, kuThe quantity of the upper processing unchanged unit time t ' of car was arrived with 0 in the time of t moment Ratio comprising unit time t ' sum, i.e., in t moment, the interior station of unit time t ' is by the probability that same car occupies 0.52。
a2=0.48 indicates that the production process data by analysis since production until t moment, statistics obtain 0 to t In the period at moment, station WSU, kuThe quantity of unit time t ' that upper processing car changes and packet in 0 to t moment time The ratio of the sum of the t ' containing unit time, i.e., in t moment, the probability that the interior station of unit time t ' is occupied by different cars is 0.48.
S0=(0.58,0.42) indicates in t moment, the probability of the car variation of the interior station processing of unit time t ' to Amount.
Pass through current t=70 moment station WSU, 1The probability vector S of the car variation of upper processing0=(0.52,0.48) according to It calculates according to formula (3) in the following t2=95 moment station WSU, 1The probability vector S of the car variation of upper processingv=(0.54,0.46), According to required result (i.e. t2Moment station WSU, kuThe probability vector S of the car variation of upper processingv=(0.54,0.46)), it obtains Process OperrmUIn the car J to complete at firstUThe station WS at placeU, 1The car of upper processing does not change, is constantly in and accounts for With the probability P of state1=0.54 (i.e. prediction t2=95 moment station WSU, 1The probability of occupancy) and station WSU, 1The car of upper processing Changed probability P2=0.46 (i.e. prediction t2=95 moment buffer area bu resource release rates).Calculate probability vector SvProcess It is as follows:
Find out (P1, P2)=(0.54,0.46).
V=3 indicates t moment to t2It include the sum of unit time t ' to round up in period at moment, wherein t= 70, t2=95, t '=10.
Step 3.2: showing that buffer resource discharges probability and determines that the car execution that will turn back can reentry work by step 3.1 Whether buffer area corresponding to sequence will reserve residual capacity for the car, and detailed process is as follows:
Process Oper can be reentried according to car execution of turning back has been found outrmUThe car J to complete at firstUThe station at place WSU, 1The changed probability P of the car of upper processing2=0.46 (buffer resource release probability) judges the residue of buffer area bu Whether capacity is that can reentry process OperrmDIn the car J that completes at firstDIt is reserved.
If P2≤P1, indicate predicted, work as t2=95 moment, which came from, can reentry process OperrmUAll stations at first The car J of completionUThe station WS at placeU, 1The car of upper processing does not change, and buffer resource is difficult to discharge, then can reentry Process OperrnUThe residual capacity of place buffer area bu is car JDIt is reserved, from the non-car J for reentrying processnrmDo not enter Process section can be reentried, its current station is rested on.
If P2> P1, indicate predicted, work as t2=95 moment, which came from, can reentry process OperrmUAll stations at first The car J of completionUThe station WS at placeU, 1The car of upper processing changes, and buffer resource is easily released.Work as t2When=95 Quarter can reentry process OperrmDIn the car J that completes at firstDWhen being prepared to enter into buffer area bu, buffer area bu has and higher may deposit In residual capacity.Therefore at the t=70 moment, process Oper can be reentriedrmUBuffer area need not reserved capacity, therefore allow from non- The car J of process can be reentriednrmInto process section can be reentried.
Step 4: if deviation occurs in prediction, deadlock situation still may be generated in production process, it is pre- to avoid Deviation compensation measure is added in the appearance for surveying deviation in the result of step 3.2.If step 3.2 show that prediction result allows to come From the non-car for reentrying process into process section can be reentried, then the t=70 moment is calculated, process Oper can be being reentriedrmDIn, it accounts for With the car of the station of the process, (execution that needs to turn back again can reentry process OperrmUCar) quantity be 2, work can be reentried Sequence OperrmDThe parallel number of stations M of the maximum for includingD=3, the ratio of the twoMeanwhile generate range be one of (0,1) with Machine number r1=0.4.
If P2> P1And r1≤ α can then reentry process OperrmUBuffer area bu residual capacity be car JDIt is reserved.
If P2> P1And r1> α can then reentry process OperrmUBuffer area bu residual capacity will not be car JDIn advance It stays.
Step 5: step 5: according to the judging result of step 3.2 and step 4, it is determined whether executive buffer is the visitor reentried The operation of vehicle reserved capacity.
Work Oper can be reentried based on the execution that will turn back of car calculated by step 3.2rmUCorresponding buffering area residual capacity is attached most importance to Reserved result (the P of the car entered2=0.46 < P1=0.54).From the non-car J for reentrying process sectionnrmBeing prohibited from entering can It reentries process section and rests in its current station.Process Oper can be reentriedrmUResidual capacity can reentry process for the execution that will turn back OperrmUCar JDIt is reserved.Production process proceeds to t2=95 moment completed process OperrmDThe car J of processingDIt turns back entrance Process Oper can be reentriedrmUIn corresponding buffer area bu, as shown in Figure 7.

Claims (5)

1.一种在具有可重入工序的客车涂装车间中有限缓冲区动态容量预留方法,其特征在于:所述方法依次含有以下步骤为:1. a method for reserving dynamic capacity of limited buffer zone in the paint shop for passenger cars with re-entry operation, it is characterized in that: described method contains the following steps successively: 步骤1:建立基于客车涂装车间历史生产数据的马尔科夫状态转移矩阵,用于预测可重入工序OperrmU所对应缓冲区bu资源释放概率,为缓冲区容量预留做好准备;Step 1: Establish a Markov state transition matrix based on the historical production data of the bus painting workshop, which is used to predict the release probability of the buffer bu resource corresponding to the re-entrant process Oper rmU , and prepare for the buffer capacity reservation; 步骤2:判断是否启动执行有限缓冲区动态容量预留方法,当具有可重入工序的有限缓冲区客车涂装车间生产过程进行到t时刻,如果符合条件,则执行步骤3.1,计算缓冲区资源释放概率;如果不满足上述条件,则无需执行有限缓冲区容量预留方法后续的操作;Step 2: Determine whether to start and execute the limited buffer dynamic capacity reservation method. When the production process of the limited buffer bus painting workshop with re-entrant processes reaches time t, if the conditions are met, step 3.1 is executed to calculate the buffer resources. Release probability; if the above conditions are not met, there is no need to perform subsequent operations of the limited buffer capacity reservation method; 步骤3:通过预测客车将折返执行可重入工序的工位上加工客车的变化情况,即缓冲区资源释放概率,来判断其对应缓冲区剩余容量是否为重入的客车预留;Step 3: Determine whether the remaining capacity of the corresponding buffer zone is reserved for the re-entrant passenger car by predicting the change of the passenger car processing at the station where the passenger car will return to the re-entry process, that is, the buffer resource release probability; 步骤3.1:通过计算客车折返执行可重入工序的工位上加工的客车发生变化的概率,得到在未来t2时刻缓冲区bu资源释放概率;Step 3.1: By calculating the probability of the change of the bus processed at the station where the bus returns to the re-entrant process, the release probability of the buffer bu resource at time t 2 in the future is obtained; 步骤3.2:通过步骤3.1得出缓冲区资源释放概率来确定客车将折返执行可重入工序所对应的缓冲区是否要为该客车预留剩余容量,Step 3.2: Through step 3.1, the buffer resource release probability is obtained to determine whether the passenger car will return to the buffer corresponding to the re-entrant process to reserve the remaining capacity for the passenger car, 步骤4:判断是否需要在步骤3.2的结果上加入偏差补偿措施;Step 4: Determine whether it is necessary to add deviation compensation measures to the results of Step 3.2; 步骤5:根据步骤3.2和步骤4的判断结果,确定是否执行缓冲区为重入的客车预留容量操作。Step 5: According to the judgment results of Step 3.2 and Step 4, determine whether to perform the operation of reserving the buffer capacity for the re-entrant passenger car. 2.根据权利要求1所述一种在具有可重入工序的客车涂装车间中有限缓冲区动态容量预留方法,其特征在于:通过分析客车涂装车间的生产历史数据,建立在单位时间t′内客车将折返执行可重入工序Operj(j=rmU)的各工位转移概率矩阵Py(y=1…MU)。其中2. a kind of limited buffer dynamic capacity reservation method in the passenger car paint shop with re-entry process according to claim 1, is characterized in that: by analyzing the production history data of the passenger car paint shop, based on the unit time In t', the passenger car will return to each station transition probability matrix P y (y=1...M U ) to execute the re-entrant process Oper j (j=rmU). in 表示在单位时间t′的开始时刻,工位WSU,ku上加工的客车未发生变化,但是经过单位时间t′之后,工位上加工的客车未改变的概率; Represents the probability that at the beginning of the unit time t', the passenger cars processed on the stations WS U and ku have not changed, but after the unit time t', the passenger cars processed on the stations have not changed; 表示在单位时间t′的开始时刻,工位WSU,ku上加工的客车未发生变化,但是经过单位时间t′之后,工位上加工的客车改变的概率; Indicates that at the beginning of the unit time t', the bus processed on the stations WS U, ku does not change, but after the unit time t', the probability that the bus processed on the station changes; 表示在单位时间t′的开始时刻,工位WSU,ku上加工的客车发生变化,但是经过单位时间t′之后,工位上加工的客车未改变的概率; Represents the probability that at the beginning of the unit time t', the buses processed at the stations WS U, ku change, but after the unit time t', the buses processed at the stations remain unchanged; 表示在单位时间t′的开始时刻,工位WSU,ku上加工的客车发生变化,但是经过单位时间t′之后,工位上加工的客车改变的概率; Indicates that at the beginning of unit time t', the bus processed on the station WS U, ku changes, but after the unit time t', the probability of the bus processed on the station changes; MU表示客车折返执行的可重入工序Operj(j=rmU)的最大并行工位数;M U represents the maximum number of parallel stations of the re-entrant process Oper j (j=rmU) performed by the passenger car turn-back; 表示在单位时间t′的开始时刻,该工位加工客车未发生或者发生变化的情况下,经过单位时间t′之后,工位上加工的客车改变,即在单位时间t′内必定出现工位空闲使得存放在可重入工序OperrmU所对应缓冲区bu中的客车能够进入该工位进行加工,同时,缓冲区资源释也随之释放。因此,可以看作在不同情况下,单位时间t′内缓冲区资源释放概率。 and Indicates that at the beginning of the unit time t', if the processing of the passenger car at the station does not occur or changes, after the unit time t', the passenger car processed at the station changes, that is, the station must appear within the unit time t'. Idle allows the bus stored in the buffer bu corresponding to the reentrant process Oper rmU to enter the station for processing, and at the same time, the buffer resources are also released. Therefore, it can be regarded as the release probability of buffer resources within unit time t' under different circumstances. 3.根据权利要求1所述一种在具有可重入工序的客车涂装车间中有限缓冲区动态容量预留方法,其特征在于:当具有可重入工序的有限缓冲区客车涂装车间生产过程进行到t时刻,生产运行状态如图1所示,如果符合以下条件,则执行步骤3,计算缓冲区资源释放概率;3. a kind of limited buffer dynamic capacity reservation method in the passenger car paint shop with re-entry procedure according to claim 1, is characterized in that: when the limited buffer zone passenger car paint shop with re-entry procedure is produced When the process reaches time t, the production operation status is shown in Figure 1. If the following conditions are met, step 3 is performed to calculate the buffer resource release probability; 在t时刻,来自非可重入工序段的完工客车Jnrm要进入工序OperrmU的缓冲区bu; At time t, the completed passenger car J nrm from the non-reentrant process section will enter the buffer bu of the process Oper rmU ; 在t时刻,工序OperrmU的缓冲区bu存放客车数小于缓冲区bu容量上限BZSU,且即在t时刻,工序OperrmU的缓冲区剩余容量只能存放一个工件; At time t, the buffer bu of the process Oper rmU stores the number of passenger cars is less than the upper limit of buffer bu capacity BZS U , and That is, at time t, the remaining capacity of the buffer of the process Oper rmU can only store one workpiece; 在t时刻,客车折返执行可重入生产工序OperrmU的工位均处于被占用状态; At time t, the stations where the bus returns to perform the re-entrant production process Oper rmU are all occupied; 在t时刻,可重入工序OperrmD的工位上存在需要再次遍历可重入工序段的客车; At time t, there is a bus that needs to traverse the re-entrant process section again on the station of the re-entrant process Oper rmD ; 在满足上述4个条件的基础上,如果可重入工序OperrmU的工位上最先完工的客车JU的完工时间小于可重入生产工序OperrmD中最先完工的客车JD的完工的时间t2,则执行有限缓冲区容量预留方法后续的操作。 On the basis of satisfying the above 4 conditions, if the re-entry process Oper rmU station is the first completed bus JU , the completion time If it is less than the completion time t 2 of the first completed passenger car J D in the reentrant production process Oper rmD , the subsequent operations of the limited buffer capacity reservation method are performed. 4.根据权利要求1所述一种在具有可重入工序的客车涂装车间中有限缓冲区动态容量预留方法,其特征在于:在t时刻,通过马尔科夫预测法预测t2时刻,可重入工序OperrmU的并行工位上的最先完工的客车JU所在工位WSU,ku上加工的客车发生变化的概率P2(即预测t2时刻工位WSU,ku加工不同客车的概率)与工位WSU,ku上加工客车未发生变化,一直处于被同一辆客车占用状态的概率P1。假设t2时刻工位WSU,ku加工不同客车,可知在t2时刻之前,存放在可重入工序OperrmU对应缓冲区bu中客车进入可重入工序OperrmU的工位WSU,ku中,则缓冲区资源也随之释放,在t2时刻可重入工序OperrmD中最先完工的客车JD准备进入缓冲区bu时,缓冲区bu存在剩余容量。因此,WSU,ku加工不同客车的概率P2等价于缓冲区bu资源释放的概率。通过求得预测t2时刻工位WSU,ku加工不同客车的概率P2进而获取缓冲区bu资源释放的概率(即t2时刻,工位WSU,ku加工不同客车概率P2),进而动态判断缓冲区bu剩余容量是否为客车JD预留,降低因客车Jnrm与JD间争夺缓冲区资源而产生死锁现象的概率,4. a kind of limited buffer dynamic capacity reservation method in a passenger car paint shop with re-entry procedure according to claim 1, is characterized in that: at time t, time t 2 is predicted by Markov prediction method, The probability P 2 that the bus J U that is first completed on the parallel station of the re-entrant process Oper rmU is located at the station WS U, and the probability P 2 of the bus processed on ku changes (that is, it is predicted that the processing of stations WS U and ku will be different at time t 2 ) The probability of the passenger car) and the station WS U, ku processing the passenger car have not changed, the probability P 1 has been in the state of being occupied by the same passenger car. Assuming that the stations WS U and ku process different passenger cars at time t 2 , it can be known that before time t 2 , the passenger cars stored in the buffer bu corresponding to the re-entrant process Oper rmU enter the stations WS U, ku of the re-entrant process Oper rmU . , the buffer resources are also released accordingly. When the first completed passenger car JD in the re-entry process Oper rmD is ready to enter the buffer bu at time t2 , the buffer bu has remaining capacity. Therefore, the probability P 2 of WS U, ku processing different passenger cars is equivalent to the probability of the release of the buffer bu resources. By obtaining and predicting the probability P 2 of processing different passenger cars at the stations WS U and ku at the time of t 2 , the probability of releasing the buffer bu resources is obtained (that is, at t 2 , the probability P 2 of processing different passenger cars at the stations WS U and ku ), and then Dynamically determine whether the remaining capacity of the buffer bu is reserved for the passenger car J D , reducing the probability of deadlock caused by the competition between the passenger car J nrm and J D for buffer resources, 通过概率统计的方法计算t时刻在单位时间t′内该工位加工的客车变化的概率a2Calculate the probability a 2 of the bus processed by the station within the unit time t' at time t by means of probability statistics, S0=(a1,a2),(a1+a2=1) (2)S 0 =(a 1 , a 2 ), (a 1 +a 2 =1) (2) 式(2)中a1表示通过分析从生产开始到t时刻为止的生产过程数据,统计得出0到t时刻的时间段内,工位WSU,ku上加工客车未改变的单位时间t′的数量与0到t时刻的时间内包含单位时间t′总数的比值,即在t时刻,单位时间t′内工位被同一客车占用的概率。In formula (2), a 1 indicates that by analyzing the production process data from the start of production to time t, statistics can be obtained from 0 to time t, the unit time t' that the passenger car is processed on the station WS U, ku does not change. The ratio of the number of t to the total number of times t' including unit time t', that is, at time t, the probability that the station is occupied by the same bus in unit time t'. 式(2)中a2表示通过分析从生产开始到t时刻为止的生产过程数据,统计得出0到t时刻的时间段内,工位WSU,ku上加工客车改变的单位时间t′的数量与0到t时刻的时间内包含单位时间t′总数的比值,即在t时刻,单位时间t′内工位被不同客车占用的概率。In formula (2), a 2 indicates that by analyzing the production process data from the start of production to time t, it is statistically obtained that in the time period from 0 to time t, the unit time t' for the processing of passenger cars on stations WS U, ku changes. The ratio of the number to the total number of unit time t' included in the time from 0 to time t, that is, at time t, the probability that the station is occupied by different passenger cars within the unit time t'. S0表示在t时刻,单位时间t′内该工位上加工的客车变化的概率向量,S 0 represents the probability vector of the change of the passenger cars processed at the station in unit time t' at time t, 通过当前t时刻工位WSU,ku上加工的客车变化的概率向量S0依据式(3)计算在未来t2时刻工位WSU,ku上加工的客车变化的概率向量Sv,根据所求结果(即在t2时刻工位WSU,ku上加工的客车变化的概率向量Sv)获取工序OperrmU中最先完工的客车JU所在的工位WSU,ku上加工的客车未发生变化,一直处于占用状态的概率P1(即预测t2时刻,工位WSU,ku占用的概率)与工位WSU,ku上加工的客车发生变化的概率P2(即预测t2时刻,工序OperrmU的缓冲区资源释放概率),Through the probability vector S 0 of the change of the passenger car processed on the station WS U, ku at the current time t, according to formula (3), the probability vector S v of the change of the passenger car processed on the station WS U, ku at time t 2 in the future is calculated. Obtain the result (that is, the probability vector S v of the change of the passenger car processed on the station WS U, ku at time t 2 ) to obtain the station WS U of the first completed passenger car JU in the process Oper rmU , and the passenger car processed on the ku is not yet. The probability P 1 that has been in the occupied state (that is, the probability that the station WS U, ku is occupied at time t 2 ) and the probability P 2 of the passenger car processed on the station WS U, ku are changed (that is, the probability of predicting t 2 time, the buffer resource release probability of the process Oper rmU ), 式(3)中v表示t到t2时刻的时间内包含单位时间t′的总数,In formula (3), v represents the total number of unit time t' included in the time from t to t2, 根据得出缓冲区资源释放概率来确定客车将折返执行可重入工序所对应的缓冲区是否要为该客车预留剩余容量,具体过程如下:According to the obtained buffer resource release probability, it is determined whether the buffer corresponding to the reentrant process of the bus will be turned back to reserve the remaining capacity for the bus. The specific process is as follows: 根据已求出客车折返执行可重入工序OperrmU的最先完工的客车JU所在的工位WSU,ku的加工客车发生变化的概率(缓冲区资源释放概率)判断缓冲区bu的剩余容量是否为可重入工序OperrmD中最先完工的客车JD预留。The remaining capacity of the buffer bu is determined according to the probability that the processing passenger car WS U and ku of the first completed passenger car JU that has been turned back to perform the re-entrant process Oper rmU are located. Whether it is reserved for the first completed passenger car JD in the re-entrant process Oper rmD . 如果P2≤P1,t2时刻工位WSU,ku加工不同客车的概率较低,在t2时刻之前缓冲区bu存放客车进入可重入工序OperrmU工位WSU,ku的概率较低,缓冲区资源难以释放,如果缓冲区bu允许客车Jnrm进入,抢占缓冲区bu唯一资源,导致重入客车JD客车与来自非可重入工序段的客车Jnrm竞争缓冲区资源失败而停留在其当前工位,引起阻塞现象的发生。如果JD所在可重入工序OperrmD其他工位加工的客车全部需要折返执行可重入工序OperrmU,则会引起连续阻塞现象的发生,进而引发死锁现象(如2所示)。与JD间争夺缓冲区资源而引发死锁现象,如图2所示,因此,可重入工序OperrmU所在缓冲区bu的剩余容量为客车JD预留,同时,来自非可重入工序的客车Jnrm被禁止进入可重入工序段。If P 2 ≤ P 1 , the probability of processing different passenger cars at the stations WS U, ku at time t 2 is relatively low, and the probability that the passenger cars are stored in the buffer bu before the time t 2 enters the re-entrant process Oper rmU station WS U, ku is relatively high. If the buffer is low, it is difficult to release the buffer resources. If the buffer bu allows the passenger car J nrm to enter, it will preempt the only resource of the buffer bu, resulting in the reentrant passenger car J D and the passenger car J nrm from the non-reentrant process segment competing for buffer resources and failing. stay in its current position, causing the occurrence of blocking phenomenon. If all the passenger cars processed by the re-entrant process Oper rmD where J D is located need to be turned back to perform the re-entrant process Oper rmU , it will cause continuous blocking and lead to deadlock phenomenon (as shown in 2). As shown in Figure 2, the deadlock is caused by competing for buffer resources with J D. Therefore, the remaining capacity of the buffer bu where the reentrant process Oper rmU is located is reserved for the passenger car J D. At the same time, it comes from the non-reentrant process. The passenger car J nrm is prohibited from entering the re-entrant process section. 如果P2>P1,表示经预测,t2时刻工位WSU,ku加工不同客车的概率较高,在t2时刻之前缓冲区bu存放客车进入可重入工序OperrmU工位WSU,ku的概率较高,缓冲区资源易得到释放。当t2时刻可重入工序OperrmD中最先完工的客车JD准备进入缓冲区bu时,缓冲区bu有较高的可能存在剩余容量。故在t时刻,可重入工序OperrmU的缓冲区不必预留容量,因此允许来自非可重入工序的客车Jnrm进入可重入工序段。If P 2 >P 1 , it means that it is predicted that the probability of processing different passenger cars at the stations WSU and ku at time t2 is relatively high. Before time t2 , the buffer bu stores the passenger cars and enters the re-entry process Oper rmU station WSU , The probability of ku is high, and the buffer resources are easily released. When the first completed passenger car J D in the re-entrant process Oper rmD is ready to enter the buffer bu at time t 2 , the buffer bu has a high possibility of remaining capacity. Therefore, at time t, the buffer of the re-entrant process Oper rmU does not need to reserve capacity, so the passenger car J nrm from the non-re-entrant process is allowed to enter the re-entrant process section. 5.根据权利要求1所述一种在具有可重入工序的客车涂装车间中有限缓冲区动态容量预留方法,其特征在于:如果预测出现偏差(即预测缓冲区bu资源释放概率偏差,导致Jnrm进入缓冲区bu,抢占唯一资源,导致生产过程当中依旧可能会产生死锁现象),为避免预测偏差的出现,根据t时刻可重入工序OperrmD全部工位被需折返执行可重入工序OperrmU的重入客车占用率设置阈值α,在步骤3.2的结果上加入偏差补偿措施。如果步骤3.2得出预测结果允许来自非可重入工序的客车进入可重入工序段,则计算t时刻,在可重入工序OperrmD中,占用该工序的工位的客车(需要再次折返执行可重入工序OperrmU的客车)数量与可重入工序OperrmD包含的最大并行工位数MD的比值α,同时,产生范围为(0,1)的一个随机数r15. a kind of limited buffer dynamic capacity reservation method in the passenger car paint shop with re-entrant operation according to claim 1 is characterized in that: if the prediction occurs deviation (i.e. prediction buffer bu resource release probability deviation, Causes J nrm to enter the buffer bu, preempting the only resource, which may lead to deadlock phenomenon in the production process), in order to avoid the occurrence of prediction deviation, according to the time t, the re-entry process Oper rmD all stations are required to return to the execution and can be repeated. The threshold α is set for the occupancy rate of the re-entry bus in the entry process Oper rmU , and the deviation compensation measures are added to the results of step 3.2. If the prediction result obtained in step 3.2 allows the passenger car from the non-reentrant process to enter the re-entrant process section, then calculate the time t, in the re-entrant process Oper rmD , the passenger car occupying the station of the process (need to be re-entered to execute The ratio α of the number of passenger cars of the reentrant process Oper rmU ) to the maximum number of parallel stations MD contained in the reentrant process Oper rmD , and at the same time, a random number r 1 in the range of (0, 1) is generated. 如果P2>P1且r1>α,表示通过产生随机数与阈值比较大小的方法,不必对步骤3.2的结果进行偏差补偿,则可重入工序OperrmU的缓冲区bu剩余容量不为客车JD预留。If P 2 >P 1 and r 1 >α, it means that by generating a random number and comparing the size of the threshold, it is not necessary to perform deviation compensation on the result of step 3.2, and the remaining capacity of the buffer bu of the re-entry process Oper rmU is not a passenger car J D reserved. 如果P2>P1且r1≤α,表示通过产生随机数与阈值比较大小的方法,确定需要步骤3.2的结果进行偏差补偿(即为弥补预测出现偏差,Jnrm不进入缓冲区bu,可重入工序OperrmU的缓冲区bu剩余容量为客车JD预留)。If P 2 >P 1 and r 1 ≤α, it means that by generating a random number and comparing the size of the threshold, it is determined that the result of step 3.2 needs to be compensated for deviation (that is, in order to compensate for the deviation of the prediction, J nrm does not enter the buffer bu, it can be The remaining capacity of the buffer bu of the re-entry process Oper rmU is reserved for the passenger car J D ). 若α=1时(即客车折返执行可重入工序OperrmD工位上的客车需全部再次遍历可重入工序),当开启缓冲区动态预留,可能会出现客车涂装车间在当前时刻只有客车折返执行可重入工序OperrmU所在缓冲区存在剩余容量,其他缓冲区容量已经饱和。同时,各工位上均有客车。如果的预测结果出现偏差,导致折返执行可重入工序OperrmU的缓冲区存在的剩余车位被来自非可重入工序段的客车占用,从而使得折返执行可重入工序段的缓冲区容量均达到饱和,则会出现可重入工序段的客车全部停留在其当前位置,进而出现死锁现象,如图2所示。此时如果在得出的预测结果之后加入判断随机数r1与α的关系,r1因其取值范围的影响而导致其一定小于α,所以即使当前时刻的预测结果出现偏差,r1<α也会使客车将折返执行的可重入工序所对应缓冲区剩余容量一定会为客车JD预留,进而避免了因出现的预测结果偏差而导致的死锁现象。If α=1 (that is, when the bus is turned back to execute the re-entrant process, all the buses at the Oper rmD station need to traverse the re-entrant process again), when the buffer dynamic reservation is enabled, it may happen that the bus paint shop has only There is remaining capacity in the buffer where the reentrant process Oper rmU is located, and the capacity of other buffers is saturated. At the same time, there are buses at each station. If there is a deviation in the predicted result, the remaining parking spaces in the buffer of the reentrant operation Oper rmU will be occupied by the passenger cars from the non-reentrant operation section, so that the buffer capacity of the reentrant operation section will reach If it is saturated, the passenger cars that can re-enter the process section will all stay at their current positions, and then a deadlock phenomenon will occur, as shown in Figure 2. At this time, if the relationship between the random number r 1 and α is added after the obtained prediction result, r 1 must be smaller than α due to the influence of its value range, so even if the prediction result at the current moment is deviated, r 1 < α will also make the remaining capacity of the buffer corresponding to the re-entrant process that the passenger car will perform by turning back to be reserved for the passenger car JD , thereby avoiding the deadlock phenomenon caused by the deviation of the predicted results. 其中相关模型参数和变量设置如下:The relevant model parameters and variables are set as follows: MD表示客车折返执行可重入工序Operj(j=rmD)的最大并行工位数;MD represents the maximum number of parallel stations for the reentrant process Oper j (j= rmD ) performed by the passenger car turning back; n表示上线加工客车总数;n represents the total number of on-line processing buses; li t表示t时刻,客车Ji执行工序在工艺流程FLq中加工顺序的序号,l∈{1,.....,omi};l i t represents the sequence number of the processing sequence in the process flow FL q of the passenger car J i at time t, l∈{1,.....,om i }; FLq表示加工客车的工艺流程,是生产过程中客车按照工艺流程顺序经过加工工序的集合;FL q represents the technological process of processing passenger cars, which is a collection of processing procedures that passenger cars go through in the order of the technological process during the production process; omi表示客车Ji在加工流程FLq中客车经过加工工序的总数,对重复加工的工序进行累计计数,omi≥m;om i represents the total number of processing steps of the passenger car J i in the processing flow FL q , and counts the repeated processing steps cumulatively, om i ≥ m; m表示涂装车间总工序数;m represents the total number of processes in the painting workshop; 表示t时刻客车Ji,在其工艺流程FLq中执行第个工序,该工序为可重入工序OperrmU,在该工序的工位WSU,ku上的结束加工时间。 Indicates that the passenger car J i at time t performs the first step in its technological process FL q A process, this process is a re-entrant process Oper rmU , the end processing time on the work station WS U, ku of this process.
CN201910026384.7A 2019-01-11 2019-01-11 A Dynamic Capacity Reservation Method for Limited Buffers in a Passenger Car Paint Shop with Reentrant Processes Pending CN109767118A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910026384.7A CN109767118A (en) 2019-01-11 2019-01-11 A Dynamic Capacity Reservation Method for Limited Buffers in a Passenger Car Paint Shop with Reentrant Processes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910026384.7A CN109767118A (en) 2019-01-11 2019-01-11 A Dynamic Capacity Reservation Method for Limited Buffers in a Passenger Car Paint Shop with Reentrant Processes

Publications (1)

Publication Number Publication Date
CN109767118A true CN109767118A (en) 2019-05-17

Family

ID=66453823

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910026384.7A Pending CN109767118A (en) 2019-01-11 2019-01-11 A Dynamic Capacity Reservation Method for Limited Buffers in a Passenger Car Paint Shop with Reentrant Processes

Country Status (1)

Country Link
CN (1) CN109767118A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111311006A (en) * 2020-02-21 2020-06-19 河海大学常州校区 Reentry Bernoulli production system state prediction and production energy-saving scheduling method
CN116777192A (en) * 2023-08-23 2023-09-19 成都飞机工业(集团)有限责任公司 Dynamic scheduling method for assembly production line

Citations (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04352070A (en) * 1991-05-29 1992-12-07 Oki Electric Ind Co Ltd Reentering processing method
US5706200A (en) * 1996-08-15 1998-01-06 The Board Of Trustees Of The University Of Il. Scheduling system and scheduling method for reentrant line processes
JP2003241804A (en) * 2002-02-15 2003-08-29 Canon Inc Buffer control method
US20040034556A1 (en) * 1994-09-01 2004-02-19 Matheson William L. Scheduling system and method
US20070204226A1 (en) * 2006-02-28 2007-08-30 Palo Alto Research Center Incorporated. System and method for manufacturing system design and shop scheduling using network flow modeling
JP2012083828A (en) * 2010-10-07 2012-04-26 Yamatake Corp Project process management system and load leveling method
JP2012232408A (en) * 2011-05-05 2012-11-29 Fanuc Robotics America Corp Method and system for automatically preventing deadlock in multi-robot system
US20120323827A1 (en) * 2011-06-15 2012-12-20 International Business Machines Corporation Generating Predictions From A Probabilistic Process Model
CN102929263A (en) * 2012-11-16 2013-02-13 北京理工大学 A Hybrid Flow Shop Scheduling Method
JP2013054703A (en) * 2011-09-06 2013-03-21 Toyota Motor East Japan Inc Work support system
CN103136631A (en) * 2013-01-22 2013-06-05 安徽工程大学 Batch scheduling method achieving minimum total completion time based on product family sorting
CN103440393A (en) * 2013-09-18 2013-12-11 江苏大学 State space reduction method for continuous time Markov chain
CN103699104A (en) * 2013-12-30 2014-04-02 苏州大学 Deadlock avoidance control method and device as well as automatic production system
US20140172329A1 (en) * 2012-12-17 2014-06-19 Junshan Zhang System and method for wind generation forecasting
CN103927689A (en) * 2014-05-06 2014-07-16 安徽工程大学 Dispatching control method for batch processor of reentrant manufacturing system
CN104270796A (en) * 2014-10-23 2015-01-07 湘潭大学 Data collection method for selecting sink path based on Markov model
CN104751297A (en) * 2015-04-20 2015-07-01 海安县申菱电器制造有限公司 Productivity allocation method for mixed-model production line
US9342063B1 (en) * 2013-09-19 2016-05-17 Amazon Technologies, Inc. Determining capacities of work buffers
CN106454937A (en) * 2016-09-29 2017-02-22 东南大学 Distribution control method for caching space of mobile terminal
EP3139318A1 (en) * 2015-09-04 2017-03-08 Siemens Aktiengesellschaft Patch management for industrial control systems
US20170236065A1 (en) * 2014-08-20 2017-08-17 Cassantec Ag Malfunction prediction for components and units of technical entities
CN107944695A (en) * 2017-11-21 2018-04-20 电子科技大学 One kind is based on the probabilistic chaining key setting buffers method of production
CN108197839A (en) * 2018-02-11 2018-06-22 沈阳建筑大学 A kind of railway car manufacture workshop scheduled production method with routing cache area

Patent Citations (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04352070A (en) * 1991-05-29 1992-12-07 Oki Electric Ind Co Ltd Reentering processing method
US20040034556A1 (en) * 1994-09-01 2004-02-19 Matheson William L. Scheduling system and method
US5706200A (en) * 1996-08-15 1998-01-06 The Board Of Trustees Of The University Of Il. Scheduling system and scheduling method for reentrant line processes
JP2003241804A (en) * 2002-02-15 2003-08-29 Canon Inc Buffer control method
US20070204226A1 (en) * 2006-02-28 2007-08-30 Palo Alto Research Center Incorporated. System and method for manufacturing system design and shop scheduling using network flow modeling
JP2012083828A (en) * 2010-10-07 2012-04-26 Yamatake Corp Project process management system and load leveling method
JP2012232408A (en) * 2011-05-05 2012-11-29 Fanuc Robotics America Corp Method and system for automatically preventing deadlock in multi-robot system
US20120323827A1 (en) * 2011-06-15 2012-12-20 International Business Machines Corporation Generating Predictions From A Probabilistic Process Model
JP2013054703A (en) * 2011-09-06 2013-03-21 Toyota Motor East Japan Inc Work support system
CN102929263A (en) * 2012-11-16 2013-02-13 北京理工大学 A Hybrid Flow Shop Scheduling Method
US20140172329A1 (en) * 2012-12-17 2014-06-19 Junshan Zhang System and method for wind generation forecasting
CN103136631A (en) * 2013-01-22 2013-06-05 安徽工程大学 Batch scheduling method achieving minimum total completion time based on product family sorting
CN103440393A (en) * 2013-09-18 2013-12-11 江苏大学 State space reduction method for continuous time Markov chain
US9342063B1 (en) * 2013-09-19 2016-05-17 Amazon Technologies, Inc. Determining capacities of work buffers
CN103699104A (en) * 2013-12-30 2014-04-02 苏州大学 Deadlock avoidance control method and device as well as automatic production system
CN103927689A (en) * 2014-05-06 2014-07-16 安徽工程大学 Dispatching control method for batch processor of reentrant manufacturing system
US20170236065A1 (en) * 2014-08-20 2017-08-17 Cassantec Ag Malfunction prediction for components and units of technical entities
CN104270796A (en) * 2014-10-23 2015-01-07 湘潭大学 Data collection method for selecting sink path based on Markov model
CN104751297A (en) * 2015-04-20 2015-07-01 海安县申菱电器制造有限公司 Productivity allocation method for mixed-model production line
EP3139318A1 (en) * 2015-09-04 2017-03-08 Siemens Aktiengesellschaft Patch management for industrial control systems
CN106454937A (en) * 2016-09-29 2017-02-22 东南大学 Distribution control method for caching space of mobile terminal
CN107944695A (en) * 2017-11-21 2018-04-20 电子科技大学 One kind is based on the probabilistic chaining key setting buffers method of production
CN108197839A (en) * 2018-02-11 2018-06-22 沈阳建筑大学 A kind of railway car manufacture workshop scheduled production method with routing cache area

Non-Patent Citations (8)

* Cited by examiner, † Cited by third party
Title
MENG FU,ETC: "Whale Optimization Algorithm for Flexible Flow Shop Scheduling with Setup Times", 《THE 9TH INTERNATIONAL CONFERENCE ON MODELLING, IDENTIFICATION AND CONTROL》 *
YANG CAO,ETC: "Application of ACOTS Hybrid Algorithm for Job Shop Scheduling Problems", 《PROCEEDINGS OF 2012 INTERNATIONAL CONFERENCE ON MODELING,IDENTIFICATION AND CONTROL》 *
王利存等: "连续时间可重入生产系统调度策略灵敏度分析", 《计算机集成制造系统-CIMS》 *
王颖等: "基于神经元动态规划的可重入生产系统调度的仿真框架", 《信息与控制》 *
郑应平等: "可重入生产系统的QBD型模型", 《自动化学报》 *
韩忠华,等: "《具有容量限制的缓冲区排产系统最优策略研究》", 东北大学出版社 *
韩忠华,等: "可重入混合流水车间负荷平衡排产优化问题研究", 《高技术通信》 *
韩忠华等: "客车生产中可重入倒排产应用研究", 《沈阳建筑大学学报(自然科学版)》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111311006A (en) * 2020-02-21 2020-06-19 河海大学常州校区 Reentry Bernoulli production system state prediction and production energy-saving scheduling method
CN111311006B (en) * 2020-02-21 2022-08-16 河海大学常州校区 State prediction and production energy-saving scheduling method for reentry Bernoulli production system
CN116777192A (en) * 2023-08-23 2023-09-19 成都飞机工业(集团)有限责任公司 Dynamic scheduling method for assembly production line
CN116777192B (en) * 2023-08-23 2023-12-08 成都飞机工业(集团)有限责任公司 Dynamic scheduling method for assembly production line

Similar Documents

Publication Publication Date Title
WO2022116830A1 (en) Elevator-taking control method and device for robot, robot and medium
WO2023082378A1 (en) Anti-deadlock dispatching method for oht system
US8019468B2 (en) Transport system and transport method
US8121724B2 (en) Transfer system, and transfer method
CN109767118A (en) A Dynamic Capacity Reservation Method for Limited Buffers in a Passenger Car Paint Shop with Reentrant Processes
CN102264620B (en) Method and device for managing/controlling group of elevators
CN110009259A (en) A multi-AGV scheduling method applied to flexible manufacturing workshop under bidirectional path
EP1055633A1 (en) Elevator group control apparatus and elevator group control method
CN110789390A (en) Rail-mounted mobile charging system and scheduling control method thereof
JP2007521213A (en) Method and elevator scheduler for scheduling a plurality of cars in an elevator system in a building
CN111633655A (en) A Distributed Autonomous Mobile Robot Traffic Scheduling Method
CN113205277B (en) Workshop production and crown block cooperative scheduling method and device based on space-time rule
CN111242561A (en) Simulation optimization model applied to steelmaking-continuous casting process in steel industry
CN109839928A (en) Unmanned vehicle and its remote anti-head-on collision methods, devices and systems
JP4847190B2 (en) Elevator group management control system and group management control method
CN116777126A (en) Crown block transportation scheduling method based on multi-layer AMHS system
CN108093485A (en) A kind of resource allocation methods and device
EP3210920A1 (en) Elevator system including dynamic elevator car call scheduling
CN110077924A (en) Group management control apparatus and group management control method
Singh et al. Experimental investigation for performance assessment of scheduling policies in semiconductor wafer fabrication—a simulation approach
CN118876045B (en) A collaborative scheduling method for heterogeneous robot systems with diverse components
CN111915185B (en) A spatiotemporal crowdsourcing task assignment method and device based on path planning strategy
CN114153187A (en) Optimized scheduling method, storage medium and equipment for flexible production
CN106603215B (en) ZigBee-based non-fair network channel resource sharing method
Nikovski et al. Exact calculation of expected waiting times for group elevator control

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