CN114970973A - Production process dispatching method and system - Google Patents

Production process dispatching method and system Download PDF

Info

Publication number
CN114970973A
CN114970973A CN202210481949.2A CN202210481949A CN114970973A CN 114970973 A CN114970973 A CN 114970973A CN 202210481949 A CN202210481949 A CN 202210481949A CN 114970973 A CN114970973 A CN 114970973A
Authority
CN
China
Prior art keywords
station
path
task
track
carrier
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
CN202210481949.2A
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.)
Shanghai Sharetek Technology Co Ltd
Original Assignee
Shanghai Sharetek Technology Co Ltd
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 Shanghai Sharetek Technology Co Ltd filed Critical Shanghai Sharetek Technology Co Ltd
Priority to CN202210481949.2A priority Critical patent/CN114970973A/en
Publication of CN114970973A publication Critical patent/CN114970973A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K17/00Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
    • G06K17/0022Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations arrangements or provisious for transferring data to distant stations, e.g. from a sensing device
    • G06K17/0025Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations arrangements or provisious for transferring data to distant stations, e.g. from a sensing device the arrangement consisting of a wireless interrogation device in combination with a device for optically marking the record carrier
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N20/00Machine learning
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316Sequencing of tasks or work
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0633Workflow analysis
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04Manufacturing
    • 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

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Theoretical Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Game Theory and Decision Science (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • General Engineering & Computer Science (AREA)
  • Educational Administration (AREA)
  • Software Systems (AREA)
  • Artificial Intelligence (AREA)
  • Primary Health Care (AREA)
  • Manufacturing & Machinery (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • Medical Informatics (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Mathematical Physics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)

Abstract

The application discloses a method and a system for dispatching production procedures, wherein the method comprises the following steps: constructing task types, wherein each work station respectively and independently comprises a plurality of task types, each task type corresponds to one task, and the task type of each work station is associated with an assembly instruction of a corresponding work station; generating a planned track path for a carrier corresponding to a plurality of products to be assembled to reach a target station from a current position based on the task type; controlling a plurality of vehicles to travel on their respective planned track paths; when the carrier moves to a joint point, the code scanning device scans codes to acquire the identifier and the position of the carrier; and if the identifier and the position acquired by scanning the code are matched with the flow configuration of the planned track path, the carrier finishes a task corresponding to the carrier, and the carrier automatically enters the next task until the carrier moves to the target station along the planned track path. The track route is reasonably planned through software, so that the carrier achieves high beat and flexibility of transportation.

Description

Production process dispatching method and system
Technical Field
The invention relates to a production line in the field of chip packaging and testing, in particular to a method and a system for dispatching production procedures.
Background
Robot dispatch sorting and RGV dispatch sorting, equipment cost is high, and manual intervention's maneuverability is lower simultaneously, needs to carry out under a very closed line. In this long line, sweep a yard rifle through the installation at every transport node, can lead to the cost error rate to improve, the reaction rate is slow simultaneously, and artifical intervention can be more frequent, and the stifled line condition takes place occasionally, and host computer software and electric interactive signal are too much.
Hardware is reduced by increasing the speed, the greatest advantage of software is exerted, the software and hardware can be developed and cut more clearly, and the software can have more optimization space to enable different task types to be executed orderly under the condition that the number of work stations of the same type is more.
Therefore, how to design the optimal path of the carrier through software and reduce the blocking phenomenon enables a plurality of carriers to automatically enter the designated station, arrange tasks orderly and reasonably, reduce manual intervention and achieve the maximization of productivity is still the technical problem and the research and development target to be solved by technical personnel in the field.
Disclosure of Invention
The present invention is directed to a method and a system for dispatching production processes, so as to solve the problems mentioned in the background.
In order to achieve the purpose, the invention adopts the following technical scheme:
the application discloses in a first aspect a method for dispatching production processes, comprising:
s1, arranging a conveying rail, a plurality of work stations outside the conveying rail and a carrier capable of flowing along the conveying rail, wherein the area where each work station is located is a work station, each work station comprises a plurality of work stations, assembling materials are configured on each work station, and the carrier is used for driving the conveying rail to carry out conveying operation, so that one or more sides of products to be assembled sequentially face to the corresponding work stations outside the conveying rail to realize the installation of the assembling materials;
s2, task types are constructed in advance, each work station comprises a plurality of task types independently, each task type corresponds to one task, the task type of each work station is associated with an assembly instruction of a corresponding work station, and the task types comprise:
the method comprises the following steps that a task type I is an inbound task, namely, the inbound task enters an area where a station is located from a station port;
the task type II is an outbound task, namely, the task is moved to a station port of other stations from the area where the station is located;
a task type III, namely a task of moving a station from a station port of one station to a station port of another station;
task type four, moving the work station task, namely moving from one work station of a work station to another work station of the work station;
s3, generating an assignment workflow table of a plurality of products to be assembled based on the task type, wherein the assignment workflow table comprises assignment workflows of the plurality of products to be assembled, the assignment workflow of each product to be assembled comprises a planned track path of a carrier corresponding to the product to be assembled from the current position to a target station, the planned track path is a part of the conveying track, the planned track path comprises a plurality of joint points, and a code scanning device is arranged at each joint point;
s4, controlling a plurality of vehicles to travel on the planned track paths according to the planned track paths;
s5, each time the carrier travels to one joint point, the code scanning device scans the code to obtain the identifier and the position of the carrier, wherein the identifier is used for identifying each carrier; and if the identifier and the position acquired by scanning the code are matched with the flow configuration of the planned track path, the completion of one task corresponding to the carrier is indicated, and the carrier automatically enters the next task until the carrier moves to the target station along the planned track path.
Preferably, the products to be assembled positioned at any two stations of the same station can be the same or different.
Preferably, the processes configured for any two stations located at the same station may be the same or different.
Preferably, the number of the maximum tasks supported by the same work station in the same time period is equal to the total number of the work stations included in the work station.
Preferably, said articulation point is provided at the entrance of each station.
Preferably, the planned track path included in the assignment flow of each product to be assembled is implemented by constructing a model of the current production equipment, and specifically includes the following steps:
a1, calling a machine learning prediction regression algorithm to construct a path model for a transportation scene in a factory, wherein the path model comprises the number and the positions of work stations, the number and the positions of stations and code scanning devices in different work stations, and a conveying track connecting different work stations and stations in the work stations;
a2, loading a test data set to the constructed model, creating a regression calculator, reading the test data set through an external data interface by the regression calculator, and performing linear regression calculation according to the read data;
a3, evaluating the model, judging whether the training result reaches the optimal strategy, if not, updating the test data set, repeating the training until the circulation stops, and calculating to obtain the trained path model;
a4, acquiring time, path distance and station processing time required by execution of different tasks through mechanical simple data learning, and establishing basic data;
a5, planning a track path through mechanical learning based on basic data to obtain tasks to be executed at each station in the next step;
wherein the optimal strategy comprises:
and planning the multi-task execution path according to the processing time, the use frequency and the rail transportation time of the stations, so that the comprehensive efficiency OEE of the production equipment after path planning is maximum.
In a preferred embodiment, when planning the track path, an objective function can be set according to the total time of station processing time of a plurality of tasks and the transportation time of the carrier between stations, and the track path planning is carried out according to the principle that the total time length is shortest; when planning the track path, sorting the track transportation time among the stations according to the size, selecting the station with the small next section of track transportation time and judging the processing conditions of the stations, if the station is in an idle state in the time section, performing task allocation, and if the station is not in the idle state, selecting the next-stage station for judgment until the task allocation is completed.
In a preferred embodiment, when planning the path of the track, tasks in orders of higher urgency are assigned preferentially according to the urgency of the process order.
Preferably, the track path comprises a unidirectional path and a bidirectional path, the unidirectional path carrier cannot be folded back, and the bidirectional path carrier can be folded back; multiple stations located at the same station are connected in a unidirectional or bidirectional path.
Preferably, when the vehicle is travelling along a planned track path, such as when a station or track segment is occupied, the method further comprises at least one of:
in the first solution, if the carrier enters the corresponding station and finds that the station is not in an idle state in the time period, the carrier returns back to the original point along with the conveying track to perform path planning without occupied station again;
in the second solution, if the carrier enters the corresponding station and the station is not in an idle state in the time period, the upper computer is informed of the idle state, and the upper computer reassigns a new path; or the upper computer gives N optional station positions when distributing tasks, when one station is not in an idle state in the time period, the carrier moves to the next optional station along with the conveying track to operate, meanwhile, the current station position is marked to be unavailable, the upper computer locks the position until the occupied station state is converted into the idle state, the station position is unlocked, and other tasks are allowed to occupy the station position;
and the upper computer simultaneously plans two track paths when planning the track paths, when one track path is abnormal, the carrier travels along the other track path, the abnormal track path is marked to be unavailable, the upper computer locks the path until the occupied path state is converted into idle, and the track path is unlocked to allow other tasks to occupy the track path.
A second aspect of the present application discloses a production process distribution system, comprising: the system comprises a plurality of carriers, a plurality of code scanning devices, an upper computer, a database and a control module, wherein the upper computer comprises a task type construction module and a task path planning module;
the carrier runs on the conveying track to carry out carrying operation, a plurality of station groups are arranged on the outer side of the conveying track, the area where each station group is located is a station, each station comprises a plurality of stations, assembling materials are arranged on each station, and when the carrier flows around the conveying track, one or more side surfaces of products to be assembled on the carrier sequentially face the corresponding stations on the outer side of the conveying track so as to realize the installation of the assembling materials;
the task type construction module is used for constructing task types in advance, each work station comprises a plurality of task types respectively and independently, each task type corresponds to one task, the task type of each work station is associated with an assembly instruction of a corresponding work station, and the task types comprise:
the method comprises the following steps that a task type I is an inbound task, namely, the inbound task enters an area where a station is located from a station port;
the task type II is an outbound task, namely, the task is moved to a station port of other stations from the area where the station is located;
a task type III, namely a task of moving a station from a station port of one station to a station port of another station;
task type four, moving station task, namely moving from one station of a station to another station of the station;
a task path planning module, configured to generate an assignment workflow table of a plurality of products to be assembled based on the task type, where the assignment workflow table includes assignment workflows of the plurality of products to be assembled, the assignment workflow of each product to be assembled includes a planned track path for a carrier corresponding to the product to be assembled to reach a target station from a current position, and the planned track path is a part of the conveying track;
the code scanning devices are distributed at the entrance of each work station of the conveying track and are used for scanning and identifying the entering carriers;
the database is used for storing the current code scanning information of the carrier and transmitting the code scanning information of the carrier to the control module;
the control module is used for acquiring identifiers and positions of the carriers respectively based on code scanning information of the carriers, acquiring planned track paths of next tasks executed by the carriers respectively based on the task path planning module, determining driving conditions of the carriers based on the planned track paths and controlling the movement of the carriers;
the task path planning module calculates planned track paths of a plurality of vehicles based on an optimal strategy, wherein the optimal strategy comprises the following steps: and planning the multi-task execution path according to the processing time, the use frequency and the rail transportation time of the stations, so that the comprehensive efficiency OEE of the production equipment after path planning is maximum.
Preferably, the track path comprises a unidirectional path and a bidirectional path, the unidirectional path carrier cannot be folded back, and the bidirectional path carrier can be folded back; multiple stations located at the same station are connected in a unidirectional or bidirectional path.
Preferably, the products to be assembled at any two stations located at the same station may be the same or different.
Preferably, the processes configured for any two stations located at the same station may be the same or different.
Preferably, the number of the maximum tasks supported by the same work station in the same time period is equal to the total number of the work stations included in the work station.
Preferably, the system further comprises: an exception handling module, which is responsible for solving the problem by one of the following solutions when the vehicle is in the process of traveling along the planned track path, if a station or a track segment is occupied:
in the first solution, if the carrier enters the corresponding station and finds that the station is not in an idle state in the time period, the carrier returns back to the original point along with the conveying track to perform path planning without occupied station again;
in the second solution, if the carrier enters the corresponding station and the station is not in an idle state in the time period, the upper computer is informed of the idle state, and the upper computer reassigns a new path; or the upper computer gives N optional station positions when distributing tasks, when one station is not in an idle state in the time period, the carrier moves to the next optional station along with the conveying track to operate, meanwhile, the current station position is marked to be unavailable, the upper computer locks the position until the occupied station state is converted into the idle state, the station position is unlocked, and other tasks are allowed to occupy the station position;
and the upper computer simultaneously plans two track paths when planning the track paths, when one track path is abnormal, the carrier travels along the other track path, the current track path is marked to be unavailable, the upper computer locks the path, and the track path is unlocked until the occupied path state is converted into idle, so that other tasks are allowed to occupy the track path.
Preferably, the system further comprises: and the human-computer interaction interface is connected with the upper computer.
Compared with the prior art, the technical scheme of the invention has the following beneficial effects:
1) the track path is reasonably planned through software, so that the carrier achieves high beat and flexibility of transportation according to a certain algorithm. Through the task type, how the track circulates is defined, so that the designated carrier enters the designated station, the tasks are orderly and reasonably arranged, and excessive manual intervention is reduced.
2) According to the technical scheme, the number of scanning stations can be reduced, the crowdedness degree and the equipment utilization rate of each road are judged in advance by building the model, the optimal path of the carrier is designed by software, the blocking phenomenon is reduced, and unmanned automatic scheduling of production operation is realized.
3) The path planning method realizes the parallel of multiple devices and multiple tasks without conflict, and improves the task execution efficiency and the utilization rate of the devices.
4) The production procedure assignment method is suitable for assembly production of various semiconductor devices and has the advantages of wide application range, strong compatibility, flexibility and changeability.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments of the application and, together with the description, serve to explain the application and are not intended to limit the application. In the drawings:
FIG. 1 is a schematic flow diagram of a distribution method of the present application;
FIG. 2 is a schematic flow chart of the track path planning process of the present application;
fig. 3 is a schematic view of a vehicle according to an embodiment of the present application being transported on a conveying track;
FIG. 4 is a functional block diagram of a distribution system of the present application;
FIG. 5 is an architecture diagram of a distribution system of the present application.
Illustration of the drawings:
1. a station; 2. a work station; 3. a carrier; 4. a transfer rail; 5. a nitrogen cabinet.
Detailed Description
In order to make the objects, technical solutions and effects of the present invention clearer and clearer, the present invention is further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order, it being understood that the data so used may be interchanged under appropriate circumstances. Furthermore, the terms "comprises," "comprising," and any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
The first embodiment is as follows:
referring to fig. 1, the application discloses a distributing method of a production process, which specifically comprises the following steps:
step S1, a conveying track, a plurality of work stations at the outer side of the conveying track and a carrier capable of flowing along the conveying track are arranged, wherein the area where each work station is located is a work station, each work station comprises a plurality of work stations, assembling materials are configured at each work station, and the carrier is used for driving on the conveying track to carry out carrying operation, so that one or more sides of products to be assembled face the corresponding work stations at the outer side of the conveying track in sequence to achieve installation of the assembling materials. And a code scanning device is further arranged at the entrance of each work station.
The products to be assembled on any two stations in the same station can be the same or different, and the working procedures configured on any two stations in the same station can be the same or different. And in the same time period, the number of the maximum execution tasks supported by the same work station is equal to the total number of the work stations included in the work station.
Step S2, task types are pre-constructed, each work station respectively and independently comprises a plurality of task types, each task type corresponds to one task, the task type of each work station is associated with the assembly instruction of the corresponding work station, and the task types comprise:
the method comprises the following steps that a task type I is an inbound task, namely, the inbound task enters an area where a station is located from a station port;
the task type II is an outbound task, namely, the task is moved to a station port of other stations from the area where the station is located;
a task type III, namely a task of moving a station, namely moving the station from a station port of one station to a station port of another station;
task type four, move station task, i.e. move from one station of a station to another station of the station.
Step S3, generating an assignment workflow table of a plurality of products to be assembled based on the task type, where the assignment workflow table includes assignment workflows of the plurality of products to be assembled, and the assignment workflow of each product to be assembled includes a planned track path for a carrier corresponding to the product to be assembled to reach a target station from a current position, and the planned track path is a part of the conveying track.
The planned track path included in the assignment flow of each product to be assembled is realized by constructing a model of the current production equipment, and as shown in fig. 2, the method specifically includes steps a 1-a 5:
step A1, calling a machine-learned prediction regression algorithm to construct a path model for a transportation scene in a factory, wherein the path model comprises the number and the positions of work stations, the number and the positions of stations and code scanning devices in different work stations, and a conveying track connecting different work stations and stations in the work stations;
step A2, loading a test data set on the constructed model, creating a regression calculator, reading the test data set through an external data interface by the regression calculator, and performing linear regression calculation according to the read data;
a3, evaluating the model, judging whether the training result reaches the optimal strategy, if not, updating the test data set, repeating the training until the circulation stops, and calculating to obtain the trained path model;
step A4, acquiring time, path distance and station processing time required by execution of different tasks through mechanical simple data learning, and establishing basic data;
a5, planning a track path through mechanical learning based on basic data to obtain tasks to be executed by each station in the next step;
wherein the optimal strategy comprises: and planning the multi-task execution path according to the processing time, the use frequency and the rail transportation time of the stations, so that the comprehensive efficiency OEE of the production equipment after path planning is maximum.
For example, when planning the track path, an objective function may be set according to the total time of the station processing time of the multiple tasks and the transportation time of the carrier between the stations, and the track path planning may be performed according to the principle that the total duration is the shortest; when planning the track path, sorting the track transportation time among the stations according to the size, selecting the station with the small next section of track transportation time and judging the processing conditions of the stations, if the station is in an idle state in the time section, performing task allocation, and if the station is not in the idle state, selecting the next-stage station for judgment until the task allocation is completed.
For another example, when planning a track path, tasks in orders with higher urgency are preferentially allocated according to the urgency of the process order.
Step S4, controlling a plurality of vehicles to travel on their respective planned track paths according to the planned track paths.
The track path comprises a unidirectional path and a bidirectional path, the unidirectional path carrier cannot be folded back, and the bidirectional path carrier can be folded back; multiple stations located at the same station are connected in a unidirectional or bidirectional path.
Step S5, when the vehicle travels along the planned track path to a code scanning device, the code scanning device scans the code to obtain the identifier and the position of the vehicle, where the identifier is used to identify each vehicle; and if the identifier and the position acquired by scanning the code are matched with the flow configuration of the planned track path, the completion of one task corresponding to the carrier is indicated, and the carrier automatically enters the next task until the carrier moves to the target station along the planned track path.
In the present embodiment, a semiconductor assembly line is exemplified, including: a plurality of vehicles, each vehicle being given an identifier; a transfer rail; a plurality of work groups arranged at the outer side of the conveying track. The carriers may be circulated along the transfer rail.
Referring to fig. 3, the illustrated rectangular track is a belt-type conveying track 4 in a factory, and includes two first track groups and two second track groups, where the two first track groups are arranged in parallel and respectively include an L1 segment, an L2 segment, and an L3 segment, which are sequentially connected, and an L4 segment and an L5 segment, which are sequentially connected. Two sets of second track groups set up side by side, namely bridge 1 and bridge 2, and two tip of every group second track group are connected with two sets of first track groups respectively.
A plurality of work stations, each of which is a work station 2, may comprise a plurality of work stations 1, are arranged outside the transfer track. Specifically, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R are stations 1, and each station 1 is provided with a machine, such as a bonding machine, a chip mounter, and the like, for performing assembly operation on a product to be assembled which reaches the station 1. Wherein ABCD, EFGH, IJKL are three work stations, i.e. three work stations 2, all located on the same side of one first track group, and MNOP, QR are two work stations, i.e. two work stations 2, all located on the same side of the other first track group. When the carrier 3 moves on different sections of the conveying track 4, the products to be assembled carried by the carrier 3 are sequentially close to the stations 1 of the corresponding station group.
Each station 2 may be provided with a code scanning device for scanning the identifier of the code carrier 3. Sweep a yard device and can be a station, sweep a yard device and can establish the stack buffer memory station at 2 entrances in worker station, not only can sweep the sign indicating number, also can have the stack function, can buffer memory a plurality of carriers 3.
A nitrogen gas tank 5 is also provided on the right side of the transfer rail 4 for storing the carriers 3.
In this embodiment, the set task types include:
task type one, inbound tasks, for example, a bonder from a-station gate to B-station.
Task type two, outbound task, e.g., from a B-station bonder to a B-station port.
Task type three, shift tasks, e.g., from a-station port to b-station port.
Task type four, a shift station task, for example, from an a-station bonder to a B-station bonder, where the process of the a-station bonder is different from the process of the B-station bonder.
In the following, a carrier 3 is transported on the transport track 4 as an example. For example, the starting position of a carrier 3 is a station a, and the target station is a station f. A station port, a station port, an e station port and an f station port are provided with code scanning cache equipment, carrier 3 can be stacked and cached, a code scanning gun is further arranged, and codes can be scanned on the carrier 3.
The specific process is as follows:
1) the carrier 3 is located a station mouth department, and the yard rifle of sweeping of a station mouth department scans carrier 3, feeds back its identification information and position to the host computer, and the host computer is configured first task, and electrical equipment control carrier 3 moves to A station along track route L1 section from a station mouth, makes carrier 3 reach A station.
2) After the bonding task of the station is completed by the carrier 3 at the station A, the identification information and the position information of the station are fed back to the upper computer, the upper computer is provided with a second task, the electric equipment controls the carrier 3 to move from the station A to the station b along the section L1 of the track path, and the carrier 3 arrives at the station b to scan and confirm the codes.
3) The carrier 3 is located at the b station port, a code scanning gun at the b station port scans codes of the carrier 3, identification information and position information of the carrier 3 are fed back to an upper computer, the upper computer is configured with a third task, the carrier is controlled by electrical equipment to move to a P station from the b station port sequentially along a track path L2 section, a track path L3 section, a bridge 1 and a track path L4 section, or the carrier 3 is controlled by the electrical equipment to move to the P station from the b station port sequentially along a track path L2 section, a track path bridge 2 and a track path L4 section, so that the carrier 3 reaches the P station.
4) After the bonding task of the station is completed by the carrier 3 at the P station, the identification information and the position information of the carrier are fed back to the upper computer, the upper computer is provided with a fourth task, the electronic equipment controls the carrier to move from the P station to the f station port along the section L5 of the track, the carrier 3 reaches the f station port and scans codes to confirm, namely, the target station is reached, and the whole process is completed.
It should be noted that the above application scenario is only one example of the embodiment of the present invention, and the embodiment of the present invention is not limited to the above application scenario, but may be applied to any application scenario to which the embodiment of the present invention is applied.
On the other hand, the present application also discloses a distribution system of a production process (see fig. 4), comprising: the system comprises a plurality of carriers, a plurality of code scanning devices, an upper computer, a database and a control module, wherein the upper computer comprises a task type construction module and a task path planning module.
The carriers run on the conveying rail to carry out carrying operation, wherein a plurality of station groups are arranged on the outer side of the conveying rail, the area where each station group is located is a station, each station comprises a plurality of stations, assembling materials are configured on each station, and when the carriers circulate along the conveying rail, one or more side surfaces of products to be assembled on the carriers sequentially face the corresponding stations on the outer side of the conveying rail so as to realize the installation of the assembling materials.
The task type construction module is used for constructing task types in advance, each work station comprises a plurality of task types independently, each task type corresponds to one task, the task type of each work station is associated with an assembly instruction of a corresponding work station, and the task types comprise:
the method comprises the following steps that a task type I is an inbound task, namely, the inbound task enters an area where a station is located from a station port;
the task type II is an outbound task, namely, the task is moved to a station port of other stations from the area where the station is located;
a task type III, namely a task of moving a station from a station port of one station to a station port of another station;
task type four, move station task, i.e. move from one station of a station to another station of the station.
The task path planning module is configured to generate an assignment workflow table of a plurality of products to be assembled based on the task type, where the assignment workflow table includes assignment workflows of the plurality of products to be assembled, the assignment workflow of each product to be assembled includes a planned track path for a carrier corresponding to the product to be assembled to reach a target station from a current position, and the planned track path is a part of the conveying track.
The plurality of code scanning devices are distributed at the entrance of each work station of the conveying track and are used for scanning and identifying the entering carriers.
The database is used for storing the current code scanning information of the carrier and transmitting the code scanning information of the carrier to the control module;
the control module acquires identifiers and positions of the vehicles based on code scanning information of the vehicles, acquires planned track paths of next tasks executed by the vehicles based on the task path planning module, determines driving conditions of the vehicles based on the planned track paths, and controls movement of the vehicles.
The task path planning module calculates planned track paths of a plurality of vehicles based on an optimal strategy, wherein the optimal strategy comprises the following steps: and planning the multi-task execution path according to the processing time, the use frequency and the rail transportation time of the stations, so that the comprehensive efficiency OEE of the production equipment after path planning is maximum.
Example two:
the difference between the first embodiment and the second embodiment is that, when the vehicle travels along the planned track path, if the station or the track segment is occupied, the method for dispatching the production process further includes the following optional solutions:
in the first solution, if the carrier enters the corresponding station and finds that the station is not in an idle state in the time period (for example, finds that the current state of the station is full), the carrier returns to the original point along with the conveying track to perform path planning again without the occupied station.
In the second solution, if the carrier enters the corresponding station and the station is found not to be in an idle state in the time period (for example, the current state of the station is found to be full), the upper computer is informed, and the upper computer reassigns a new path; or the upper computer gives N optional station positions when distributing tasks, when one station is not in an idle state in the time period, the carrier moves to the next optional station along the conveying track to carry out operation, meanwhile, the current station position is marked to be unavailable, the upper computer carries out position locking, and after the station occupied state is converted into the idle state, the station position is unlocked, and other tasks are allowed to occupy the station position;
and the upper computer simultaneously plans two track paths when planning the track paths, when one track path is abnormal, the carrier travels along the other track path, the abnormal track path is marked to be unavailable, the upper computer locks the path until the occupied path state is converted into idle, and the track path is unlocked to allow other tasks to occupy the track path.
In addition, in a preferred embodiment, sensors may also be incorporated into the conveyor track. Therefore, after the carrier scans the code through the code scanning gun, the upper computer records the identifier and the position of the carrier, can sense whether the carrier enters a planned track path through the sensor and generates a track occupation state. And transmitting the track occupation state to an upper computer, and if the current track is occupied, selecting an alternative solution by the upper computer for processing.
On the other hand, the above-mentioned distribution system of the production process may further include, in addition to the first embodiment: an exception handling module, which is responsible for solving the problem by one of the following solutions when the vehicle is in the process of traveling along the planned track path, if a station or a track segment is occupied:
in the first solution, if the carrier enters the corresponding station and finds that the station is not in an idle state in the time period, the carrier returns to the original point along with the conveying track to perform path planning without occupied station again.
In the second solution, if the carrier enters the corresponding station and the station is not in an idle state in the time period, the upper computer is informed of the idle state, and the upper computer reassigns a new path; or the upper computer gives N optional station positions when distributing tasks, when one station is not in an idle state in the time period, the carrier moves to the next optional station along with the conveying track to operate, meanwhile, the current station position is marked to be unavailable, the upper computer locks the position until the occupied station state is converted into the idle state, the station position is unlocked, and other tasks are allowed to occupy the station position;
and the upper computer simultaneously plans two track paths when planning the track paths, when one track path is abnormal, the carrier travels along the other track path, the current track path is marked to be unavailable, the upper computer locks the path, and the track path is unlocked until the occupied path state is converted into idle, so that other tasks are allowed to occupy the track path.
In a preferred embodiment, the system further comprises: and the human-computer interaction interface is connected with the upper computer. If the carrier is related to station locking and/or path locking when performing tasks, the human-computer interaction interface displays all abnormal paths and/or abnormal stations.
The functional module diagram of the distribution system of the production process can be referred to in detail in fig. 4.
Fig. 5 also shows an architecture diagram of a distribution system of a production process. Referring to fig. 5, the system specifically includes an algorithm layer, an interaction layer 1, an interaction layer 2, and a hardware electrical layer.
The interaction layer 1 is used for displaying the conditions of abnormity and task distribution, or manually selecting the priority of tasks; the interaction layer 2 is used for performing interaction tasks such as instruction issuing with a hardware electrical layer, and the like, simultaneously collecting signals of all the sensors at a certain frequency, and sending the signals to the algorithm layer as basic data to perform path calculation.
To sum up, the track path is reasonably planned through software, so that the carrier realizes high beat and high flexibility according to a certain algorithm, and how the track circulates is defined through the task type, so that the specified carrier enters the specified station, the tasks are orderly and reasonably arranged, and excessive manual intervention is reduced.
The embodiments of the present invention have been described in detail, but the embodiments are merely examples, and the present invention is not limited to the embodiments described above. Any equivalent modifications and substitutions to those skilled in the art are also within the scope of the present invention. Accordingly, equivalent changes and modifications made without departing from the spirit and scope of the present invention should be covered by the present invention.

Claims (10)

1. A distribution method of a production process is characterized by comprising the following steps:
s1, arranging a conveying rail, a plurality of work stations outside the conveying rail and a carrier capable of flowing along the conveying rail, wherein the area where each work station is located is a work station, each work station comprises a plurality of work stations, assembling materials are configured on each work station, and the carrier is used for driving the conveying rail to carry out conveying operation, so that one or more sides of products to be assembled sequentially face to the corresponding work stations outside the conveying rail to realize the installation of the assembling materials;
s2, task types are constructed in advance, each work station comprises a plurality of task types independently, each task type corresponds to one task, the task type of each work station is associated with an assembly instruction of a corresponding work station, and the task types comprise:
the method comprises the following steps that a task type I is an inbound task, namely, the inbound task enters an area where a station is located from a station port;
the task type II is an outbound task, namely, the task is moved to a station port of other stations from the area where the station is located;
a task type III, namely a task of moving a station from a station port of one station to a station port of another station;
task type four, moving the work station task, namely moving from one work station of a work station to another work station of the work station;
s3, generating an assignment workflow table of a plurality of products to be assembled based on the task type, wherein the assignment workflow table comprises assignment workflows of the plurality of products to be assembled, the assignment workflow of each product to be assembled comprises a planned track path of a carrier corresponding to the product to be assembled from the current position to a target station, the planned track path is a part of the conveying track, the planned track path comprises a plurality of joint points, and a code scanning device is arranged at each joint point;
s4, controlling a plurality of vehicles to move on the planned track paths according to the planned track paths;
s5, each time the carrier travels to one joint point, the code scanning device scans the code to obtain the identifier and the position of the carrier, wherein the identifier is used for identifying each carrier; and if the identifier and the position acquired by scanning the code are matched with the flow configuration of the planned track path, the completion of one task corresponding to the carrier is indicated, and the carrier automatically enters the next task until the carrier moves to the target station along the planned track path.
2. The method for distributing the production process according to claim 1, wherein the products to be assembled positioned at any two stations of the same station are the same or different; any two stations in the same station are configured with the same or different processes.
3. The method for dispatching a production process according to claim 1, wherein the planned track path included in the assignment process of each product to be assembled is realized by constructing a model of current production equipment, and specifically comprises the following steps:
a1, calling a machine learning prediction regression algorithm to construct a path model for a transportation scene in a factory, wherein the path model comprises the number and the positions of work stations, the number and the positions of stations and code scanning devices in different work stations, and a conveying track connecting different work stations and stations in the work stations;
a2, loading a test data set to the constructed model, creating a regression calculator, reading the test data set through an external data interface by the regression calculator, and performing linear regression calculation according to the read data;
a3, evaluating the model, judging whether the training result reaches the optimal strategy, if not, updating the test data set, repeating the training until the circulation stops, and calculating to obtain the trained path model;
a4, acquiring time, path distance and station processing time required by execution of different tasks through mechanical simple data learning, and establishing basic data;
a5, planning a track path through mechanical learning based on basic data to obtain tasks to be executed at each station in the next step;
wherein the optimal strategy comprises:
and planning the multi-task execution path according to the processing time, the use frequency and the rail transportation time of the stations, so that the comprehensive efficiency OEE of the production equipment after path planning is maximum.
4. The method of claim 1, wherein the track path comprises a one-way path and a two-way path, the one-way path carrier cannot be folded back, and the two-way path carrier can be folded back; multiple stations located at the same station are connected in a unidirectional or bidirectional path.
5. The method as claimed in claim 1, wherein when the vehicle is traveling along the planned track path, such as when a station or track segment is occupied, the method further comprises at least one of:
in the first solution, if the carrier enters the corresponding station and finds that the station is not in an idle state in the time period, the carrier returns back to the original point along with the conveying track to perform path planning without occupied station again;
in the second solution, if the carrier enters the corresponding station and the station is not in an idle state in the time period, the upper computer is informed of the idle state, and the upper computer reassigns a new path; or the upper computer gives N optional station positions when distributing tasks, when one station is not in an idle state in the time period, the carrier moves to the next optional station along with the conveying track to operate, meanwhile, the current station position is marked to be unavailable, the upper computer locks the position until the occupied station state is converted into the idle state, the station position is unlocked, and other tasks are allowed to occupy the station position;
and the upper computer simultaneously plans two track paths when planning the track paths, when one track path is abnormal, the carrier travels along the other track path, the abnormal track path is marked to be unavailable, the upper computer locks the path until the occupied path state is converted into idle, and the track path is unlocked to allow other tasks to occupy the track path.
6. The method as claimed in claim 1, wherein when planning the track path, an objective function is set according to the total time of the station processing time of the tasks and the transportation time of the carrier between the stations, and the track path is planned according to the principle that the total time length is shortest; when planning the track path, sorting the track transportation time among the stations according to the size, selecting the station with the small next section of track transportation time and judging the processing conditions of the stations, if the station is in an idle state in the time section, performing task allocation, and if the station is not in the idle state, selecting the next-stage station for judgment until the task allocation is completed.
7. The method of claim 1, wherein tasks in higher urgency orders are assigned preferentially according to urgency of the process order when planning the trajectory path.
8. A production process distribution system is characterized by comprising: the system comprises a plurality of carriers, a plurality of code scanning devices, an upper computer, a database and a control module, wherein the upper computer comprises a task type construction module and a task path planning module;
the carrier runs on the conveying track to carry out carrying operation, a plurality of station groups are arranged on the outer side of the conveying track, the area where each station group is located is a station, each station comprises a plurality of stations, assembling materials are arranged on each station, and when the carrier flows around the conveying track, one or more side surfaces of products to be assembled on the carrier sequentially face the corresponding stations on the outer side of the conveying track so as to realize the installation of the assembling materials;
the task type construction module is used for constructing task types in advance, each work station comprises a plurality of task types respectively and independently, each task type corresponds to one task, the task type of each work station is associated with an assembly instruction of a corresponding work station, and the task types comprise:
the method comprises the following steps that a task type I is an inbound task, namely, the inbound task enters an area where a station is located from a station port;
the task type II is an outbound task, namely, the task is moved to a station port of other stations from the area where the station is located;
a task type III, namely a task of moving a station from a station port of one station to a station port of another station;
task type four, moving the work station task, namely moving from one work station of a work station to another work station of the work station;
a task path planning module, configured to generate an assignment workflow table of a plurality of products to be assembled based on the task type, where the assignment workflow table includes assignment workflows of the plurality of products to be assembled, the assignment workflow of each product to be assembled includes a planned track path for a carrier corresponding to the product to be assembled to reach a target station from a current position, and the planned track path is a part of the conveying track;
the code scanning devices are distributed at the entrance of each work station of the conveying track and are used for scanning and identifying the entering carriers;
the database is used for storing the current code scanning information of the carrier and transmitting the code scanning information of the carrier to the control module;
the control module acquires identifiers and positions of the vehicles based on code scanning information of the vehicles, acquires planned track paths of next tasks executed by the vehicles based on the task path planning module, determines driving conditions of the vehicles based on the planned track paths, and controls movement of the vehicles;
the task path planning module calculates planned track paths of a plurality of vehicles based on an optimal strategy, wherein the optimal strategy comprises the following steps: and planning the multi-task execution path according to the processing time, the use frequency and the rail transportation time of the stations, so that the production equipment with the planned path has the maximum OEE comprehensive efficiency.
9. The system of claim 8, wherein the track path comprises a one-way path and a two-way path, the one-way path carrier cannot be folded, and the two-way path carrier can be folded; multiple stations located at the same station are connected in a unidirectional or bidirectional path.
10. The system for dispatching a production process according to claim 8, further comprising: an exception handling module, which is responsible for solving the problem by one of the following solutions when the vehicle is in the process of traveling along the planned track path, if a station or a track segment is occupied:
in the first solution, if the carrier enters the corresponding station and finds that the station is not in an idle state in the time period, the carrier returns back to the original point along with the conveying track to perform path planning without occupied station again;
in the second solution, if the carrier enters the corresponding station and the station is not in an idle state in the time period, the upper computer is informed of the idle state, and the upper computer reassigns a new path; or the upper computer gives N optional station positions when distributing tasks, when one station is not in an idle state in the time period, the carrier moves to the next optional station along with the conveying track to operate, meanwhile, the current station position is marked to be unavailable, the upper computer locks the position until the occupied station state is converted into the idle state, the station position is unlocked, and other tasks are allowed to occupy the station position;
and the upper computer simultaneously plans two track paths when planning the track paths, when one track path is abnormal, the carrier travels along the other track path, the current track path is marked to be unavailable, the upper computer locks the path, and the track path is unlocked until the occupied path state is converted into idle, so that other tasks are allowed to occupy the track path.
CN202210481949.2A 2022-05-05 2022-05-05 Production process dispatching method and system Pending CN114970973A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210481949.2A CN114970973A (en) 2022-05-05 2022-05-05 Production process dispatching method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210481949.2A CN114970973A (en) 2022-05-05 2022-05-05 Production process dispatching method and system

