CN113011739A - Rolling scheduling method and computer readable storage medium for satellite production - Google Patents
Rolling scheduling method and computer readable storage medium for satellite production Download PDFInfo
- Publication number
- CN113011739A CN113011739A CN202110289951.5A CN202110289951A CN113011739A CN 113011739 A CN113011739 A CN 113011739A CN 202110289951 A CN202110289951 A CN 202110289951A CN 113011739 A CN113011739 A CN 113011739A
- Authority
- CN
- China
- Prior art keywords
- time
- order
- satellite
- orders
- final assembly
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 115
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 49
- 238000005096 rolling process Methods 0.000 title claims abstract description 41
- 238000003860 storage Methods 0.000 title claims abstract description 16
- 238000012163 sequencing technique Methods 0.000 claims description 21
- 238000012384 transportation and delivery Methods 0.000 claims description 15
- 238000013439 planning Methods 0.000 claims description 11
- 238000012545 processing Methods 0.000 claims description 7
- 238000004364 calculation method Methods 0.000 claims description 5
- 238000004590 computer program Methods 0.000 claims description 5
- 239000000725 suspension Substances 0.000 claims description 5
- 230000001174 ascending effect Effects 0.000 claims description 3
- 238000003754 machining Methods 0.000 claims description 3
- 238000001514 detection method Methods 0.000 description 13
- 238000009434 installation Methods 0.000 description 13
- 238000012360 testing method Methods 0.000 description 6
- 108091092919 Minisatellite Proteins 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 238000007689 inspection Methods 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 239000000463 material Substances 0.000 description 3
- 238000005259 measurement Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000012423 maintenance Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000005070 sampling Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000010923 batch production Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000005253 cladding Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
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/06316—Sequencing of tasks or work
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Manufacturing & Machinery (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a rolling scheduling method and a computer readable storage medium for satellite production, wherein the method comprises the following steps: s0010: acquiring order information through terminal equipment, splitting the order into single satellite orders, and splitting the single satellite orders into unit orders according to a BOM structure; s0020: acquiring the working time of each process through the terminal equipment and calculating the process time of the partial shipment order; s0030: performing partial binding single rolling production scheduling; s0040: checking whether the partial binding orders under the final assembly order are completely sleeved or not, and if the partial binding orders under the final assembly order are completely sleeved, moving the partial binding orders into a final assembly production scheduling platform; ordering the final assembly orders in the scheduling platform; s0050: and performing rolling scheduling of the final assembly order.
Description
Technical Field
The present invention relates to the field of satellite production, and more particularly, to a rolling scheduling method and a computer-readable storage medium for satellite production.
Background
With the rapid development of commercial aerospace, the annual production of satellites is also increasing dramatically. Thereby placing higher demands on the batch capacity of the satellite production line. In order to fully exert the resources of enterprises and improve the batch production capacity of satellites, the enterprises need to have a set of planned production scheduling method which meets the characteristics of the industry. The production scheduling method mainly comprises the following steps: an infinite capacity scheduling method and a limited capacity scheduling method.
The infinite capacity scheduling method comprises the following steps: assuming infinite capacity, a static material demand of infinite capacity is generated, which cannot accurately reflect the actual demand and correctly grasp the available material acquisition lead time.
In order to overcome the problem which cannot be solved by the traditional infinite capacity scheduling method, the finite capacity scheduling method is provided. The limited-capacity scheduling method solves the problem of dynamic process management which cannot be solved by the limited-capacity scheduling method, and the limited-capacity scheduling method is based on an optimization plan of limited resource capacity and considers real conditions of enterprise resource capacity, time, products, constraint conditions, logical relations and the like in production at the same time.
Static, rough management and dynamic real-time precise management are the biggest differences between the infinite capacity scheduling method and the finite capacity scheduling method. However, the limited capacity scheduling method still has the following disadvantages:
1) the economic efficiency can not be maximized, so that the production resources can not be reasonably utilized;
2) the traditional limited capacity scheduling method cannot be combined with the actual production condition on site to update the latest plan in a rolling way;
3) for the rework and repair in production, because the rework and repair is an unplanned order, the time for effectively eliminating the rework and repair can not provide reasonable actual capacity, thereby affecting the production scheduling result.
Disclosure of Invention
To solve at least one of the technical problems set forth in the background, it is an object of the present invention to provide a rolling scheduling method for satellite production, the method comprising:
s0010: acquiring order information through terminal equipment, splitting the order into single satellite orders, and splitting the single satellite orders into unit orders according to a BOM structure;
s0020: acquiring the working time of each process through the terminal equipment and calculating the process time of the partial shipment order;
s0030: performing partial binding single rolling production scheduling;
s0040: checking whether the partial binding orders under the final assembly order are completely sleeved or not, and if the partial binding orders under the final assembly order are completely sleeved, moving the partial binding orders into a final assembly production scheduling platform; ordering the final assembly orders in the scheduling platform;
s0050: and performing rolling scheduling of the final assembly order.
The S0010 includes:
s0011: sequencing the single satellite orders, wherein the priority of sequencing conditions is the submission date and the order number from high to low; performing complete set checking on the single satellite order, moving the complete set of order to a production scheduling platform and according to the satellite model;
s0012: performing secondary sequencing on the orders entering the scheduling platform;
s0013: and splitting the secondary ordered orders into the partial orders according to the BOM structure.
The S0020 includes:
counting the starting time and the planned completion time of each process:
the starting time of the process is the finishing time of the previous process; the planned completion time of the process is the completion time of the previous process plus the rated working hours of the process;
calculating the planned starting time and the planned finishing time of each procedure of the partial binding list;
the planned start time of the partial order and the start time of the first step are the work unit allowable time, and the planned end time of the partial order is the sum of the rated man-hours of the steps included in the partial order and the planned start time.
The partially bound sheet rolling scheduling includes:
releasing the finished partial shipment orders, and preferentially scheduling the started partial shipment orders; performing rolling sequencing on the working procedures in the machining or pause state; if any one of the loading orders placed by the single satellite order is not worked on, the plan can be adjusted; if the status of any one of the bound sheets placed in the single satellite order is in process or in suspension, the plan cannot be adjusted.
The rolling sorting of the process in the state of processing or pausing comprises the following steps:
performing time rolling calculation on the working procedure in the working state and the pause state, and if the planned completion time of the working procedure is greater than the actual time, remaining planned time t1Subtracting the actual elapsed time from the scheduled time; if the planned completion time is less than the actual time spent, the remaining planned time t1N% of the scheduled time; using the remaining planning time t1The process steps in the process or in the pause are sequenced.
The secondary sorting specifically comprises:
s00121: if the satellite type of the current order is a big satellite, the sequence of the current order is unchanged; if the satellite type of the current order is a small satellite, changing the identification state of the current order into S;
s00122: if the satellite type of the current order is a small satellite, detecting the satellite type of the next order, and if the satellite type of the current order is the small satellite, marking the state of the next order as T;
s00123: retrieving the satellite type of the current order as a small satellite, if the satellite type of the next order is a big satellite, comparing the delivery time of the current order and the next order, and if the delivery time of the current order is more than five days earlier than that of the next order, ascending the order with the first satellite type as the small satellite after the next order to the rear of the current order; if the delivery time of the current order is longer than the time length of the next order by more than five days, the sequence of the current order is moved to the back of the next order and the marking state is T;
s00124: if the satellite type of the current order is a small satellite and all the orders ranked afterwards are large satellite orders, the identification state of the current order is T;
s00125: and circularly executing the steps S00121 to S00124, sequentially detecting all orders in the sequence until the order is ended when all the identification states S are T, and generating secondary sequence.
The sequencing of the final assembly orders in the scheduling platform comprises the following steps:
and sequencing the final assembly orders of the production scheduling platform, wherein the priority of the sequencing conditions is the complete set time, the delivery date of the final assembly orders and the order numbers from top to bottom in sequence.
The S0050 specifically includes:
releasing the finished final assembly order, and preferentially arranging the final assembly order which is already worked on for scheduling;
performing time rolling calculation on the final assembly process in the states of processing and suspension, and if the rated working time of the process is greater than the actual time spent, remaining planned time t of the final assembly order2Subtracting the actual elapsed time from the scheduled time; if the rated working time is less than the actual time, the residual planning time t2N% of the scheduled time; using the remaining planning time t2The process steps in the process or in the pause are sequenced.
A second aspect of the present invention provides a computer-readable storage medium having stored therein instructions which, when run on a computer, cause the computer to perform the rolling scheduling method set forth in the first aspect of the present invention.
A third aspect of the present invention proposes a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method of rolling scheduling as proposed in the first aspect of the present invention when executing the program.
The invention has the following beneficial effects:
aiming at the performability of production planning in the satellite assembly industry, the invention provides a method for realizing staged rolling production scheduling. The whole plan is divided into two parts by combining the limited capacity of workshop resources, namely, the plan is more practical and more executable by double rolling before and after final assembly, the plan is allowed to be adjusted manually, rolling operation is carried out by combining the actual processing conditions on site, the production plan is compiled by considering various factors influencing the plan, such as complete sets, working calendars, capacity, delivery date, process planning working hours, rework and repair and the like, and the bottleneck resources are reasonably utilized to carry out intelligent production scheduling of the production plan according to the characteristics of the satellite assembly industry.
Drawings
FIG. 1 is a diagram illustrating steps of a rolling scheduling method for satellite production according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating the steps of a quadratic ranking of a rolling scheduling method for satellite production according to an embodiment of the present invention;
fig. 3 shows a schematic diagram of the structure of the computer system.
Detailed Description
In order to more clearly illustrate the invention, the invention is further described below with reference to preferred embodiments and the accompanying drawings. Similar parts in the figures are denoted by the same reference numerals. It is to be understood by persons skilled in the art that the following detailed description is illustrative and not restrictive, and is not to be taken as limiting the scope of the invention.
One embodiment of the present invention provides a rolling scheduling method for satellite production, as shown in fig. 1, which is divided into a pre-assembly scheduling and a final assembly scheduling;
the scheduling before final assembly includes:
s0010: acquiring order information through terminal equipment, and splitting the order into single satellite orders;
s0011: the split orders are subjected to complete inspection according to the delivery date sequence (when the submission dates are the same, the orders are sorted according to the delivery date and the order numbers), the orders which are not completely matched do not enter the production scheduling platform, and the orders which are completely matched enter the production scheduling platform;
s0012: performing secondary sequencing on the orders entering the scheduling platform, and performing subdivision sequencing according to the satellite models to realize economic batch maximization;
s0013: splitting the secondary ordered order according to a BOM hierarchical structure (bill of materials) to obtain a partial binding order; the partial shipment orders comprise a positive X cabin plate assembly, a negative X cabin plate assembly, a positive Y cabin plate assembly, a negative Y cabin plate assembly, a positive Z cabin plate assembly and a negative Z cabin plate assembly;
as shown in fig. 2, the secondary sorting specifically includes:
a: if the satellite model of the current order is a big satellite, the sequence position is unchanged, and if the satellite model is a small satellite, the identification state is S;
b: if the satellite model of the current order is searched to be a small satellite, checking whether the next ordered satellite is the small satellite or not, and if so, marking the next satellite and the satellite state as T;
c: if the satellite model of the current order is searched for is a small satellite and the next order is a big satellite, the delivery time of the two satellites is compared: when the delivery time of the current order is more than 5 days earlier than that of the next big ordered satellite, the first small satellite behind the big satellite is sequentially ascending behind the small satellite for sequencing, and if the delivery time of the next big ordered satellite is more than 5 days later than that of the next big ordered satellite, the current ordered order is placed behind the next big ordered satellite and the state is marked as T;
d: if the satellite type of the current order is a small satellite and the satellite types of the orders ranked behind the small satellite are all big satellite orders, keeping the ranking unchanged, and marking the state of the small satellite as T;
e: and sequentially checking all orders in the sequence, and circulating the A-D until the marking states S are all T, so as to generate the final sequence.
S0020: the working time of each procedure corresponding to each assembly order is obtained through the terminal equipment, the procedure time for placing each assembly order by a single satellite order is calculated and shown in a table 1-2, and the starting time of the procedure is the finishing time of the previous procedure; the planned completion time of the process is the completion time of the previous process plus the rated working hours of the process, and the starting time and the ending time of placing the order of each assembly by the single satellite order with the order number of 10000001 are obtained; the starting time of the partial order is the allowable working time of a working unit; eliminating the time of equipment maintenance, non-working days and the like in the maintenance working calendar;
s0030: rolling production scheduling of the partial binding sheets is carried out, the reworked and reworked partial binding sheets are brought into a production scheduling pool for production scheduling, finished partial binding orders are released, and production scheduling of the started partial binding orders is carried out preferentially; performing rolling sequencing on the working procedures in the machining or pause state;
if any one of the loading orders made by the single satellite order is not worked on, the plan can be adjusted; if the status of any one of the bound sheets placed in the single satellite order is in process or in suspension, the plan cannot be adjusted.
The rolling sorting of the process in the state of processing or pausing comprises the following steps:
the time rolling calculation is performed for the working procedure in the working and pause states, and if the planned completion time (i.e. rated working hours) of the working procedure is longer than the actual time, the planned time t is left1Subtracting the actual elapsed time from the scheduled time;
if the planned completion time is less than the actual time spent, the remaining planned time t1N% of the scheduled time; n is greater than zero, as the case may be, preferably n is set to 15;
the remaining planned time t1For sequencing in-process or in-pause processes.
TABLE 1 Positive X Hatch board Assembly procedure time
TABLE 2 Process time for each part of the Assembly order
| Order numbering | Name of order | Type of order | Working unit | Scheduled start time | Scheduled end time |
| 10000001-1 | Positive X cabin board subassembly | Partial installation stage | Partial installation station 1 | 2020-10-10 8:00 | 2020-10-10 15:00 |
| 10000001-2 | Negative X cabin plate assembly | Partial installation stage | Partial installation station 2 | 2020-10-10 15:30 | 2020-10-11 10:30 |
| 10000001-3 | Positive Y cabin board subassembly | Partial installation stage | Partial installation station 5 | 2020-10-10 8:00 | 2020-10-10 16:00 |
| 10000001-4 | Negative Y cabin plate assembly | Partial installation stage | Partial installation station 4 | 2020-10-10 8:00 | 2020-10-10 15:30 |
| 10000001-5 | Positive Z deck board subassembly | Partial installation stage | Partial installation station 3 | 2020-10-10 8:00 | 2020-10-11 11:00 |
| 10000001-6 | Negative Z cabin plate assembly | Partial installation stage | Partial installation station 2 | 2020-10-10 8:00 | 2020-10-11 10:30 |
The final assembly scheduling comprises:
s0040: checking whether the partial binding orders under the final assembly order are completely sleeved or not, and if the partial binding orders under the final assembly order are completely sleeved, moving the partial binding orders into a final assembly production scheduling platform; sequencing the final assembly orders in the scheduling platform, wherein the priority of a sequencing rule is the complete set time, the delivery date of the final assembly orders and the order numbers from high to low in sequence;
according to the complete set information, the start time of the final assembly of the whole satellite order (single satellite order) is the earliest time min t of the complete set of the final assembly orderNeat sleeveThe final time of the final assembly of the whole star order is the earliest time min t of the complete set of the final assembly orderNeat sleeveTime of sequence conversion tRotating shaftAnd total assembly time tGeneral assemblySumming;
the final assembly and production scheduling process comprises the following steps: general assembly, electrical measurement, cladding, thermal control, accurate measurement, solar wing installation, quality measurement, vibration, thermal vacuum (the thermal vacuum is sampling inspection) and leakage detection;
calculating the planned starting time and ending time of each process (except for thermal vacuum) according to the method;
the hot vacuum is a sampling inspection process, and the scheduling of the hot vacuum test specifically comprises the following steps:
s0041: adding the time t from the program completion time of the vibration process to the thermal vacuum processHeat generationAnd the scheduled end time t of the thermal vacuum equipmentThermal deviceThe result of the comparison is tHeat generation≥tThermal deviceOr tHeat generation＜tThermal device；
S0042: when the satellite model is big satellite and tHeat generation≥tThermal deviceThe hot vacuum start time of the order is tHeat generationEnd time tHeat generation+ Heat vacuum testThe whole satellite leakage detection time is sequentially arranged, and the whole satellite leakage detection completion time is used as the end time of the order;
when the satellite model is big satellite and tHeat generation＜tThermal deviceDirectly arranging the whole satellite leakage detection time without performing a thermal vacuum test, and taking the whole satellite leakage detection completion time as the end time of the order;
s0043: when the satellite model is a minisatellite and tHeat generation≥tThermal deviceJudging whether the model of the next sequence order is a small satellite, if so, the hot vacuum starting time of the order and the next satellite is t of the next sequence orderHeat generationEnd time tHeat generationThe time of the thermal vacuum test is used, the whole satellite leakage detection time is arranged in sequence, and the whole satellite leakage detection completion time is used as the end time of the order; when the next satellite is not a moonlet, the hot vacuum start time for this order is tHeat generationEnd time tHeat generationThe time of the thermal vacuum test is used, the whole satellite leakage detection time is arranged in sequence, and the whole satellite leakage detection completion time is used as the end time of the order;
when the satellite model is a minisatellite and tHeat generation＜tThermal deviceThe next satellite is a minisatellite and tHeat generation＜tThermal deviceThe two satellites do not carry out thermal vacuum tests, the whole satellite leakage detection time is directly arranged, and the whole satellite leakage detection completion time is used as the end time of the order;
s0046: when the satellite model is a minisatellite and tHeat generation＜tThermal deviceThe next satellite is a minisatellite and tHeat generation≥tThermal deviceThe two satellites are all tested in the hot vacuum, and the order and the hot vacuum start time of the previous satellite are t of the next small satelliteHeat generationEnd time tHeat generationThe time of the thermal vacuum test is used, the whole satellite leakage detection time is arranged, and the whole satellite leakage detection completion time is used as the end time of the order;
the thermal vacuum process can process two small satellites or one large satellite at a time; through the production scheduling steps, the high utilization rate of the production scheduling pool is realized.
S0050: and (3) performing rolling production scheduling of the assembly order, and bringing the rework and repair department binding list into a production scheduling pool for production scheduling:
releasing the order with finished assembly, and arranging the order in the operator firstly and then arranging the order without operator;
the latest progress data is returned in real time in the finished processes, and the finished processes are removed in the next rolling production; the general assembly order is worked, the current working procedure is finished, and the plan is arranged according to the planned working hours of the following working procedures; when the planned time is greater than the actual spent time in the unprocessed or suspended working process, the planned time t remains2Planned time (rated operating time of the process) -actual elapsed time; when the planning time is less than or equal to the actual time spent, the planning time t remains215% of scheduled time; using the remaining planning time t2The process steps in the process or in the pause are sequenced.
A second embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the rolling scheduling method provided in the first embodiment. In practice, the computer-readable storage medium may take any combination of one or more computer-readable media. The computer readable medium may be a computer readable signal medium or a computer readable storage medium.
A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present embodiment, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
A third embodiment of the present invention provides a computer system adapted to implement the rolling production method provided by the above-described embodiments, as shown in fig. 3, and includes a central processing module (CPU) that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) or a program loaded from a storage section into a Random Access Memory (RAM). In the RAM, various programs and data necessary for the operation of the computer system are also stored. The CPU, ROM, and RAM are connected thereto via a bus. An input/output (I/O) interface is also connected to the bus.
It should be understood that the above-mentioned embodiments of the present invention are only examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention, and it will be obvious to those skilled in the art that other variations or modifications may be made on the basis of the above description, and all embodiments may not be exhaustive, and all obvious variations or modifications may be included within the scope of the present invention.
Claims (10)
1. A rolling scheduling method for satellite production, comprising:
s0010: acquiring order information through terminal equipment, splitting the order into single satellite orders, and splitting the single satellite orders into unit orders according to a BOM structure;
s0020: acquiring the working time of each process through the terminal equipment and calculating the process time of the partial shipment order;
s0030: performing partial binding single rolling production scheduling;
s0040: checking whether the partial binding orders under the final assembly order are completely sleeved or not, and if the partial binding orders under the final assembly order are completely sleeved, moving the partial binding orders into a final assembly production scheduling platform; ordering the final assembly orders in the scheduling platform;
s0050: and performing rolling scheduling of the final assembly order.
2. The method of claim 1,
the S0010 includes:
s0011: sequencing the single satellite orders, wherein the priority of sequencing conditions is the submission date and the order number from high to low; performing complete set checking on the single satellite order, moving the complete set of order to a production scheduling platform and according to the satellite model;
s0012: performing secondary sequencing on the orders entering the scheduling platform;
s0013: and splitting the secondary ordered orders into the partial orders according to the BOM structure.
3. The method of claim 1,
the S0020 includes:
counting the starting time and the planned completion time of each process:
the starting time of the process is the finishing time of the previous process; the planned completion time of the process is the completion time of the previous process plus the rated working hours of the process;
calculating the planned starting time and the planned finishing time of each procedure of the partial binding list;
the planned start time of the partial order and the start time of the first step are the work cell allowable time, and the planned end time of the partial order is the sum of the rated man-hours of the steps included in the partial order and the planned start time.
4. The method of claim 1,
the partially bound sheet rolling scheduling includes:
releasing the finished partial shipment orders, and preferentially scheduling the started partial shipment orders; performing rolling sequencing on the working procedures in the machining or pause state; if any one of the loading orders placed by the single satellite order is not worked on, the plan can be adjusted; if the status of any one of the bound sheets placed in the single satellite order is in process or in suspension, the plan cannot be adjusted.
5. The method of claim 4,
the rolling sorting of the process in the state of processing or pausing comprises the following steps:
performing time rolling calculation on the working procedure in the working state and the pause state, and if the planned completion time of the working procedure is greater than the actual time, remaining planned time t1Subtracting the actual elapsed time from the scheduled time; if the planned completion time is less than the actual time spent, the remaining planned time t1N% of the scheduled time; using the remaining planning time t1The process steps in the process or in the pause are sequenced.
6. The method of claim 2,
the secondary sorting specifically comprises:
s00121: if the satellite type of the current order is a big satellite, the sequence of the current order is unchanged; if the satellite type of the current order is a small satellite, changing the identification state of the current order into S;
s00122: if the satellite type of the current order is a small satellite, detecting the satellite type of the next order, and if the satellite type of the current order is the small satellite, marking the state of the next order as T;
s00123: retrieving the satellite type of the current order as a small satellite, if the satellite type of the next order is a big satellite, comparing the delivery time of the current order and the next order, and if the delivery time of the current order is more than five days earlier than that of the next order, ascending the order with the first satellite type as the small satellite after the next order to the rear of the current order; if the delivery time of the current order is longer than the time length of the next order by more than five days, the sequence of the current order is moved to the back of the next order and the marking state is T;
s00124: if the satellite type of the current order is a small satellite and all the orders ranked afterwards are large satellite orders, the identification state of the current order is T;
s00125: and circularly executing the steps S00121 to S00124, sequentially detecting all orders in the sequence until the order is ended when all the identification states S are T, and generating secondary sequence.
7. The method of claim 1,
the sequencing of the final assembly orders in the scheduling platform comprises the following steps:
and sequencing the final assembly orders of the production scheduling platform, wherein the priority of the sequencing conditions is the complete set time, the delivery date of the final assembly orders and the order numbers from top to bottom in sequence.
8. The method of claim 1,
the S0050 specifically includes:
releasing the finished final assembly order, and preferentially arranging the final assembly order which is already worked on for scheduling;
performing time rolling calculation on the final assembly process in the states of processing and suspension, and if the rated working time of the process is greater than the actual time spent, remaining planned time t of the final assembly order2Subtracting the actual elapsed time from the scheduled time; if the rated working time is less than the actual time, the residual planning time t2N% of the scheduled time; using the remaining planning time t2The process steps in the process or in the pause are sequenced.
9. A computer-readable storage medium having stored thereon a computer program, characterized in that,
the computer program when executed by a processor implements the rolling scheduling method of any of claims 1-8.
10. A computer system, characterized in that,
comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the rolling scheduling method according to any of claims 1-8 when executing the program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110289951.5A CN113011739B (en) | 2021-03-18 | 2021-03-18 | Rolling scheduling method and computer readable storage medium for satellite production |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110289951.5A CN113011739B (en) | 2021-03-18 | 2021-03-18 | Rolling scheduling method and computer readable storage medium for satellite production |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113011739A true CN113011739A (en) | 2021-06-22 |
| CN113011739B CN113011739B (en) | 2022-11-25 |
Family
ID=76409612
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110289951.5A Active CN113011739B (en) | 2021-03-18 | 2021-03-18 | Rolling scheduling method and computer readable storage medium for satellite production |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113011739B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114545884A (en) * | 2022-03-16 | 2022-05-27 | 温州大学 | Equivalent parallel machine dynamic intelligent scheduling method based on enhanced topological neural evolution |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5099431A (en) * | 1989-10-23 | 1992-03-24 | International Business Machines Corporation | Automated re-work shop order scheduling system |
| JPH06176028A (en) * | 1992-12-10 | 1994-06-24 | Toshiba Corp | Operation plan scheduling device |
| CN108122055A (en) * | 2016-11-28 | 2018-06-05 | 北京理工大学 | The resource regulating method and device of a kind of Flow Shop |
| CN108898200A (en) * | 2018-07-05 | 2018-11-27 | 汕头市诸事帮科技有限公司 | The singulated system of intelligence, manufacturing schedule management system and its implementation, operating method |
| CN110503323A (en) * | 2019-08-13 | 2019-11-26 | 广州聚超软件科技有限公司 | The monitoring method and device and equipment of a kind of pull type SC task |
| CN111754086A (en) * | 2020-06-03 | 2020-10-09 | 深圳前海禾盈科技有限公司 | Order scheduling method |
| CN112488409A (en) * | 2020-12-09 | 2021-03-12 | 北京卫星制造厂有限公司 | Intelligent satellite assembly process planning system |
-
2021
- 2021-03-18 CN CN202110289951.5A patent/CN113011739B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5099431A (en) * | 1989-10-23 | 1992-03-24 | International Business Machines Corporation | Automated re-work shop order scheduling system |
| JPH06176028A (en) * | 1992-12-10 | 1994-06-24 | Toshiba Corp | Operation plan scheduling device |
| CN108122055A (en) * | 2016-11-28 | 2018-06-05 | 北京理工大学 | The resource regulating method and device of a kind of Flow Shop |
| CN108898200A (en) * | 2018-07-05 | 2018-11-27 | 汕头市诸事帮科技有限公司 | The singulated system of intelligence, manufacturing schedule management system and its implementation, operating method |
| CN110503323A (en) * | 2019-08-13 | 2019-11-26 | 广州聚超软件科技有限公司 | The monitoring method and device and equipment of a kind of pull type SC task |
| CN111754086A (en) * | 2020-06-03 | 2020-10-09 | 深圳前海禾盈科技有限公司 | Order scheduling method |
| CN112488409A (en) * | 2020-12-09 | 2021-03-12 | 北京卫星制造厂有限公司 | Intelligent satellite assembly process planning system |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114545884A (en) * | 2022-03-16 | 2022-05-27 | 温州大学 | Equivalent parallel machine dynamic intelligent scheduling method based on enhanced topological neural evolution |
| CN114545884B (en) * | 2022-03-16 | 2023-12-05 | 温州大学 | Equivalent parallel machine dynamic intelligent scheduling method based on enhanced topological neural evolution |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113011739B (en) | 2022-11-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ronen | The complete kit concept | |
| US7305276B2 (en) | Method, system, and computer program product for controlling the flow of material in a manufacturing facility using an extended zone of control | |
| Borreguero-Sanchidrián et al. | Flexible job shop scheduling with operators in aeronautical manufacturing: A case study | |
| CN113011739B (en) | Rolling scheduling method and computer readable storage medium for satellite production | |
| CN113642912B (en) | Method, system, equipment and storage medium for preventing work error | |
| CN116594757B (en) | Method and device for executing complex tasks by using large language model | |
| Cheng et al. | Simulation optimization of part input sequence in a flexible manufacturing system | |
| Pickrell et al. | Lean Six Sigma implementation case studies | |
| CN113742227A (en) | Method, device, equipment and medium for controlling software testing process | |
| Pepe et al. | Development of a framework for improving engineering processes | |
| CN115168337B (en) | Manufacturing information processing method and system based on parameterized process data structure | |
| CN110751352A (en) | Test scheduling method and computer-readable storage medium | |
| JP3710534B2 (en) | Process control method | |
| CN115034528A (en) | Resource allocation system for maintaining production facilities | |
| Dale et al. | Simulation of a group technology product cell | |
| Newman et al. | Examining the use of dedicated and general purpose pallets in a dedicated flexible manufacturing system | |
| Krenczyk et al. | Formulation of a sequencing problem in a mixed-model production system | |
| CN111666183B (en) | Automatic test method for hardware loop | |
| Skorobogatov et al. | Fuzzy-multiple approach in design and technology management modeling preparation of production at machine-building enterprises | |
| US11526847B2 (en) | Reconfiguring a vehicle for transfer from a first operator to a second operator | |
| Zaman et al. | Production flow improvement and value stream mapping in a lean manufacturing world | |
| Haijun et al. | An application technology research about FO/AO based on MES system | |
| Sabatini et al. | Productivity enhancement in the assembly line of a horn manufacturing company | |
| Jie et al. | The study on hybrid production scheduling based on TOC | |
| CN117670231A (en) | Construction drawing examination management system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |