CN111882145B - Airplane service support serial scheduling method considering resource transfer time - Google Patents

Airplane service support serial scheduling method considering resource transfer time Download PDF

Info

Publication number
CN111882145B
CN111882145B CN202010525570.8A CN202010525570A CN111882145B CN 111882145 B CN111882145 B CN 111882145B CN 202010525570 A CN202010525570 A CN 202010525570A CN 111882145 B CN111882145 B CN 111882145B
Authority
CN
China
Prior art keywords
time
guarantee
scheduled
procedure
resource
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010525570.8A
Other languages
Chinese (zh)
Other versions
CN111882145A (en
Inventor
苏析超
张勇
崔荣伟
韩维
刘嘉
王鑫
肖楚琬
崔凯凯
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Naval Aeronautical University
Original Assignee
Naval Aeronautical University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Naval Aeronautical University filed Critical Naval Aeronautical University
Priority to CN202010525570.8A priority Critical patent/CN111882145B/en
Publication of CN111882145A publication Critical patent/CN111882145A/en
Application granted granted Critical
Publication of CN111882145B publication Critical patent/CN111882145B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • 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
    • 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/06315—Needs-based resource requirements planning or analysis
    • 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/10—Office automation; Time management
    • G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
    • 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/40—Business processes related to the transportation industry

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Educational Administration (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Data Mining & Analysis (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 an airplane service support serial scheduling method considering resource transfer time, and belongs to the field of project scheduling. Firstly, inputting a working environment and a guarantee task, and initializing each resource state; and respectively setting the priority number of each procedure aiming at all the guarantee procedures of each airplane, and initializing the scheduled procedure set and the schedulable procedure set. And then, a serial scheduling generation mechanism is adopted for the schedulable process set, the process with the highest priority is selected as the current process to be scheduled, and the process starting time and the process ending time meeting the requirements of each guarantee resource of the current process are searched in a recursion mode. Recording the starting time and the ending time of the current process to be scheduled and the guarantee resources required by the process, adding the current process to be scheduled to a scheduled process set, and updating the states of various resources; and outputting the scheduling scheme after all the procedures are completely scheduled. The method meets the fine guarantee requirement, and the generated scheduling scheme is more in line with the actual operation requirement.

Description

Airplane service support serial scheduling method considering resource transfer time
Technical Field
The invention belongs to the field of project scheduling, and particularly relates to an aircraft service support serial scheduling method considering resource transfer time.
Background
The aircraft service support operation scheduling refers to the scientific planning and scheduling aiming at the flow arrangement and resource distribution of the cluster service support process under the constraint of limited operation space and support resources, so as to generate an efficient scheduling scheme.
The scheduling problem of the aircraft service support operation is large in scale and complex in constraint, and is a combined optimization problem with NP-hard characteristics. The commonly used scheduling method mainly includes a serial scheduling method using a process as a phase variable and a parallel scheduling method using time as a phase variable. The existing scheduling methods assume that the transfer time of various personnel and equipment required by guarantee between different guarantee stations is ignored, which is not in line with the actual situation of the service and service guarantee operation, and the generated scheduling scheme cannot be directly applied.
Disclosure of Invention
Aiming at the problems, the invention provides a serial scheduling method considering the transfer time of support personnel and equipment, which is applied to the operation stage of the aircraft service support, in particular to the serial scheduling method considering the resource transfer time of the aircraft service support.
The method mainly comprises the following steps:
firstly, inputting a working environment and a guarantee task, and initializing each resource state;
the work environment includes: coverage of each guarantee device, the number of various guarantee personnel, the number of devices, transfer time of the guarantee personnel and the devices among each guarantee station and the maximum guarantee amount of each supplicant resource;
the guarantee task comprises the number of airplanes, each flight protection parking position, each flight protection process flow, each process construction period and guarantee resources required by each process guarantee;
setting the number set of airplanes as I ═ {1,2, …, I, …, n }; the guarantee task of any single machine i is a series of guarantee working procedures Ji＝{1,2,…,j,…,|JiL }; wherein the 1 st process is a single machine guarantee virtual start process, the J-th processiThe I procedure is a single machine guarantee virtual finishing procedure, and the construction period of the two procedures is 0; all the ensuring procedures of the cluster to be ensured are expressed as J { (i, J) | J ∈ JiI belongs to I }. Joint O for jth guarantee procedure of airplane iijAnd (4) showing.
Process OijThe construction period ofijEnsuring that the station is WijThe process start time is SijEnd time is Eij，Eij＝Sij+dij；
The guarantee of the process totally relates to four types of resources: the supply resources such as the crew service support personnel, the service support equipment, the station space, the oil, the gas and the electricity and the like.
Step two: respectively setting the priority number of each procedure aiming at all the guarantee procedures of each airplane, and initializing a scheduled procedure set and a schedulable procedure set;
the priority numbers are random numbers which are different from each other in the interval [0,1 ]; the smaller the priority number is, the higher the scheduling priority of the process is, the first process of each airplane is stored in the initialized scheduled process set, and the default process is completed; initializing a schedulable procedure set as an empty set;
step three: calculating a schedulable process set, selecting a process with the highest priority in the schedulable process set as a current process to be scheduled by adopting a serial scheduling generation mechanism, and recursively searching process starting time and ending time meeting requirements of each guarantee resource of the current process;
the dispatchable procedure set stores the procedure set of which the immediately previous procedure completes dispatching;
the method comprises the following specific steps:
301, calculating a schedulable procedure set, and selecting the procedure with the highest priority in the schedulable procedure set
Figure BDA0002533651570000021
As the current process to be scheduled, recording the latest completion time value of all immediately preceding processes of the process as the time t 0;
this procedure
Figure BDA0002533651570000022
Storing the immediately preceding process in a scheduled process set;
step 302, determining time t0
Figure BDA0002533651570000023
Whether the number of the required crew support personnel meets the requirement or not is judged, if yes, the set of the crew support personnel meeting the number requirement is recorded as RP, and the recording time t1 is t 0; otherwise, respectively judging each time of self increment 1 from the time t0 by taking 1 time unit as a step length until the number of the crew support personnel at a certain time meets the requirement;
1 time unit is 1 minute or 1 second;
for each person l in the RP, when the resource status is one of the following four conditions, the person is considered to be able to execute the process guarantee task to be scheduled at time t 0:
(1) the personnel did not arrange any security procedures.
(2) The person is performing the last process step O before time t0egAnd the last process OegEnd time E ofegPlus the person from procedure OegGuarantee station WegTransfer to a guarantee station
Figure BDA00025336515700000210
Still does not reach time t0 after the transition time of (2);
(3) first process O performed by the person after time t0pqIs SpqAnd from time t0, the process goes through
Figure BDA0002533651570000024
Construction period and the personnel slave guarantee station
Figure BDA0002533651570000025
Transfer to Process OpqGuarantee station WpqAfter the sum of the transfer times of (1), the process step (O) is not reachedpqStart time S ofpq。
(4) At time t0, between certain two adjacent processes O for which the person has been scheduled to secureegAnd OpqAnd satisfies a) the slave process OegEnd time E ofegFrom the beginning, the person goes through the process OegGuarantee station WegTransfer to a guarantee station
Figure BDA0002533651570000026
And performs the procedures
Figure BDA0002533651570000027
After the guarantee, the following process is continued
Figure BDA0002533651570000028
Guarantee station
Figure BDA0002533651570000029
Transfer to Process OpqGuarantee station WpqStill does not reach the process OpqStart time S ofpq(ii) a b) When in the following process OegEnd time E ofegInitially, the person goes through process OegGuarantee station WegTransfer to a guarantee station
Figure BDA0002533651570000031
Still, time t0 is not reached after the transition time of (2).
Step 303, judging time t1, and ensuring working procedure
Figure BDA0002533651570000032
Whether the required quantity of each type of service support equipment meets the requirement or not; if yes, recording the guarantee device set meeting the quantity requirement as an RE, and recording the time t2 to t 1; otherwise, respectively judging each time of self increment 1 from the time t1 by taking 1 time unit as a step length until the number of the service support equipment at a certain time meets the requirement;
the guarantee equipment capable of executing the guarantee task is idle equipment with a guarantee range covering the guarantee parking space;
for each equipment, judging whether the equipment can reach the guarantee station at the time t1 according to the resource state of the equipment
Figure BDA0002533651570000033
Executing pending dispatchThe process guarantee task is determined in the same manner as step 302.
Step 304, judgment support step
Figure BDA0002533651570000034
Resource status of each required workstation space in
Figure BDA0002533651570000035
Whether each time tau in the time has idle or not is judged, and if yes, the recording time t3 is t 2; otherwise, from the time t2, with 1 time unit as a step length, searching and judging each time of increasing 1, until each station space required by the process guarantee to be scheduled at a certain time can execute the process guarantee task to be scheduled.
Step 305, determination support step
Figure BDA0002533651570000036
The resource status of each type of supplicant resource required is
Figure BDA0002533651570000037
And whether each time tau in the time has enough resource residual quantity or not executes the guarantee task of the procedure to be scheduled. If yes, recording time t 4-t 3; otherwise, from the time t3, with 1 time unit as a step length, searching and judging each time of self increment 1 respectively until each type of supplying resources required by the process guarantee to be scheduled at a certain time can meet the guarantee requirement;
and step 306, judging whether t1 is t2, t3 is t4, if so, setting the starting time of the process to be scheduled to be t4, otherwise, initializing the time variable t0 to be t4, and returning to step 302 to search again until the starting time and the ending time of the process to be scheduled are found.
Step four: recording the starting time and the ending time of the current process to be scheduled and the guarantee resources required by the process, adding the current process to be scheduled to a scheduled process set, and updating the states of various resources;
and the ending time of the process to be scheduled is the starting time plus the construction period of the process to be scheduled.
When guarantee resources are allocated for the process to be scheduled:
calculating respective accumulated transfer time for all personnel capable of executing the process guarantee to be scheduled, sequentially selecting the personnel in the guarantee to execute the process to be scheduled according to the arrangement of the accumulated transfer time from small to large, and if a plurality of personnel with the same accumulated transfer time exist, arranging the corresponding personnel in the guarantee to guarantee the process to be scheduled according to the sequence of the personnel numbers from small to large;
and aiming at all the equipment capable of executing the process guarantee to be scheduled, calculating the accumulated operation time of the remaining processes in the coverage range of each equipment, arranging the guarantee equipment to execute the process to be scheduled according to the sequence of the accumulated operation time of the remaining processes from small to large, and if a plurality of guarantee equipment with the same accumulated operation time of the remaining processes in the coverage range exist, arranging the corresponding guarantee equipment to guarantee the process to be scheduled according to the sequence of the equipment numbers from small to large.
Step five: judging whether all the procedures are completely scheduled, if so, outputting a scheduling scheme, and ending; otherwise, returning to the third step.
The invention has the advantages that:
1) compared with the conventional scheduling method, the method considers the resource transfer time in the aircraft service support operation, and the generated scheduling scheme can better meet the actual operation requirement.
2) Compared with the existing scheduling scheme taking the small groups as units, the method refines the scheduling scheme to single support personnel and equipment, and meets the requirement of fine support.
Drawings
FIG. 1 is a flowchart of a serial scheduling method for aircraft service support considering resource transfer time according to the present invention.
FIG. 2 is a diagram of a multi-machine guaranteed AON generated by a serial scheduling generation mechanism according to the present invention.
FIG. 3 is a resource state diagram of the security personnel (devices) of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings.
The invention relates to an aircraft service support serial scheduling method considering resource transfer time, which comprises the steps of firstly inputting a working environment and a support task, initializing each resource state, then giving priority to all working procedures, adopting a serial scheduling generation mechanism, sequentially selecting the working procedure with the highest priority in a to-be-scheduled working procedure set, recurrently searching for time meeting the requirements of each support resource of the working procedure by taking 1 time unit as a step length, then setting the starting time and the ending time of the working procedure, distributing support resources for the working procedure, updating various resource states, and finally outputting a scheduling scheme.
As shown in fig. 1, the method mainly comprises the following steps:
firstly, inputting a working environment and a guarantee task, and initializing each resource state;
before the aircraft takes off, a series of aircraft service support tasks need to be completed on a guarantee site.
The work environment includes: coverage of each guarantee device, the number of various guarantee personnel, the number of devices, transfer time of the guarantee personnel and the devices among each guarantee station and the maximum guarantee amount of each supplicant resource;
the guarantee task comprises the number of airplanes, each flight protection parking position, each flight protection process flow, each process construction period and guarantee resources required by each process guarantee;
setting the number set of clusters to be guaranteed as I ═ 1,2, …, I, …, n }; the guarantee task of any single machine I belonging to I is a series of guarantee working procedures Ji＝{1,2,…,j,…,|JiL }; wherein the 1 st process is a single machine guarantee virtual start process, the J-th processiThe I procedure is a single machine guarantee virtual finishing procedure, the construction period of the two procedures is 0, the two procedures are not actually required to be executed, and the action is to integrate all guarantee procedures of the single machine; all the aircraft can complete the guarantee work of all the procedures at the same parking space without changing the parking space in midway. All the ensuring procedures of the cluster to be ensured are expressed as J { (i, J) | J ∈ EJi,i∈I}。
The single machine guarantee process flow can be represented by an AON (activity on node network), and is expanded into a multi-machine guarantee AON by adding virtual start and end nodes, as shown in FIG. 2, a node OijRepresents the jth guarantee procedure of the airplane i, the solid line directed arc represents the logic constraint relation among all procedures, and OS,OEAnd representing the multi-machine guarantee virtual start and end nodes. Process OijThe guarantee can be started after all the process guarantees contained in the process set immediately before the process set are finished, and the construction period is dijEnsuring that the station is WijThe process start time is SijEnd time is Eij，Eij＝Sij+dij。
The guarantee of the process totally relates to four types of resources: the supply resources such as the crew service support personnel, the service support equipment, the station space, the oil, the gas and the electricity and the like.
The process starting time is the time for various resources required by the process starting time to simultaneously meet the guarantee requirement.
Setting procedure OijThe number of k-th type of crew security personnel required for security is rpijkThe change of the security stations by the personnel needs a certain transfer time and resource state variables
Figure BDA0002533651570000051
Indicating the status (working, moving or idle) of the kth class i of security personnel at time t. The guarantee range of the service support equipment is limited by the length of the pipeline, and only the airplane with the parking space within the coverage range of the service support equipment can be guaranteed. Process OijThe number of kth service support equipment required for support is reijk. Ensuring that equipment is transferred between guarantee stations requires a certain transfer time and resource state variables
Figure BDA0002533651570000052
Indicating the status (working, moving or idle) of the kth class ith secured device at time t. For a workstation space, a resource state variable
Figure BDA0002533651570000058
The state (occupied or idle) of the kth class station space of the ith aircraft at the moment t. For supplying resources, due to supply limitation, the kth supplying resource can only be applied to Lw at the same timekSupporting the airplane to ensure the state variable of the resource
Figure BDA0002533651570000054
Indicating the number of remaining guaranteed aircraft for the kth category of affordance at time t.
Step two: respectively setting the priority number of each procedure aiming at all the guarantee procedures of each airplane, and initializing a scheduled procedure set and a schedulable procedure set;
the priority numbers are random numbers which are different from each other in the interval [0,1 ]; the smaller the priority number is, the higher the scheduling priority of the process is, the first process of each airplane is stored in the initialized scheduled process set, and the default process is completed; initializing a schedulable procedure set as an empty set;
step three: calculating a schedulable process set, selecting a process with the highest priority in the schedulable process set as a current process to be scheduled by adopting a serial scheduling generation mechanism, and recursively searching process starting time and ending time meeting requirements of each guarantee resource of the current process;
the dispatchable procedure set stores the procedure set of which the immediately previous procedure completes dispatching;
the method comprises the following specific steps:
301, calculating a schedulable procedure set, and selecting the procedure with the highest priority in the schedulable procedure set
Figure BDA0002533651570000055
As the current process to be scheduled, recording the time value of all the processes immediately before the process as the time t 0;
this procedure
Figure BDA0002533651570000056
Is stored in the scheduled process set, and the initial value at time t0 is the process
Figure BDA0002533651570000057
The completion time of the immediately preceding first process.
Step 302, determining time t0
Figure BDA0002533651570000061
Whether the required number of each type of the crew support personnel meets the requirement is judged, if yes, the set of the crew support personnel meeting the number requirement is recorded as RP, and the recording time t1 is t 0; otherwise, respectively judging each time of self increment 1 from the time t0 by taking 1 time unit as a step length until the number of the crew support personnel at a certain time meets the requirement;
1 time unit is 1 minute or 1 second;
for each person (device) l in the set RP, as shown in fig. 3, the resource status of each person (device) can only be one of the following four cases, and then the person can execute the process guarantee task to be scheduled at time t 0:
(1) the personnel did not arrange any security procedures.
(2) The person is performing the last process step O before time t0egAnd the last process OegEnd time E ofegPlus the person from procedure OegGuarantee station WegTransfer to a guarantee station
Figure BDA0002533651570000062
Still does not reach time t0 after the transition time of (2);
(3) first process O performed by the person after time t0pqIs SpqAnd from time t0, the process goes through
Figure BDA0002533651570000063
Construction period and the personnel slave guarantee station
Figure BDA0002533651570000064
Transfer to Process OpqGuarantee station WpqAfter the sum of the transfer times, still does not arriveProcess OpqStart time S ofpq。
(4) At time t0, between certain two adjacent processes O for which the person has been scheduled to secureegAnd OpqAnd satisfies a) the slave process OegEnd time E ofegFrom the beginning, the person goes through the process OegGuarantee station WegTransfer to a guarantee station
Figure BDA0002533651570000065
And performs the procedures
Figure BDA0002533651570000066
After the guarantee, the following process is continued
Figure BDA0002533651570000067
Guarantee station
Figure BDA0002533651570000068
Transfer to Process OpqGuarantee station WpqStill does not reach the process OpqStart time S ofpq(ii) a b) When in the following process OegEnd time E ofegInitially, the person goes through process OegGuarantee station WegTransfer to a guarantee station
Figure BDA0002533651570000069
Still, time t0 is not reached after the transition time of (2).
Step 303, judging time t1, and ensuring working procedure
Figure BDA00025336515700000610
Whether the required quantity of each type of service support equipment meets the requirement or not; if yes, recording the guarantee device set meeting the quantity requirement as an RE, and recording the time t2 to t 1; otherwise, respectively judging each time of self increment 1 from the time t1 by taking 1 time unit as a step length until the number of the service support equipment at a certain time meets the requirement;
the guarantee equipment capable of executing the guarantee task is idle equipment with a guarantee range covering the guarantee parking space;
for each equipment, judging whether the equipment can reach the guarantee station at the time t1 according to the resource state of the equipment
Figure BDA00025336515700000611
And executing the process guarantee task to be scheduled, wherein the judging method is the same as the step 302.
Step 304, judgment support step
Figure BDA00025336515700000612
Resource status of each required workstation space in
Figure BDA00025336515700000613
Whether each time tau in the time has idle or not is judged, and if yes, the recording time t3 is t 2; otherwise, from the time t2, with 1 time unit as a step length, searching and judging each time of increasing 1, until each station space required by the process guarantee to be scheduled at a certain time can execute the process guarantee task to be scheduled.
Step 305, determination support step
Figure BDA0002533651570000071
The resource status of each type of supplicant resource required is
Figure BDA0002533651570000072
And whether each time tau in the time has enough resource residual quantity or not executes the guarantee task of the procedure to be scheduled. If yes, recording time t 4-t 3; otherwise, from the time t3, with 1 time unit as a step length, searching and judging each time of self increment 1 respectively until each type of supplying resources required by the process guarantee to be scheduled at a certain time can meet the guarantee requirement;
and step 306, judging whether t1 is t2, t3 is t4, if so, setting the starting time of the process to be scheduled to be t4, otherwise, initializing the time variable t0 to be t4, and returning to step 302 to search again until the starting time and the ending time of the process to be scheduled are found.
Step four: recording the starting time and the ending time of the current process to be scheduled and the guarantee resources required by the process, adding the current process to a scheduled process set, and updating the states of various resources;
and the ending time of the process to be scheduled is the starting time plus the construction period of the process to be scheduled.
When guarantee resources are allocated for the process to be scheduled:
calculating respective accumulated transfer time for all personnel capable of executing the process guarantee to be scheduled, sequentially selecting the personnel in the guarantee to execute the process to be scheduled according to the arrangement of the accumulated transfer time from small to large, and if a plurality of personnel with the same accumulated transfer time exist, arranging the corresponding personnel in the guarantee to guarantee the process to be scheduled according to the sequence of the personnel numbers from small to large;
and aiming at all the equipment capable of executing the process guarantee to be scheduled, calculating the accumulated operation time of the remaining processes in the coverage range of each equipment, arranging the guarantee equipment to execute the process to be scheduled according to the sequence of the accumulated operation time of the remaining processes from small to large, and if a plurality of guarantee equipment with the same accumulated operation time of the remaining processes in the coverage range exist, arranging the corresponding guarantee equipment to guarantee the process to be scheduled according to the sequence of the equipment numbers from small to large.
Step five: judging whether all the procedures are completely scheduled, if so, outputting a scheduling scheme, and ending; otherwise, returning to the third step.
The invention will be described in further detail below with reference to an embodiment shown in fig. 2.
The method for scheduling each procedure of each airplane is carried out according to the following steps.
Firstly, inputting a working environment and a guarantee task, and initializing each resource state;
the working environment is as follows: the safeguard equipment is only 1 type, the number of the safeguard equipment is 2, the safeguard equipment is numbered e1, e2 and e1 covers a safeguard station H1 of the airplane 1 (the equipment e1 can provide safeguard for all procedures of the airplane 1), and the safeguard equipment is numbered e2 covers a safeguard station H2 of the airplane 2 (the equipment e2 can provide safeguard for all procedures of the airplane 2); the number of the security personnel is only 1 type, 3, and the numbers are p1, p2 and p 3; the transfer time of each guarantee personnel between the guarantee stations is 2(min), and the transfer time of each guarantee equipment between the guarantee stations is 3 (min); the availability of resources is only 1 type, while the maximum number of aircraft that can be secured is 1.
And (4) ensuring tasks: the set of the number of airplanes is I ═ {1,2}, the flow of the guarantee process of a single machine is shown in fig. 2, the working period of each process and the situation of the required guarantee resources are shown in table 1, wherein "-" indicates that the process does not need such guarantee resources. O isSAnd OEThe processes are not actually required to be executed for the virtual start and end of the cluster, and are not listed in the table.
The resource status of each person and device at each moment is initialized to idle.
TABLE 1 guaranteed resource situation required for each procedure
Figure BDA0002533651570000081
Step two: assuming that the priority number of each process is as shown in table 2, the set C of initialized scheduled processes is { O ═ O11，O21}，O11，O21Is 0, initializing the schedulable process set
Figure BDA0002533651570000082
TABLE 2 priority of each step
Procedure (ii) O11 O12 O13 O14 O15 O16 O17 O18 O19
Priority number 0.1 0.4 0.2 0.35 0.17 0.25 0.45 0.85 0.37
Procedure (ii) O21 O22 O23 O24 O25 O26 O27 O28 O29
Priority number 0.38 0.48 0.26 0.76 0.73 0.88 0.62 0.59 0.19
Step three: calculating a schedulable procedure set, selecting a procedure with the highest priority in the schedulable procedure set by adopting a serial scheduling generation mechanism, and recursively searching procedure starting time and procedure ending time meeting the requirements of each guarantee resource of the procedure;
step 301, calculating a schedulable process set as a process set with the immediately previous process completed scheduling, as shown in fig. 2 and set C, D ═ O12，O14，O17，O22，O25，O28Selecting O according to the priority number of each process14Is a process to be scheduled. O is14Is O as a step immediately before11Therefore, the initialization t0 is 0.
Step 302: process O 142 guarantee personnel are needed, the resource states of all the guarantee personnel at the time t0 are the situation (1) shown in fig. 3, that is, no procedure is guaranteed, the number of personnel capable of executing guarantee tasks is 3, and the procedure O is adopted14The number of required support personnel can meet the support requirement, the record RP is { p1, p2, p3}, and the record time t1 is t0 is 0;
step 303: process O 141 guarantee device is needed, the guarantee device capable of covering the guarantee stand is e1, the resource state is the situation (1) shown in fig. 3, namely, no process is guaranteed, and the guarantee task can be executedWith a stock quantity of 1, process O14The required number of security devices can meet the security requirement, and RE is recorded as { e1 }. Recording time t 2-t 1-0;
step 304: process O14Requiring resources for workspace at [ t2, t2+2 ]]In the time period, station space resources of the airplane 1 are idle, guarantee requirements are met, and the recording time t3 is t2 is 0;
step 305: process O14Requiring an affordable resource at [ t3, t3+2 ]]In the time period, the supplying resources can provide guarantee for 1 airplane again, the guarantee requirement is met, and the recording time t4 is t3 is 0;
step 306: the process O is set as t1, t2, t3, and t414Is 0;
step four: recording step O14Has a start time of 0 and an end time of 0+2 to 2, the cumulative transition time of all the support staff in the set RP that can perform the support task is 0, and at this time, the support staff with the small number (i.e., p1, p2) is selected to support the process O14(ii) a Since there are only 1 safeguard device in the set RE, the safeguard device safeguard process O with the number e1 is selected14(if there are more than 1 ensuring equipment in the RE, the cumulative hours of operation of the remaining processes within its coverage area is calculated. taking equipment e1 as an example, it covers the stand of aircraft 1, where aircraft 1 only has process O11The scheduling is completed, and in the rest working procedures, the working procedure set needing the guarantee equipment is { O13，O14，O15，O16，O18The cumulative working time of the equipment needs the sum of the working periods of the equipment-securing procedures, i.e. 3+2+4+3+3 is 15 min).
Step O14Added to the scheduled process set C, i.e. C ═ O11，O21，O14}。
The resource states of the update personnel p1 and p2 are as follows: [0,2]Performing procedure O within a time period14And the rest time is idle; the resource status of update device e1 is: [0,2]Performing procedure O within a time period14And the rest time is idle; updating the station space state of the aircraft 1 is: [0,2]Occupied in the time period, and idle in the rest time; updating the status of the provisioned resource to [0, 2%]Within a time periodThe number of the guaranteed airplanes is 0, and the rest time is 1.
Step five: and judging that all the processes are not finished with scheduling, and returning to the step three.
Step 301 is executed again, wherein the schedulable process set is calculated as the set of processes whose immediately previous process has completed the scheduling, which can be obtained from fig. 2 and set C, D ═ O12，O15，O17，O22，O25，O28Selecting O according to the priority number of each process15Is a process to be scheduled. O is15Is O as a step immediately before14Therefore, the initialization t0 is 2.
Step 302: process O 152 support personnel are required. For persons p1 and p2, their resource status is the case (2) shown in FIG. 3, the last process they have performed (O)14) Is 2, plus the transfer time (2min) between the stations has exceeded the time t0, the resource status for person p1 is the case (1) shown in fig. 3, i.e., the number of persons who can perform the security task at time t0 is 1, at which time the process O is performed15The number of required support personnel cannot meet the support requirement, and t0 is increased by 1, namely t0 is t0+1 is 3. At this time, the number of persons who can perform the safeguard task is still 1, and t0 continues to increase by 1, i.e., t0 equals t0+1 equals 4. The personnel p1 and p2 can now be transferred to procedure O15The number of the staff capable of executing the guarantee task at the time t0 is 3, the process guarantee requirement is met, the record RP is { p1, p2, p3}, and the record time t1 is t0 is 4;
step 303: process O 151 safeguard device is required, the safeguard device capable of covering the safeguard stand is e1, the resource status at this time is the case (2) shown in fig. 3, and the last process (O) is executed14) Is 2, and the transition time (3min) between stations exceeds the time t1, so the equipment cannot meet the guarantee requirement at the time t1, and the t1 is increased by 1, namely t1 is t1+1 is 5. At this time, the equipment is judged to be capable of executing the guarantee task, the number of the equipment capable of executing the guarantee task is 1, and the process O15The required number of security devices can meet the security requirement, and RE is recorded as { e1 }. Recording time t 2-t 1-5;
step 304: worker's toolSequence O15Requiring resources for workspace at [ t2, t2+2 ]]In the time period, station space resources of the airplane 1 are idle, guarantee requirements are met, and the recording time t3 is t2 is 5;
step 306: the process O is set as t1, t2, t3, and t4155 step 305: process O15Requiring an affordable resource at [ t3, t3+2 ]]In the time period, the supplying resources can provide guarantee for 1 airplane again, the guarantee requirement is met, and the recording time t4 is t3 is 5;
step 306: since t1 ≠ t2 ═ t3 ═ t4, initialization t0 ═ t4 ═ 5 returns to step 302.
Step 302: process O 152 support personnel are required. For persons p1 and p2, their resource status is the case (2) shown in FIG. 3, the last process they have performed (O)14) The ending time of (2), plus the transfer time (2min) between stations does not exceed the time t0, and for the person p1, the resource state is the case (1) shown in fig. 3, that is, the number of persons capable of performing the guarantee task at the time t0 is 3, the process guarantee requirement is met, the record RP is { p1, p2, p3}, and the record time t1 is t0 is 5;
step 303: process O 151 safeguard device is required, the safeguard device capable of covering the safeguard stand is e1, the resource status at this time is the case (2) shown in fig. 3, and the last process (O) is executed14) Is 2, plus the transfer time (3min) between the stations does not exceed the time t1, the number of devices that can execute the safeguard task is 1, and the process O15The required number of security devices can meet the security requirement, and RE is recorded as { e1 }. Recording time t 2-t 1-5;
step 304: process O15Requiring resources for workspace at [ t2, t2+2 ]]In the time period, station space resources are idle, the guarantee requirement is met, and the recording time t3 is t2 is 5;
step 305: process O15Requiring an affordable resource at [ t3, t3+2 ]]In the time period, the supplying resources can provide guarantee for 1 airplane again, the guarantee requirement is met, and the recording time t4 is t3 is 5;
step four: recording step O15Has a start time of 5 and an end time of 5+4 to 9, and the cumulative transition time of the support staff in the set RP capable of executing the support task is 0 (at this time, since p1 and p2 are only planned to prepare for the transition between stations and are not implemented yet, the resource states of p1 and p2 are [0,2 ]]Performing procedure O within a time period14Since the rest of the time is idle, the cumulative transfer time of p1 and p2 is 0), and the security procedure O of the security personnel with small numbers (i.e. p1, p2) is selected at this time14(ii) a Since there are only 1 safeguard device in the set RE, the safeguard device safeguard process O with the number e1 is selected14。
Step O15Added to the scheduled process set C, i.e. C ═ O11，O21，O14，O15}。
The resource states of the update personnel p1 and p2 are as follows: [0,2]Performing procedure O within a time period14，[2,4]Transfer between stations within a time period, [5,9 ]]Performing procedure O within a time period15And the rest time is idle; the resource status of update device e1 is: [0,2]Performing procedure O within a time period14，[2,5]Transfer between stations within a time period, [5,9 ]]Performing procedure O within a time period15And the rest time is idle; updating the station space state of the aircraft 1 is: [0,2]And [5,9 ]]Occupied in the time period, and idle in the rest time; updating the status of the provisioned resource to [0, 2%]And [5,9 ]]The number of the airplanes which can be guaranteed in the time period is 0, and the rest time is 1.
Step five: and judging that all the processes are not finished with scheduling, and returning to the step three.
The subsequent steps are executed until all the procedures are scheduled, the scheduling scheme (the starting time, the ending time and the resource allocation condition of each procedure) is output, and the process is ended.

