CN115345397A - Material scheduling method and device and computer readable storage medium - Google Patents

Material scheduling method and device and computer readable storage medium Download PDF

Info

Publication number
CN115345397A
CN115345397A CN202110522075.6A CN202110522075A CN115345397A CN 115345397 A CN115345397 A CN 115345397A CN 202110522075 A CN202110522075 A CN 202110522075A CN 115345397 A CN115345397 A CN 115345397A
Authority
CN
China
Prior art keywords
storage area
materials
empty
carriers
group
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
CN202110522075.6A
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.)
Shennan Circuit Co Ltd
Original Assignee
Shennan Circuit 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 Shennan Circuit Co Ltd filed Critical Shennan Circuit Co Ltd
Priority to CN202110522075.6A priority Critical patent/CN115345397A/en
Publication of CN115345397A publication Critical patent/CN115345397A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04—Manufacturing

Landscapes

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

Abstract

The application discloses a material scheduling method, a device and a computer readable storage medium, wherein the material scheduling method comprises the following steps: detecting the number of idle bits of the first storage area according to a first set frequency; the first storage area is used for storing carriers of materials to be produced on line; responding to the number of the idle load positions being smaller than a first set number, and transferring the idle load to a second storage area if the first storage area has the idle load; and if the first storage area does not have empty carriers, transferring the carriers for storing at least one group of materials at the tail end of the production sequence in the first storage area to a three-dimensional warehouse for storage. By the mode, the dynamic balance between the number of the storage carriers in the three-dimensional warehouse and the number of the storage carriers in the production area can be realized, and the first storage area can always keep a certain no-load position so as to improve the production efficiency; but also can reduce the occupied area of the products in the waiting production process and increase the use efficiency of the field, thereby effectively utilizing the space of the factory building.

Description

Material scheduling method and device and computer readable storage medium
Technical Field
The present application relates to the field of warehousing management, and in particular, to a method and an apparatus for scheduling materials, and a computer-readable storage medium.
Background
With the development of modern industry and computer technology, the requirements on intelligent technology are higher and higher, the control and management requirements of logistics in factories are real-time and accurate, and meanwhile, higher requirements are provided for space utilization rate.
In the workshop production process, a three-dimensional warehouse is usually used for storing semi-finished products and finished products. The three-dimensional warehouse is of a multi-layer structure, and can store flatly placed articles three-dimensionally so as to save floor area. In the prior art, after a semi-finished product or a finished product is transported to a warehouse entry of a three-dimensional warehouse, the three-dimensional warehouse can be automatically placed at a specific warehouse position, the corresponding relation between the warehouse position and an article to be placed in the warehouse position is recorded, when the article needs to be lifted, a request is lifted to the three-dimensional warehouse through manual input or a two-dimensional code scanning mode, and the three-dimensional warehouse takes out the article from the corresponding warehouse position of the article after receiving the request and places the article to a warehouse exit.
However, this method only depends on manual management, which is not only inefficient, but also costly, and cannot automatically achieve dynamic balance between the number of carriers stored in the three-dimensional warehouse and the number of carriers stored in the production area during the production process, thereby failing to effectively utilize the space of the factory building and also failing to improve the production efficiency.
Disclosure of Invention
The technical problem mainly solved by the application is to provide a material scheduling method, a material scheduling device and a computer-readable storage medium, and the problems that the space of a factory building cannot be effectively utilized and the production efficiency cannot be improved can be solved by intelligently detecting the storage conditions of materials and carriers in a production area and a three-dimensional warehouse.
In order to solve the above technical problem, one technical solution adopted by the present application is to provide a material scheduling method, including: detecting the number of idle bits of the first storage area according to a first set frequency; the first storage area is used for storing carriers of materials to be produced on line; in response to the number of empty carriers being less than a first set number, if empty carriers are present in the first storage area, transferring the empty carriers to a second storage area; and if the first storage area does not have empty carriers, transferring the carriers for storing at least one group of materials at the tail end of the production sequence in the first storage area to a three-dimensional warehouse for storage.
If the first storage area does not have empty carriers, the step of transferring the carriers for storing at least one group of materials at the tail end of the production sequence in the first storage area to a three-dimensional warehouse for storage specifically comprises the following steps: if the first storage area does not have empty carriers, the carriers for storing at least one group of materials at the tail end of the production sequence are transferred to a third storage area; and detecting the number of idle load positions of the third storage area according to a second set frequency, and conveying the carrier storing at least one group of materials at the tail end of the production sequence to the three-dimensional warehouse for storage in response to the fact that the number of idle load positions is smaller than the second set number.
Wherein the second set number is the total number of bits of the third storage area.
The second set frequency is not less than the first set frequency.
Wherein, if the first storage area does not have empty carrier, after the step of transporting the carrier of depositing the last at least a set of material of production order in first storage area to the stereo garage and store, still include: detecting the production sequence of the materials in the three-dimensional warehouse according to a third set frequency; responding to at least one group of materials at the forefront of the production sequence in the three-dimensional library, detecting the number of idle load positions of a first storage area according to a first set frequency, and judging whether the number of the idle load positions is smaller than a first set number; and in response to the number of the idle positions not less than a first set number, conveying the carrier, in which at least one group of materials at the forefront of the production sequence are stored, in the three-dimensional warehouse to a first storage area.
Wherein, in response to the presence of at least one group of materials at the forefront of the production sequence in the three-dimensional warehouse, the step of detecting the number of idle load positions of the first storage area according to a first set frequency and judging whether the number of idle load positions is less than a first set number further comprises: and responding to the condition that the number of the idle positions is smaller than a first set number, if the first storage area has idle carriers, transferring the idle carriers to a second storage area, and transferring the carriers, which store at least one group of materials at the forefront of the production sequence, in the three-dimensional library to the first storage area.
Wherein, in response to the presence of at least one group of materials at the forefront of the production sequence in the three-dimensional warehouse, the step of detecting the number of idle load positions of the first storage area according to a first set frequency and judging whether the number of idle load positions is less than a first set number further comprises: and responding to the condition that the number of the idle load positions is smaller than a first set number, if the first storage area does not have the idle carriers, transferring the carriers storing at least one group of materials at the tail end of the production sequence in the first storage area to a three-dimensional warehouse for storage, and transferring the carriers storing at least one group of materials at the front end of the production sequence in the three-dimensional warehouse to the first storage area.
Wherein the third preset frequency is less than the first preset frequency.
In order to solve the above technical problem, another technical scheme adopted by the present application is to provide a material scheduling device, including: a memory for storing program data which when executed performs the steps in the material scheduling method as in any one of the above; a processor for executing program instructions stored in the memory to implement the steps in the material scheduling method as claimed in any one of the above.
In order to solve the above technical problem, a further technical solution adopted by the present application is to provide a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps in the material scheduling method according to any one of the above.
The beneficial effect of this application is: different from the prior art, the method and the device have the advantages that the number of the idle load positions of the first storage area is detected according to the first set frequency, when the number of the idle load positions is smaller than the first set number, the idle carriers are transferred preferentially under the condition that the empty carriers are available, and the carriers for storing at least one group of materials at the tail end of the production sequence are transferred to the three-dimensional warehouse under the condition that the empty carriers are not available, so that the dynamic balance between the number of the carriers stored in the three-dimensional warehouse and the number of the carriers stored in the production area are automatically realized, the first storage area can be always kept at a certain idle load position, the materials transported from the previous process can be received at any time, and the production efficiency is improved; but also can reduce the occupied area of the products in the waiting production process and increase the use efficiency of the field, thereby effectively utilizing the space of the factory building.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a schematic flow chart diagram of an embodiment of a material dispatching method of the present application;
FIG. 2 is a schematic flow chart of one embodiment of step S12 in FIG. 1;
FIG. 3 is a schematic flow chart of the transfer of materials in the three-dimensional warehouse to a first storage area according to the present application;
FIG. 4 is a schematic structural diagram of an embodiment of a material dispatching device according to the present application;
FIG. 5 is a schematic structural diagram of an embodiment of a computer-readable storage medium of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terminology used in the embodiments of the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the examples of this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise, the "plural" includes at least two in general, but does not exclude the presence of at least one.
It should be understood that the term "and/or" as used herein is merely a relationship that describes an associated object, meaning that three relationships may exist, e.g., a and/or B, may represent: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
It should be understood that the terms "comprises," "comprising," or any other variation thereof, as used herein, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of another like element in a process, method, article, or apparatus that comprises the element.
With the development of modern industry and computer technology, the requirements on intelligent technology are higher and higher, the control and management requirements of logistics in factories are real-time and accurate, and meanwhile, higher requirements are provided for space utilization rate.
In the workshop production process, a three-dimensional warehouse is usually used for storing semi-finished products and finished products. The three-dimensional warehouse is of a multi-layer structure, and can store flatly placed articles three-dimensionally so as to save floor area. In the prior art, after a semi-finished product or a finished product is transported to a warehouse entry of a three-dimensional warehouse, the three-dimensional warehouse can be automatically placed at a specific warehouse position, the corresponding relation between the warehouse position and an article to be placed in the three-dimensional warehouse is recorded, when the article needs to be placed out, a request is placed to the three-dimensional warehouse through manual input or a two-dimensional code scanning mode, and the three-dimensional warehouse takes out the article from the corresponding warehouse position of the article after receiving the request and places the article to a warehouse exit.
However, this method can only depend on manual management, which is not only inefficient, but also costly, and cannot automatically achieve dynamic balance between the number of carriers stored in the three-dimensional warehouse and the production area during the production process, thereby failing to effectively utilize the factory space and increasing the production efficiency.
Based on the situation, the application provides a material scheduling method, and the problems that the space of a factory building cannot be effectively utilized and the production efficiency cannot be improved can be solved by intelligently detecting the storage conditions of materials and carriers in a production area and a three-dimensional warehouse.
The present application will be described in detail below with reference to the drawings and embodiments.
Referring to fig. 1, fig. 1 is a schematic flow chart illustrating a material scheduling method according to an embodiment of the present application. As shown in fig. 1, in the present embodiment, the method includes:
s11: detecting the number of idle bits of the first storage area according to a first set frequency; wherein, first storage area is used for depositing the carrier of the material of waiting for the production of getting online.
In this embodiment, the material includes a Printed Circuit Board (PCB), and the PCB is usually placed on the carrier and is bound to the carrier, and is transported by the carrier.
The carriers with the PCBs placed and the binding relationship established with the PCBs are called full carriers, and the carriers without the PCBs placed are called empty carriers.
In the present embodiment, the empty space refers to a space where no carrier is stored.
The loading position refers to an area which is divided according to a certain size and is used for storing the carrier.
In the present embodiment, the first set frequency is 30 s/time.
In other embodiments, the first set frequency may be 20 s/time, 40 s/time or other frequencies, which is not limited in this application.
Specifically, in a factory for batch production, each process has a material being produced and a material waiting for production, when the material produced in the previous process is transported to the next process by a carrier, the material generally needs to enter a first storage area of the next process, and after the material on a production line of the process is processed, the material waiting for on-line production in the first storage area is transported to the production line.
The first storage area comprises no-load positions with a set number, the no-load positions can be used for storing carriers, when materials on the carriers enter a production line, the carriers are changed from full-load tools to empty carriers, the empty carriers need to be transferred away in time, otherwise the empty carriers occupy too many load positions, the number of the no-load positions in the first storage area is insufficient, and the process discharging cannot be stored.
S12: responding to the number of the idle load positions being smaller than a first set number, and transferring the idle load to a second storage area if the first storage area has the idle load; and if the first storage area does not have empty carriers, transferring the carriers for storing at least one group of materials at the tail end of the production sequence in the first storage area to a three-dimensional warehouse for storage.
In this embodiment, the first set number is the number of partial loading bits of the first storage area.
In this embodiment, the second storage area refers to a storage area dedicated to storing empty carriers, i.e., an empty carrier area.
Specifically, the first storage area needs to bear a full-load tool which is transported from the previous process at any time, so that a certain number of idle load positions need to be reserved all the time, and in response to the fact that the number of the idle load positions is smaller than a first set number, it is indicated that the number of the idle load positions in the first storage area is too small to bear the discharging of the previous process, and at this time, if a certain number of the idle load positions are not vacated as soon as possible, the discharging speed of the previous process is affected, and the production efficiency is reduced.
In this embodiment, if there is an empty carrier in the first storage area, the original material on the carrier enters the production line, the carrier is changed from a full carrier to an empty carrier, and at this time, the empty carrier needs to be moved to the empty carrier area, so as to vacate the carrying position occupied by the empty carrier, thereby providing the carrying position capable of storing the carrier for the discharging of the previous process.
Further, if no empty carrier exists in the first storage area, it indicates that all the empty carriers in the first storage area have been transferred, but since the materials to be produced in the production plan of the batch are too many and occupy too many loading positions, the materials at the last end of the production sequence need to be transported to the stereo library for storage, and the empty loading positions are vacated to carry the discharged materials of the upper process, so that the production efficiency is improved.
Specifically, referring to fig. 2, fig. 2 is a schematic flowchart illustrating an embodiment of step S12 in fig. 1. As shown in fig. 2, in the present embodiment, if there is no empty carrier in the first storage area, the step of transferring the carrier storing at least one group of materials at the end of the production sequence in the first storage area to the stereo garage for storage includes:
s21: and if the first storage area does not have empty carriers, transferring the carriers for storing at least one group of materials at the tail end of the production sequence to a third storage area.
In this embodiment, the third storage area is referred to as a stereo bank buffer area.
The three-dimensional library buffer area refers to a temporary parking area of a carrier to be put into the three-dimensional library.
S22: and detecting the number of idle load positions of the third storage area according to a second set frequency, and conveying the carrier storing at least one group of materials at the tail end of the production sequence to the three-dimensional warehouse for storage in response to the fact that the number of idle load positions is smaller than the second set number.
In this embodiment, the second set number is the total number of bits in the third storage area.
Specifically, the third storage area is a buffer area of the three-dimensional warehouse, and all the carriers stored in the third storage area need to enter the three-dimensional warehouse for storage, so that the carriers are immediately conveyed to the three-dimensional warehouse as long as the carriers in the third storage area are detected. The second set number is set to the total number of the loading positions in the third storage area, which means that even if only one loading position is stored with the carriers, the carriers need to be transported to the three-dimensional warehouse.
In the present embodiment, the second set frequency is not less than the first set frequency.
Wherein the second set frequency is 30 s/time.
In other embodiments, the second set frequency may be 20 s/time, 40 s/time or other frequencies, which is not limited in this application.
In the embodiment, because the carrier which is used for carrying no-load tools or storing at least one group of materials at the tail end of the production sequence is transferred out of the first storage area in time, the occupied area of the first storage area can be reduced, and the first storage area is not required to be provided with redundant carrying positions, so that the occupied area of products in the waiting production process is effectively reduced, the use efficiency of a site is increased, and the space of a factory building is effectively utilized.
Furthermore, except for guaranteeing that the discharging of the previous working procedure is not influenced, the production requirements of the materials to be produced stored in the three-dimensional library are considered, and when no-load positions larger than a first set quantity exist in the first storage area or the materials at the tail end of the production plan exist, the materials in the three-dimensional library in the previous production batch are conveyed to the first storage area so as to be processed in time.
Specifically, please refer to fig. 3, fig. 3 is a schematic flow chart illustrating a process of transferring a material in a three-dimensional library to a first storage area according to the present application. As shown in fig. 3, the present embodiment includes:
s31: and detecting the production sequence of the materials in the three-dimensional library according to a third set frequency.
In this embodiment, the third predetermined frequency is smaller than the first predetermined frequency.
Wherein the third preset frequency is 2 min/time.
In other embodiments, the third preset frequency may also be 1 min/time, 3 min/time or more, which is not limited in this application.
Because this application is the priority and guarantees that first storage area has sufficient no-load position in order to deposit the process ejection of compact, therefore the frequency that detects the material of waiting to produce in the three-dimensional storehouse is lower than the frequency that detects no-load position in the first storage area.
In this embodiment, the production sequence of the materials in the three-dimensional library is detected according to the third set frequency, so as to determine whether there is a material that has entered the previous production batch in the three-dimensional library.
Specifically, when the materials stored in the three-dimensional warehouse in the production sequence are transported to the three-dimensional warehouse, the materials are stored in the three-dimensional warehouse at the tail of the production plan queue, and therefore the processing of the materials is not affected. When the materials arranged in the first storage area at the front batch of the production plan are processed, the materials stored in the three-dimensional warehouse enter the front batch in the production sequence, and when at least one group of materials at the front end of the production sequence in the three-dimensional warehouse is detected, the materials need to be transported to the first storage area again.
S32: and responding to at least one group of materials at the forefront of the production sequence in the three-dimensional library, detecting the number of idle load positions in the first storage area according to a first set frequency, and judging whether the number of the idle load positions is less than a first set number.
In the present embodiment, if the determination result is no, S33 is performed; if the determination result is yes, S34 or S35 is performed.
S33: and in response to the number of the idle positions not less than a first set number, conveying the carrier, in which at least one group of materials at the forefront of the production sequence are stored, in the three-dimensional warehouse to a first storage area.
In this embodiment, in response to the number of empty load positions not being less than the first set number, it indicates that there are enough empty load positions in the first storage area, and the carrier is capable of bearing at least one group of materials at the forefront of the production sequence in the three-dimensional warehouse.
S34: and responding to the condition that the number of the idle positions is smaller than a first set number, if the first storage area has idle carriers, transferring the idle carriers to a second storage area, and transferring the carriers, which store at least one group of materials at the forefront of the production sequence, in the three-dimensional library to the first storage area.
In this embodiment, in response to that the number of empty load positions is smaller than the first set number, it indicates that the number of empty load positions in the first storage area is insufficient, and the carrier cannot carry at least one set of materials at the forefront of the production sequence in the three-dimensional library.
If there are empty carriers in the first storage area, the empty carriers can be transported directly to the empty carrier area to free up a certain number of empty spaces.
Further, if the empty carriers are all transported out and the number of empty positions is not enough, the next logic can be executed, and the carrier which is used for storing at least one group of materials at the tail end of the production sequence in the first storage area at present is transferred to the three-dimensional warehouse for storage.
S35: and responding to the condition that the number of the idle load positions is smaller than a first set number, if the first storage area does not have the idle carriers, transferring the carriers storing at least one group of materials at the tail end of the production sequence in the first storage area to a three-dimensional warehouse for storage, and transferring the carriers storing at least one group of materials at the front end of the production sequence in the three-dimensional warehouse to the first storage area.
In the embodiment, by detecting the materials in the three-dimensional warehouse which are in the previous production batch and conveying the carrier storing at least one group of materials at the forefront end of the production sequence in the three-dimensional warehouse to the first storage area, the production requirements of the materials in the three-dimensional warehouse can be considered, and delay of on-line production of the materials is avoided.
Different from the prior art, the method and the device have the advantages that the number of the idle load positions of the first storage area is detected according to the first set frequency, when the number of the idle load positions is smaller than the first set number, the idle carriers are transferred preferentially under the condition that the empty carriers are available, and the carriers for storing at least one group of materials at the tail end of the production sequence are transferred to the three-dimensional warehouse under the condition that the empty carriers are not available, so that the dynamic balance between the number of the carriers stored in the three-dimensional warehouse and the number of the carriers stored in the production area are automatically realized, the first storage area can be always kept at a certain idle load position, the materials transported from the previous process can be received at any time, and the production efficiency is improved; but also can reduce the occupied area of the products in the waiting production process and increase the use efficiency of the field, thereby effectively utilizing the space of the factory building.
Correspondingly, the application provides a material scheduling device.
Specifically, please refer to fig. 4, fig. 4 is a schematic structural diagram of an embodiment of a material scheduling device according to the present application. As shown in fig. 4, the material scheduling device 40 includes a memory 41 and a processor 42 coupled to each other.
In this embodiment, the memory 41 is used for storing program data, and the program data can realize the steps in the material scheduling method according to any one of the above embodiments when executed; the processor 42 is configured to execute the program instructions stored in the memory 41 to implement the steps in any of the above embodiments or the steps correspondingly executed by the material scheduling apparatus in any of the above embodiments. The material scheduling device 40 may further include a touch screen, a communication circuit, etc. according to requirements, in addition to the processor 42 and the memory 41, which is not limited herein.
In particular, the processor 42 is configured to control itself and the memory 41 to implement the steps in any of the above-described embodiments of the trajectory acquisition method. Processor 42 may also be referred to as a CPU (Central Processing Unit). The processor 42 may be an integrated circuit chip having signal processing capabilities. The Processor 42 may also be a general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. In addition, processor 42 may be commonly implemented by a plurality of integrated circuit chips.
Different from the prior art, the application provides a material scheduling device, which can detect the number of idle load positions of a first storage area according to a first set frequency, preferentially transfer the idle load under the condition that the idle load positions are smaller than the first set number, and transfer a carrier for storing at least one group of materials at the tail of a production sequence to a three-dimensional warehouse under the condition that the idle load is absent, so that the dynamic balance between the number of carriers stored in the three-dimensional warehouse and a production area is automatically realized, a certain idle load position can be always kept in the first storage area, the materials transported from the previous process can be received at any time, and the production efficiency is improved; but also can reduce the occupied area of the products in the waiting production process and increase the use efficiency of the field, thereby effectively utilizing the space of the factory building.
Accordingly, the present application provides a computer-readable storage medium.
Referring to fig. 5, fig. 5 is a schematic structural diagram of an embodiment of a computer-readable storage medium according to the present application.
As shown in fig. 5, the computer-readable storage medium 50 includes a computer program 501 stored on the computer-readable storage medium 50, and when executed by the processor, the computer program 501 implements the steps in any of the above embodiments or the steps correspondingly executed by the material scheduling apparatus in the above embodiments.
In particular, the integrated unit, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in a computer readable storage medium 50. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a computer-readable storage medium 50 and includes several instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the method of the embodiments of the present application. And the aforementioned computer-readable storage medium 50 includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk, and various media capable of storing program codes.
In the several embodiments provided in the present application, it should be understood that the disclosed method and apparatus may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a module or a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or units through some interfaces, and may be in an electrical, mechanical or other form.
Units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above description is only for the purpose of illustrating embodiments of the present application and is not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application or are directly or indirectly applied to other related technical fields, are also included in the scope of the present application.