Publications (1)

Publication Number Publication Date
CN114970973A true CN114970973A (en) 2022-08-30

Family

ID=82981900

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210481949.2A Pending CN114970973A (en) 2022-05-05 2022-05-05 Production process dispatching method and system

Country Status (1)

Country Link
CN (1) CN114970973A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116934207A (en) * 2023-09-19 2023-10-24 弥费科技(上海)股份有限公司 Semiconductor transfer waybill task processing method and device and computer equipment

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116934207A (en) * 2023-09-19 2023-10-24 弥费科技(上海)股份有限公司 Semiconductor transfer waybill task processing method and device and computer equipment
CN116934207B (en) * 2023-09-19 2024-01-19 弥费科技(上海)股份有限公司 Semiconductor transfer waybill task processing method and device and computer equipment

Similar Documents

Publication Publication Date Title
CN111033539B (en) Robot inventory update for order-prescribed routes
Fontes et al. Joint production and transportation scheduling in flexible manufacturing systems
AU2019339988B2 (en) Robot control system and method, computing device, and storage medium
Zhen et al. A review on yard management in container terminals
CN109858791B (en) Logistics flowing method and system
CN106843238A (en) A kind of warehouse automation sorting system and method
CN117921713A (en) Robot control system and method, computing equipment and storage medium
CN107703943A (en) A kind of method and its system that control multiple mobile robots concurrently to run
CN107766965B (en) Express sorting method based on automatic guided vehicle
CN104809606A (en) Warehouse management system with multi-guide-vehicle dispatching and distribution function
CN102234016A (en) Automated material handling system with identification features
US20070296585A1 (en) Automated Warehouse
CN107621824A (en) A kind of system and method for managing and dispatching mobile order car
Foulds et al. Optimal bin location and sequencing in printed circuit board assembly
KR101358928B1 (en) Conveyance vehicle system
CN114970973A (en) Production process dispatching method and system
Fragapane et al. Autonomous mobile robots in sterile instrument logistics: an evaluation of the material handling system for a strategic fit framework
CN109782718A (en) A kind of finished product management method and system of electric energy meter finished bin storage cavern
CN108196541A (en) Automatic guiding carriage dispatching method
CN108928594A (en) A kind of multidirectional shuttle of stereo garage based on agent model dispatches system and method
CN110347161B (en) Dispatching method and device for automatic guided transport vehicle
CN110026341A (en) A kind of sorting trolley, intelligent sorting system and method for sorting
KR101931626B1 (en) System and method for managing shuttle freight
Jawahar et al. Optimal random storage allocation for an AS/RS in an FMS
CN109941658B (en) Cargo transmission system, method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
CB02 Change of applicant information

Country or region after: China

Address after: 201109, 3rd Floor, Building 2, No. 1259 Ping'an Road, Minhang District, Shanghai

Applicant after: Shanghai Xuantian Intelligent Technology Co.,Ltd.

Address before: 201100 2nd floor, building 4, 1259 Ping'an Road, Minhang District, Shanghai

Applicant before: SHANGHAI NOKIDA TECHNOLOGY CO.,LTD.

Country or region before: China