Claims (5)

1. An aircraft service support serial scheduling method considering resource transfer time is characterized by comprising the following steps:
firstly, inputting a working environment and a guarantee task, and initializing each resource state;
the guarantee task comprises the number of airplanes, each flight protection parking position, each flight protection process flow, each process construction period and guarantee resources required by each process guarantee;
setting the number set of airplanes as I ═ {1,2, …, I, …, n }; the guarantee task of any single machine i is a series of guarantee working procedures Ji＝{1,2,…,j,…,|JiL }; wherein the 1 st process is a single machine guarantee virtual start process, the J-th processiThe I procedure is a single machine guarantee virtual finishing procedure, and the construction period of the two procedures is 0; all the ensuring procedures of the cluster to be ensured are expressed as J { (i, J) | J ∈ JiI belongs to I }; joint O for jth guarantee procedure of airplane iijRepresents;
process OijThe construction period ofijEnsuring that the station is WijThe process start time is SijEnd time is Eij，Eij＝Sij+dij；
Step two: respectively setting the priority number of each procedure aiming at all the guarantee procedures of each airplane, and initializing a scheduled procedure set and a schedulable procedure set;
step three: calculating a schedulable process set, selecting a process with the highest priority in the schedulable process set as a current process to be scheduled by adopting a serial scheduling generation mechanism, and recursively searching process starting time and ending time meeting requirements of each guarantee resource of the current process;
the dispatchable procedure set stores the procedure set of which the immediately previous procedure completes dispatching;
the method comprises the following specific steps:
301, calculating a schedulable procedure set, and selecting the procedure with the highest priority in the schedulable procedure set
Figure FDA0002533651560000011
As the current process to be scheduled, recording the latest completion time value of all immediately preceding processes of the process as the time t 0;
this procedure
Figure FDA0002533651560000012
Storing the immediately preceding process in a scheduled process set;
step 302, determining time t0
Figure FDA0002533651560000013
Whether the number of the required crew support personnel meets the requirement or not is judged, if yes, the set of the crew support personnel meeting the number requirement is recorded as RP, and the recording time t1 is t 0; otherwise, respectively judging each time of self increment 1 from the time t0 by taking 1 time unit as a step length until the number of the crew support personnel at a certain time meets the requirement;
1 time unit is 1 minute or 1 second;
step 303, judging time t1, and ensuring working procedure
Figure FDA0002533651560000014
Whether the required quantity of each type of service support equipment meets the requirement or not; if yes, recording the guarantee device set meeting the quantity requirement as an RE, and recording the time t2 to t 1; otherwise, respectively judging each time of self increment 1 from the time t1 by taking 1 time unit as a step length until the number of the service support equipment at a certain time meets the requirement;
the guarantee equipment capable of executing the guarantee task is idle equipment with a guarantee range covering the guarantee parking space;
for each equipment, judging whether the equipment can reach the guarantee station at the time t1 according to the resource state of the equipment
Figure FDA0002533651560000015
Executing the process guarantee task to be scheduled, wherein the judging method is the same as that of a person;
step 304, judgment support step
Figure FDA0002533651560000016
Resource status of each required workstation space in
Figure FDA0002533651560000017
Whether each time instant tau within a time instant is free,if yes, recording time t 3-t 2; otherwise, from the time t2, with 1 time unit as a step length, respectively searching and judging each time of self increment 1 until each station space required by the process guarantee to be scheduled at a certain time can execute the process guarantee task to be scheduled;
step 305, determination support step
Figure FDA0002533651560000021
The resource status of each type of supplicant resource required is
Figure FDA0002533651560000022
Whether each time tau in the time has enough resource residual quantity to execute the guarantee task of the process to be scheduled or not is judged, and if yes, the recording time t4 is t 3; otherwise, from the time t3, with 1 time unit as a step length, searching and judging each time of self increment 1 respectively until each type of supplying resources required by the process guarantee to be scheduled at a certain time can meet the guarantee requirement;
step 306, judging whether t1 is t2 is t3 is t4, if yes, setting the starting time of the process to be scheduled as t4, otherwise, initializing a time variable t0 is t4, returning to step 302 to search again until the starting time and the ending time of the process to be scheduled are found;
step four: recording the starting time and the ending time of the current process to be scheduled and the guarantee resources required by the process, adding the current process to be scheduled to a scheduled process set, and updating the states of various resources;
the end time of the process to be scheduled is the start time plus the construction period of the process to be scheduled;
step five: judging whether all the procedures are completely scheduled, if so, outputting a scheduling scheme, and ending; otherwise, returning to the third step.
2. The method for serially scheduling aircraft service support considering resource transfer time as claimed in claim 1, wherein the operation environment in the step one comprises: coverage of each guarantee device, the number of various guarantee personnel, the number of devices, transfer time of the guarantee personnel and the devices among each guarantee station and the maximum guarantee amount of each supplicant resource;
the process guarantee relates to four types of resources: the system comprises the following components of a mechanical support personnel, a service support device, a station space and oil gas and electricity supply resources.
3. The method for serially scheduling the aircraft service support considering the resource transfer time according to claim 1, wherein the second step is specifically as follows:
the priority numbers are random numbers which are different from each other in the interval [0,1 ]; the smaller the priority number is, the higher the scheduling priority of the process is, the first process of each airplane is stored in the initialized scheduled process set, and the default process is completed; and initializing the schedulable procedure set as an empty set.
4. The method for serially scheduling aircraft service support considering resource transfer time according to claim 1, wherein in the step 302, for each person l in the RP, when the resource status is one of the following four conditions, the person is considered to be able to perform the process service support task to be scheduled at time t 0:
(1) the personnel do not arrange any security procedure;
(2) the person is performing the last process step O before time t0egAnd the last process OegEnd time E ofegPlus the person from procedure OegGuarantee station WegTransfer to a guarantee station
Figure FDA0002533651560000023
Still does not reach time t0 after the transition time of (2);
(3) first process O performed by the person after time t0pqIs SpqAnd from time t0, the process goes through
Figure FDA0002533651560000031
To a workerStation for ensuring personnel
Figure FDA0002533651560000032
Transfer to Process OpqGuarantee station WpqAfter the sum of the transfer times of (1), the process step (O) is not reachedpqStart time S ofpq；
(4) At time t0, between certain two adjacent processes O for which the person has been scheduled to secureegAnd OpqAnd satisfies a) the slave process OegEnd time E ofegFrom the beginning, the person goes through the process OegGuarantee station WegTransfer to a guarantee station
Figure FDA0002533651560000033
And performs the procedures
Figure FDA0002533651560000034
After the guarantee, the following process is continued
Figure FDA0002533651560000035
Guarantee station
Figure FDA0002533651560000036
Transfer to Process OpqGuarantee station WpqStill does not reach the process OpqStart time S ofpq(ii) a b) When in the following process OegEnd time E ofegInitially, the person goes through process OegGuarantee station WegTransfer to a guarantee station
Figure FDA0002533651560000037
Still, time t0 is not reached after the transition time of (2).
5. The method for serially scheduling the aircraft service support considering the resource transfer time as claimed in claim 1, wherein in the fourth step, when the support resources are allocated to the process to be scheduled:
calculating respective accumulated transfer time for all personnel capable of executing the process guarantee to be scheduled, sequentially selecting the personnel in the guarantee to execute the process to be scheduled according to the arrangement of the accumulated transfer time from small to large, and if a plurality of personnel with the same accumulated transfer time exist, arranging the corresponding personnel in the guarantee to guarantee the process to be scheduled according to the sequence of the personnel numbers from small to large;
and aiming at all the equipment capable of executing the process guarantee to be scheduled, calculating the accumulated operation time of the remaining processes in the coverage range of each equipment, arranging the guarantee equipment to execute the process to be scheduled according to the sequence of the accumulated operation time of the remaining processes from small to large, and if a plurality of guarantee equipment with the same accumulated operation time of the remaining processes in the coverage range exist, arranging the corresponding guarantee equipment to guarantee the process to be scheduled according to the sequence of the equipment numbers from small to large.
CN202010525570.8A 2020-06-10 2020-06-10 Airplane service support serial scheduling method considering resource transfer time Active CN111882145B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010525570.8A CN111882145B (en) 2020-06-10 2020-06-10 Airplane service support serial scheduling method considering resource transfer time

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010525570.8A CN111882145B (en) 2020-06-10 2020-06-10 Airplane service support serial scheduling method considering resource transfer time