Claims (10)

1. A material scheduling method, comprising:
detecting the number of idle bits of the first storage area according to a first set frequency; the first storage area is used for storing carriers of materials to be produced on line;
in response to the number of empty bits being less than a first set number, if there are empty vehicles in the first storage area, transferring the empty vehicles to a second storage area;
and if the empty carrier does not exist in the first storage area, transferring the carrier storing at least one group of materials at the tail end of the production sequence in the first storage area to a three-dimensional warehouse for storage.
2. The material scheduling method according to claim 1, wherein if the empty carrier does not exist in the first storage area, the step of transferring the carrier storing at least one group of materials at the last production sequence in the first storage area to a stereo garage for storage comprises:
if the empty carrier does not exist in the first storage area, transferring the carrier for storing at least one group of materials at the tail end of the production sequence to a third storage area;
and detecting the number of idle load positions of the third storage area according to a second set frequency, and in response to the number of idle load positions being smaller than a second set number, conveying the carrier storing at least one group of materials at the tail end of the production sequence to the three-dimensional warehouse for storage.
3. The material scheduling method according to claim 2, wherein the second set number is the total number of the loading positions of the third storage area.
4. The material dispatching method of claim 2, wherein the second set frequency is not less than the first set frequency.
5. The material scheduling method according to claim 1, wherein after the step of transferring the carrier storing at least one group of materials at the last production sequence in the first storage area to a stereo library for storage if the empty carrier does not exist in the first storage area, the method further comprises:
detecting the production sequence of the materials in the three-dimensional warehouse according to a third set frequency;
responding to at least one group of materials at the forefront of the production sequence in the three-dimensional warehouse, detecting the number of the idle load positions in the first storage area according to the first set frequency, and judging whether the number of the idle load positions is smaller than the first set number;
and in response to the number of the empty loading positions not being less than the first set number, transporting the carrier, in which at least one group of materials at the forefront of the production sequence are stored, in the three-dimensional warehouse to the first storage area.
6. The material scheduling method according to claim 5, wherein the step of detecting the number of empty loading positions in the first storage area according to the first set frequency in response to the presence of at least one group of materials at the forefront of the production order in the three-dimensional library, and determining whether the number of empty loading positions is smaller than the first set number further comprises:
responding to the number of the empty spaces being smaller than the first set number, if the empty carriers exist in the first storage area, transferring the empty carriers to the second storage area, and transferring the carriers, in which at least one group of materials at the forefront of the production sequence are stored, in the three-dimensional warehouse to the first storage area.
7. The material scheduling method according to claim 6, wherein the step of detecting the number of empty bits in the first storage area according to the first set frequency in response to the presence of at least one group of materials at the forefront of the production order in the three-dimensional library, and determining whether the number of empty bits is smaller than the first set number further comprises:
in response to the number of the empty spaces being smaller than the first set number, if the empty carriers do not exist in the first storage area, the carriers storing at least one group of materials at the tail end of the production sequence in the first storage area are transferred to the stereo garage for storage, and the carriers storing at least one group of materials at the front end of the production sequence in the stereo garage are transferred to the first storage area.
8. The material scheduling method according to claim 7, wherein the third preset frequency is less than the first preset frequency.
9. A material scheduling apparatus, comprising:
a memory for storing program data which when executed implement the steps in a material scheduling method according to any one of claims 1 to 8;
a processor for executing the program instructions stored by the memory to implement the steps in the material scheduling method according to any one of claims 1 to 8.
10. A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the material scheduling method according to any one of claims 1 to 8.
CN202110522075.6A 2021-05-13 2021-05-13 Material scheduling method and device and computer readable storage medium Pending CN115345397A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110522075.6A CN115345397A (en) 2021-05-13 2021-05-13 Material scheduling method and device and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110522075.6A CN115345397A (en) 2021-05-13 2021-05-13 Material scheduling method and device and computer readable storage medium