Publications (2)

Publication Number Publication Date
CN111882145A CN111882145A (en) 2020-11-03
CN111882145B true CN111882145B (en) 2022-03-11

Family

ID=73156482

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010525570.8A Active CN111882145B (en) 2020-06-10 2020-06-10 Airplane service support serial scheduling method considering resource transfer time

Country Status (1)

Country Link
CN (1) CN111882145B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112396318B (en) * 2020-11-17 2022-03-01 中国人民解放军海军航空大学 Time robustness considered cluster support personnel and equipment distribution method
CN112734223B (en) * 2021-01-06 2022-09-02 中国人民解放军海军航空大学 Carrier-based aircraft dynamic guarantee scheduling method and device based on rolling time domain optimization
CN114091927B (en) * 2021-11-25 2024-09-20 中国人民解放军海军航空大学 Ground maintenance operation serial scheduling method considering airplane transfer
CN118297357B (en) * 2024-06-05 2024-09-10 中国人民解放军海军航空大学 Airplane guarantee operation scheduling method and device based on graph attention neural network

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101976073A (en) * 2010-10-26 2011-02-16 北京理工大学 Discrete procedure inserting and dispatching method in mixed line production
CN109165782A (en) * 2018-08-15 2019-01-08 民航成都信息技术有限公司 Civil Aviation Airport ground service support personnel dispatching method and its system
CN110070305A (en) * 2019-05-05 2019-07-30 中国人民解放军国防科技大学 Dual-target robust resource allocation method under resource transfer visual angle
CN110570011A (en) * 2019-08-02 2019-12-13 中国船舶工业系统工程研究院 Complex system resource optimization scheduling method and system under multi-constraint condition
CN110969308A (en) * 2019-12-10 2020-04-07 浙江工业大学 Heuristic resource-limited project scheduling optimization method based on dynamic key tasks

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080059273A1 (en) * 2006-02-21 2008-03-06 Dynamic Intelligence Inc. Strategic planning

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101976073A (en) * 2010-10-26 2011-02-16 北京理工大学 Discrete procedure inserting and dispatching method in mixed line production
CN109165782A (en) * 2018-08-15 2019-01-08 民航成都信息技术有限公司 Civil Aviation Airport ground service support personnel dispatching method and its system
CN110070305A (en) * 2019-05-05 2019-07-30 中国人民解放军国防科技大学 Dual-target robust resource allocation method under resource transfer visual angle
CN110570011A (en) * 2019-08-02 2019-12-13 中国船舶工业系统工程研究院 Complex system resource optimization scheduling method and system under multi-constraint condition
CN110969308A (en) * 2019-12-10 2020-04-07 浙江工业大学 Heuristic resource-limited project scheduling optimization method based on dynamic key tasks

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
考虑人机匹配模式的舰载机甲板机务勤务保障调度算法;苏析超 等;《航空学报》;20180615;第39卷(第12期);全文 *

Also Published As

Publication number Publication date
CN111882145A (en) 2020-11-03

Similar Documents

Publication Publication Date Title
CN111882145B (en) Airplane service support serial scheduling method considering resource transfer time
US5295065A (en) Resource-lot association coordinator
Cheng A knowledge-based airport gate assignment system integrated with mathematical programming
US7957987B2 (en) Using software agents to schedule airline flights
JP5684629B2 (en) Job management system and job management method
CN103514277B (en) The tasks in parallel disposal route of power information acquisition system
CN108399104B (en) Multi-Agent-based elastic and telescopic task planning system and method
CN111882144B (en) Airplane guarantee procedure parallel scheduling method considering resource transfer
CN104639594A (en) System and method for allocating physical resources and virtual resources
CN113034015B (en) Airport check-in personnel scheduling method based on constraint relaxation solving
CN112633562B (en) Airport stand intelligent scheduling method
CN112230677A (en) Unmanned aerial vehicle group task planning method and terminal equipment
CN114169748A (en) Multi-robot task allocation method, system, device and readable storage medium
CN113238533B (en) System and method for dynamically scheduling and issuing job tasks of mobile robot
CN111552241A (en) Assembly production line simulation model optimization method
CN110134533B (en) System and method capable of scheduling data in batches
CN112070370A (en) Relay satellite task planning method, system and storage medium
CN103024791A (en) Multi-service processing model and multi-service processing method in communication test system
CN116430736A (en) Multi-agent autonomous cooperative allocation method for aerospace measurement and control
CN118246607A (en) Machine position distribution method based on dynamic task graph modeling
Huang et al. Market-based multiagent system for reconfiguration of shipboard power systems
Reddy et al. Simultaneous scheduling of machines and tools in multi machine FMS using crow search algorithm
CN112286631A (en) Kubernetes resource scheduling method and device and electronic equipment
CN111950869A (en) Iterative solution method and system for improving initial solution of scheduling problem of space measurement and control network
CN113505949B (en) Space vehicle part authority allocation method based on mission milestone

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