Publications (1)

Publication Number Publication Date
CN115345397A true CN115345397A (en) 2022-11-15

Family

ID=83947107

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110522075.6A Pending CN115345397A (en) 2021-05-13 2021-05-13 Material scheduling method and device and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN115345397A (en)

Similar Documents

Publication Publication Date Title
CN113233068B (en) Goods sorting method, device, computer equipment and storage medium
WO2022100016A1 (en) Intelligent warehousing storage location allocation method and apparatus, computer device, and storage medium
CN112678409B (en) Cargo handling method, apparatus, device, system, storage medium, and program product
CN112278674B (en) Scheduling method, device, equipment and storage medium
JP2022050386A (en) Order processing method, unit, device, system, and recording medium
CN107544513B (en) Anti-deadlock scheduling method and device for multi-capacity automatic guided vehicle
CN110348778B (en) Order item picking system and method
CN111252432A (en) Warehousing management method and device, computer readable storage medium and warehousing system
CN111292045B (en) Exit management method for intelligent warehouse
CN113393182A (en) Storage method and device for material box and intelligent storage system
CN112966977A (en) Task allocation method and device, control terminal and warehousing system
CN113071845B (en) Conveying line determining method, device, equipment, warehousing system and storage medium
CN113200275A (en) Packing box arranging method, device, equipment, storage system and storage medium
CN111738551A (en) Task allocation method, device, equipment and storage medium
WO2023169533A1 (en) Order processing method and device, server, and storage medium
CN116588569A (en) Warehouse material warehouse-in and warehouse-out control method and control system thereof
CN115293654A (en) Shuttle vehicle task scheduling method and device and computer equipment
JP2003201003A (en) Automated warehouse control system
CN117649173A (en) Method and device for managing wire ingot storage
CN115345397A (en) Material scheduling method and device and computer readable storage medium
JPH038602A (en) Rack deciding method for automatic warehouse
CN114019960A (en) Scheduling method and device for multi-robot delivery
JP5020617B2 (en) Article storage method of automatic warehouse
CN111275373B (en) Efficiency acquisition method, system and equipment of elevator and readable storage medium
CN118125248B (en) Multi-floor dynamic scheduling method and device for lift car lifting system

Legal Events

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