CN115049200A - Job management method, apparatus, electronic device, and storage medium - Google Patents

Job management method, apparatus, electronic device, and storage medium Download PDF

Info

Publication number
CN115049200A
CN115049200A CN202210447938.2A CN202210447938A CN115049200A CN 115049200 A CN115049200 A CN 115049200A CN 202210447938 A CN202210447938 A CN 202210447938A CN 115049200 A CN115049200 A CN 115049200A
Authority
CN
China
Prior art keywords
job
interruption
time
resource
jobs
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210447938.2A
Other languages
Chinese (zh)
Inventor
米雪菲
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bank of China Financial Technology Co Ltd
Original Assignee
Bank of China Financial Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Bank of China Financial Technology Co Ltd filed Critical Bank of China Financial Technology Co Ltd
Priority to CN202210447938.2A priority Critical patent/CN115049200A/en
Publication of CN115049200A publication Critical patent/CN115049200A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06313—Resource planning in a project environment
    • 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
    • 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/10—Office automation; Time management
    • G06Q10/103—Workflow collaboration or project management

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biodiversity & Conservation Biology (AREA)
  • Data Mining & Analysis (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • General Factory Administration (AREA)

Abstract

The invention provides a job management method, a job management device, an electronic device and a storage medium, wherein the method comprises the following steps: acquiring an initial operation scheduling plan and a resource interruption interval of a project to be processed; determining a job set corresponding to each interruption time based on each interruption time in the resource interruption interval and job starting time and job finishing time corresponding to each job in the initial job scheduling plan; if the resource usage of all the jobs in the job set corresponding to any interruption moment does not meet the preset condition, determining a rescheduling job sequence corresponding to any interruption moment based on the resource usage of each job in the job set corresponding to any interruption moment and the job ending moment; and adjusting the initial operation scheduling plan of the project to be processed based on the rescheduling operation sequence corresponding to any interruption moment. The method and the device provided by the invention reduce the direct change cost of the project to be processed and improve the production efficiency of the project.

Description

Job management method, device, electronic device and storage medium
Technical Field
The present invention relates to the field of engineering management technologies, and in particular, to a method and an apparatus for job management, an electronic device, and a storage medium.
Background
A production project for large equipment usually includes multiple jobs, each job has a corresponding timing and duration, and certain resources are used.
During the work of these projects, the resources in the production process are typically configured by relying on manual work to make a work management plan. The situation of dynamic resource interruption may occur in the actual production process, and the resource allocation of the project cannot adapt to the adjustment of the operation time sequence and the construction period due to the dynamic resource interruption, so that the utilization efficiency of the resources is reduced, the production efficiency of the whole project is reduced, and the production cost of the whole project is improved.
Disclosure of Invention
The invention provides a job management method, a job management device, electronic equipment and a storage medium, which are used for solving the technical problems that the job management method in the prior art cannot cope with the situation of dynamic resource interruption, and has low resource utilization rate, low production efficiency and high production cost.
The invention provides a job management method, which comprises the following steps:
acquiring an initial operation scheduling plan and a resource interruption interval of a project to be processed;
determining a job set corresponding to each interruption time based on each interruption time in the resource interruption interval and job starting time and job ending time corresponding to each job in the initial job scheduling plan;
if the resource usage of all the jobs in the job set corresponding to any interruption time does not meet the preset condition, determining a rescheduling job sequence corresponding to any interruption time based on the resource usage of each job in the job set corresponding to any interruption time and the job ending time;
adjusting the initial job scheduling plan of the project to be processed based on the rescheduling job sequence corresponding to any interruption moment;
the preset condition is that the resource usage of all the jobs in the job set corresponding to any interrupt time is less than or equal to the resource total limit corresponding to any interrupt time.
According to the job management method provided by the present invention, before determining a rescheduled job sequence corresponding to any one of the interrupt times based on the resource usage amount and the job end time of each job in the job set corresponding to the any one of the interrupt times, the method includes:
if the interruption unfinished operation exists in the operation set corresponding to any interruption time, adjusting the operation starting time and the work period of the interruption unfinished operation based on the starting time of the resource interruption interval and the operation finishing time corresponding to the interruption unfinished operation;
wherein the operation starting time of the interruption unfinished operation is less than the starting time of the resource interruption interval, and the operation finishing time of the interruption unfinished operation is greater than the starting time of the resource interruption interval.
According to the job management method provided by the present invention, the determining a rescheduled job sequence corresponding to any interrupt time based on the resource usage amount and the job end time of each job in the job set corresponding to any interrupt time includes:
determining a plurality of first jobs and a plurality of second jobs corresponding to any interruption time based on the resource usage amount of each job in the job set corresponding to any interruption time, the resource usage amount of all jobs in the job set corresponding to any interruption time, and the total resource amount upper limit corresponding to any interruption time; the resource usage of the first job is greater than the second job;
and determining a rescheduling job sequence corresponding to any interruption time based on the job end time of the first jobs and the job end time of each first job and the resource usage amount of the second jobs and the resource usage amount of each second job.
According to a job management method of the present invention, the determining a rescheduled job sequence corresponding to any one of the interruption times based on the job end times of the plurality of first jobs and the respective first jobs and the resource usage amounts of the plurality of second jobs and the respective second jobs includes:
determining a difference value between the operation ending time and the interruption time of each first operation, and performing descending arrangement on each first operation based on the difference value to obtain a first rescheduling operation subsequence;
sequencing each second job in a descending order based on the resource usage amount of each second job to obtain a second rescheduling job subsequence;
and determining a rescheduling job sequence corresponding to any interruption moment based on the first rescheduling job subsequence and the second rescheduling job subsequence.
According to the job management method provided by the present invention, the adjusting the initial job scheduling plan of the to-be-processed item based on the rescheduling job sequence corresponding to any one of the interruption times includes:
based on the sequence of each job in the rescheduling job sequence corresponding to any interruption time, sequentially deleting the job ranked at the head, and adjusting the job starting time of the deleted job to the ending time of the resource interruption interval;
and if the resource usage of all the jobs in the rescheduling job sequence corresponding to any interruption time after the current deletion is executed is less than or equal to the resource total upper limit corresponding to any interruption time, stopping the deletion, and adjusting the initial job scheduling plan of the project to be processed based on the rescheduling job sequence corresponding to any interruption time after the current deletion is executed.
According to the job management method provided by the present invention, after the initial job scheduling plan of the to-be-processed item is adjusted, the method includes:
determining the resource cost of the project to be processed based on the unit price of each resource and the resource usage amount of all the jobs;
determining the rescheduling cost of the project to be processed based on the job end time of all jobs in the initial job scheduling plan and the actual job end time of all jobs after the initial job scheduling plan is adjusted;
determining the punishment cost of the project to be processed based on the actual construction period of the project to be processed after the initial job scheduling plan is adjusted and the specified total construction period of the project to be processed;
determining a cost of the project to be processed based on the resource cost, the rescheduling cost, and the penalty cost.
The invention provides a job management apparatus, comprising:
the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring an initial job scheduling plan and a resource interruption interval of a project to be processed;
a determining unit, configured to determine a job set corresponding to each interruption time based on each interruption time within the resource interruption interval and a job start time and a job end time corresponding to each job in the initial job scheduling plan;
a comparing unit, configured to, if there is a job set corresponding to any one interrupt time in which the resource usage amounts of all jobs in the job set do not meet a preset condition, determine a rescheduling job sequence corresponding to the any interrupt time based on the resource usage amount and a job end time of each job in the job set corresponding to the any interrupt time;
the adjusting unit is used for adjusting the initial job scheduling plan of the project to be processed based on the rescheduling job sequence corresponding to any interrupt time;
the preset condition is that the resource usage of all the jobs in the job set corresponding to any interruption time is less than or equal to the resource total upper limit corresponding to any interruption time.
The invention provides an electronic device which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the processor realizes the job management method when executing the program.
The present invention provides a non-transitory computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the job management method.
The invention provides a computer program product comprising a computer program which, when executed by a processor, implements the job management method.
The invention provides a job management method, a device, an electronic device and a storage medium, which determine a job set corresponding to each interruption time according to each interruption time in a resource interruption interval and job starting time and job ending time corresponding to each job in an initial job scheduling plan; when the resource usage of all the jobs in the job set corresponding to any interruption time does not meet the preset condition, determining a rescheduling job sequence corresponding to any interruption time according to the resource usage of each job in the job set corresponding to any interruption time and the job ending time, and adjusting the initial job scheduling plan of the project to be processed.
Drawings
In order to more clearly illustrate the technical solutions of the present invention or the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a flow chart of a job management method according to the present invention;
FIG. 2 is a second flowchart illustrating a job management method according to the present invention;
FIG. 3 is a schematic diagram of a job management apparatus according to the present invention;
fig. 4 is a schematic structural diagram of an electronic device provided in the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is obvious that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the terms "first", "second", etc. in the present invention are used for distinguishing similar objects, and are not necessarily used for describing a particular order or sequence. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Fig. 1 is a schematic flowchart of a job management method provided by the present invention, and as shown in fig. 1, the method includes step 110, step 120, step 130 and step 140.
And step 110, acquiring an initial job scheduling plan and a resource interruption interval of the project to be processed.
Specifically, the items to be processed in the embodiment of the present invention may be production items of large equipment, such as assembly items of an aircraft.
The initial job scheduling plan is a job plan which is made when a project to be processed is started and comprises a plurality of jobs, and a job starting time, a job ending time and a resource usage amount which correspond to each job. The resource interruption interval is a time interval corresponding to the occurrence of the resource interruption event. The difference between the end time and the start time of the project is the project construction period, and the difference between the end time and the start time of the operation is the construction period of the operation.
For example, for a project, its initial job schedule may include J jobs, with the job set denoted as J ∈ {1,2, …, J }, and J being the number of jobs. Each job j needs to use K different renewable resources, which can be reused, and the set of resource categories is represented as K e {1,2, …, K }, where K is the number of the resource category. The operation time of the item is discretized, the operation time set is represented as T ═ {1,2, …, T }, and T is the number of the operation time. Setting the total construction period of the project as T 1 I.e. byThe time for completing the last operation should not exceed T 1 。
The resource interruption interval may be denoted as t ks ,t kf ]. Wherein, t ks Is the starting time of the kth resource interrupt, t kf Is the ending time of the kth resource interrupt.
And step 120, determining a job set corresponding to each interruption time based on each interruption time in the resource interruption interval and the job starting time and the job ending time corresponding to each job in the initial job scheduling plan.
In particular, a resource interrupt event can affect a portion of a job in a pending project. For example, if a certain kind of resource is needed while a certain job is in progress, when a resource interruption event occurs, the certain kind of resource may not be provided, so that the job may not be performed normally. Resource interruption events may cause the pending item to fail to execute according to the initial job scheduling plan, and therefore, the initial job scheduling plan needs to be adjusted.
The interruption time refers to each time in the resource interruption interval. The job start time and the job end time corresponding to each job in the initial job scheduling plan may be compared with each interruption time in the resource interruption interval to determine a job set corresponding to each interruption time.
For example, the interruption time is t, and the job start time is st for job j in the initial job scheduling plan j The operation end time is ft j The resource usage amount for the kth resource is r jk When r is jk >0，st j ≤t<ft j When the time is shorter, it can be considered that the job j corresponds to the interruption time t. All the jobs corresponding to the interruption time t are arranged to obtain a job set A corresponding to the interruption time t t 。
Step 130, if the resource usage of all the jobs in the job set corresponding to any interruption time does not meet the preset condition, determining a rescheduling job sequence corresponding to the interruption time based on the resource usage of each job in the job set corresponding to the interruption time and the job ending time; the preset condition is that the resource usage of all the jobs in the job set corresponding to any interruption time is less than or equal to the upper limit of the total resource amount corresponding to the interruption time.
Specifically, the adjustment of the job time of each job needs to be determined in consideration of the influence of each job on the entire to-be-processed item. In the prior art, a translation algorithm is usually adopted to solve the problem of resource interruption, that is, all affected jobs are translated backwards for the time length of resource interruption. The solution cost generated by the algorithm is often too high, which brings a part of unnecessary variation cost and is not feasible in actual operation.
When the upper limit of the interrupt resource is not zero, a part of directly influenced jobs do not need to be rescheduled, even if the jobs need to use the interrupt resource in the execution process, the jobs are not limited by the upper limit of the resource interrupt in the execution process because the usage amount is small enough, and the rescheduled is not needed, and the rescheduled under the resource interrupt limitation can be completed only by scheduling the jobs with larger usage amount of the interrupt resource. Meanwhile, all directly affected jobs are sequenced according to the priority of the required number of the interrupt resources from large to small, so that the number of the jobs participating in rescheduling is reduced as little as possible, and the direct change cost is indirectly reduced.
In order to minimize the rescheduling of the whole job by selecting the job in the whole resource interruption interval, the embodiment of the invention adds consideration to the ending time of the job. When the resource usage of some jobs is sufficiently large, the job having the later job end time is more influential in rescheduling than the job having the earlier job end time in the resource interruption interval, and it is possible to meet the requirement of the upper limit of the resource interruption by rescheduling a small number of jobs. Conversely, some jobs that have a sufficiently large resource usage but a short duration may be rescheduled, in which case the directly affected jobs are rescheduled more times, and further there are more indirectly affected jobs, which may result in a greater change cost overall.
Specifically, if the resource usage of all the jobs in the job set corresponding to any interruption time is less than or equal to the upper limit of the total resource amount corresponding to the interruption time, it indicates that the resource interruption event has no influence on the job corresponding to the interruption time. Therefore, the method can be used as a preset condition for judging whether to reschedule each job in the job set corresponding to any interrupt time.
If the resource usage of all the jobs in the job set corresponding to any interrupt time does not meet the preset condition, the rescheduling job sequence corresponding to the interrupt time can be determined according to the resource usage of each job in the job set corresponding to the interrupt time and the job ending time.
The rescheduling job sequence is a job sequence obtained by reordering all jobs in a job set corresponding to any interruption time.
And 140, adjusting the initial job scheduling plan of the project to be processed based on the rescheduling job sequence corresponding to any interruption moment.
Specifically, after obtaining the rescheduled job sequence corresponding to any interruption time, the job start time and the job end time of each job in the initial job scheduling plan of the item to be processed may be adjusted according to the job start time and the job end time of each job in the rescheduled job sequence, so as to obtain the job scheduling plan meeting the requirements.
According to the job management method provided by the embodiment of the invention, a job set corresponding to each interruption time is determined according to each interruption time in a resource interruption interval and the job starting time and the job ending time corresponding to each job in an initial job scheduling plan; when the resource usage of all the jobs in the job set corresponding to any interruption time does not meet the preset condition, determining a rescheduling job sequence corresponding to any interruption time according to the resource usage of each job in the job set corresponding to any interruption time and the job ending time, and adjusting the initial job scheduling plan of the project to be processed.
Based on the above embodiment, step 130 includes, before:
if the interruption unfinished operation exists in the operation set corresponding to any interruption time, adjusting the operation starting time and the work period of the interruption unfinished operation based on the starting time of the resource interruption interval and the operation ending time corresponding to the interruption unfinished operation;
the operation starting time of the interruption unfinished operation is less than the starting time of the resource interruption interval, and the operation finishing time of the interruption unfinished operation is greater than the starting time of the resource interruption interval.
Specifically, an interruption uncompleted job refers to a job that has not yet been completely completed at the start of the resource interruption. The interruption uncompleted job can be obtained by comparing the job start time and the job end time of each job with the start time of the resource interruption interval, and for example, if the job start time of any job is less than the start time of the resource interruption interval and the job end time of the interruption uncompleted job is greater than the start time of the resource interruption interval, the job is an interruption uncompleted job.
Before rescheduling all the jobs in the job set corresponding to any interruption time, the job start time should be re-determined for the interrupted uncompleted jobs in the job set. The job starting time of the interruption unfinished job is adjusted to the starting time of the resource interruption interval, and the construction period is adjusted to the difference between the job ending time and the starting time of the resource interruption in the initial job scheduling plan.
For example,
Figure BDA0003616151630000101
and indicating the operation set corresponding to the interruption time t when the kth resource is interrupted. For the interruption unfinished job j in the set, the adjusted jobj job start time st j ′＝t ks The time limit for the adjusted work j j ′＝ft j -t ks 。
Based on any of the above embodiments, step 130 includes:
determining a plurality of first jobs and a plurality of second jobs corresponding to any interruption time based on the resource usage amount of each job in the job set corresponding to any interruption time, the resource usage amount of all jobs in the job set corresponding to any interruption time, and the total resource amount upper limit corresponding to any interruption time; the resource usage of the first job is greater than the second job;
a rescheduled job sequence corresponding to any one of the interruption times is determined based on the job end times of the plurality of first jobs and the respective first jobs, and the resource usage amounts of the plurality of second jobs and the respective second jobs.
Specifically, when each job in the job set corresponding to any interrupt time is rescheduled, the rescheduling priority of each job may be determined according to the resource usage amount of each job and the job end time. The priority determination method comprises the steps of dividing each operation into two types according to the resource usage amount of the operation, and determining a scheduling sequence according to the adjusted construction period from long to short for the operation with larger resource usage amount; for a job with a smaller resource usage amount, the scheduling order may be determined according to the resource usage amount from large to small.
The resource usage of all the jobs in the job set corresponding to any interruption time t to the kth resource can be R tk Indicating that the total resource amount upper limit of the kth resource corresponding to any interrupt time t can be UR tk And (4) showing. For any operation set A corresponding to any interruption time t t Resource usage r of middle job j jk If r is jk ≥R tk -UR tk If so, the resource usage of the job j is indicated to be larger, and the job j can be determined as a first job; otherwise, it indicates that the resource usage of the job j is small, and it may be determined as the second job. The resource usage of the first job is greater than the second job.
According to the method, a plurality of first jobs and a plurality of second jobs corresponding to any one interrupt time can be determined. Then, a scheduling order may be determined for the plurality of first jobs according to the job end time of each first job, and a scheduling order may be determined for the plurality of second jobs according to the resource usage amount of each second job, so as to obtain a rescheduled job sequence corresponding to the interruption time.
Based on any one of the above embodiments, determining a rescheduled job sequence corresponding to any one of the interruption times based on the job end times of the plurality of first jobs and the respective first jobs and the resource usage amounts of the plurality of second jobs and the respective second jobs includes:
determining a difference value between the operation ending time and the interruption time of each first operation, and performing descending arrangement on each first operation based on the difference value to obtain a first rescheduling operation subsequence;
sequencing each second job in a descending order based on the resource usage amount of each second job to obtain a second rescheduling job subsequence;
and determining a rescheduled job sequence corresponding to the interruption time based on the first rescheduled job subsequence and the second rescheduled job subsequence.
Specifically, a set of a plurality of first job components may be represented as a job set B, and a set of a plurality of second job components may be represented as a job set C.
For a job j in the job set B, the job end time ft of the job j is determined j Difference (ft) from any one of the interruption times t j -t) sorting the first jobs in descending order according to the difference, i.e. sorting the first jobs according to the size of the difference from large to small, resulting in a first rescheduled job sub-sequence B'.
For a job j in a job set C, determining a resource usage r of the job j jk And sorting the second jobs in a descending order according to the resource usage, namely sorting the second jobs from large to small according to the resource usage to obtain a second rescheduled job subsequence C'.
Merging the first rescheduled job subsequence B 'and the second rescheduled job subsequence C', and arranging the first rescheduled job subsequence in the secondDetermining a rescheduling job sequence A corresponding to the interruption time before the double-scheduling job subsequence t ′＝{B′,C′}。
Based on any of the above embodiments, step 140 includes:
sequentially deleting the jobs ranked at the top based on the arrangement sequence of the jobs in the rescheduling job sequence corresponding to any interruption time, and adjusting the job starting time of the deleted jobs to the ending time of the resource interruption interval;
and if the resource usage of all the jobs in the rescheduling job sequence corresponding to the interruption time after the current deletion is executed is less than or equal to the resource total upper limit corresponding to the interruption time, stopping the deletion, and adjusting the initial job scheduling plan of the project to be processed based on the rescheduling job sequence corresponding to the interruption time after the current deletion is executed.
Specifically, for any interrupt time t, the jobs ranked first may be deleted sequentially in the ranking order of the jobs in the rescheduled job sequence. And deleting only the first-ranked job each time, and determining the resource usage amount of all the jobs in the rescheduled job sequence corresponding to the interruption time after deleting the first-ranked job.
If the resource usage of all the jobs in the rescheduling job sequence corresponding to the interruption time after the current deletion execution is less than or equal to the resource total upper limit corresponding to the interruption time, it indicates that each job in the rescheduling job sequence corresponding to the interruption time after the deletion can be completed by using the resource corresponding to the interruption time, at this moment, the deletion should be stopped, and the rescheduling job sequence corresponding to the interruption time after the current deletion execution is used as a final result, so as to adjust the initial job scheduling plan of the item to be processed.
The deleted job in each deletion process is scheduled to be executed after the resource interruption interval, namely, the deleted job is adjusted to have the adjusted job starting time st j ′＝t kf Adjusted operation end time ft j ′＝st j ′+dur j ′。
Based on any of the above embodiments, step 140 includes, after:
determining the resource cost of the project to be processed based on the unit price of each resource and the resource usage amount of all the jobs;
determining the rescheduling cost of the project to be processed based on the operation ending time of all the operations in the initial operation scheduling plan and the actual operation ending time of all the operations after the initial operation scheduling plan is adjusted;
determining the punishment cost of the project to be processed based on the actual construction period of the project to be processed after the initial operation scheduling plan is adjusted and the specified total construction period of the project to be processed;
determining the cost of the project to be processed based on the resource cost, the rescheduling cost and the penalty cost.
Specifically, the to-be-processed item includes a plurality of jobs, each job having a certain duration. The project to be processed is restricted by three aspects, namely timing restriction, construction period restriction and resource restriction. The time sequence constraint means that different operations need to be performed according to a certain sequence, and the sequence cannot be randomly adjusted. A project time constraint means that a project needs to be completed within a specified time, i.e., all jobs within the project must be completed within a specified time. The resource constraint means that the number of resources that can be used by one project is limited, that is, there is an upper limit on the resources, and the sum of the resources used by all jobs performed at the same time cannot exceed the upper limit.
Unit price according to kth resource C k And resource usage R of all jobs corresponding to each time t tk Determining the resource cost Z of the project to be processed 1 Is formulated as:
Figure BDA0003616151630000131
according to the job end time ft of all the jobs in the initial job scheduling plan j And the actual job end time ft of all jobs after the initial job scheduling plan adjustment j ', determining the rescheduling cost Z of the item to be processed 2 Using a formula tableShown as follows:
Figure BDA0003616151630000132
where M' is the unit cost when the job varies.
Determining the punishment cost Z of the project to be processed according to the actual construction period of the project to be processed after the initial operation scheduling plan is adjusted and the specified total construction period of the project to be processed 3 Is formulated as:
Z 3 ＝M″·(st J ′-T 1 )
where M' is the unit penalty cost for a total period exceeding a given period, st J ' actual construction period of the project to be processed after the initial job scheduling plan is adjusted.
The cost Z of the pending item can be expressed as:
Z＝Z 1 +Z 2 +Z 3
rescheduling the item to be processed is to minimize the cost Z of the item to be processed.
Based on any of the above embodiments, fig. 2 is a second schematic flow chart of the job management method provided by the present invention, as shown in fig. 2, the method includes:
firstly, according to a time sequence, sequentially determining an ongoing operation set A at each moment t in a resource interruption interval t . I.e. for j ∈ A t Satisfy st j ≤t<ft j ，r jk >0；
And step two, executing the interruption of the operation on the operation which is not completely completed at the resource interruption starting moment, uniformly changing the starting time of the operation into the starting time of the resource interruption, and changing the construction period into the original construction period-the starting time of the resource interruption. Namely for
Figure BDA0003616151630000141
Let st j ′＝t ks ,dur j ′＝ft j -t ks ；
Step three,Calculating the use condition of the interrupted resource at each moment in the resource interruption interval, and judging whether the use condition meets the requirement of the upper limit of the resource, namely whether the use condition meets R tk ≤UR tk ,
Figure BDA0003616151630000142
If not, turning to the fourth step; if yes, turning to the tenth step;
step four, for the job j which is in process at the moment t which does not meet the requirement of the upper limit of the resource, judging whether the usage amount of the interrupted resource is more than or equal to the moment, and the difference value between the total usage amount of the interrupted resource before the interruption of the resource and the upper limit of the interrupted resource, namely j ∈ A t Whether or not r is satisfied jk ≥R tk -UR tk . If yes, storing the data in the subset B, enabling j to belong to B, and turning to the step five; if not, storing the data in the subset C, enabling j to belong to C, and turning to the step six;
step five, for j e to B, sorting the j from large to small according to the difference value of the end time and the current time of the operation, namely according to (ft) j -t) sorting by size;
step six, for j epsilon C, according to the interrupted resource usage r of each operation jk Sorting from big to small;
seventhly, combining the subsets B and C and updating the set A t Into an ordered set with subset B preceding, i.e. A t ＝{B,C}；
Step eight, the set A t The operation j with the middle rank at the first position is rearranged until the ending time of the resource interruption, namely st j ′＝t kf ,ft j ′＝st j ′+dur j ′；
Step nine, from set A t Deleting the job j, adjusting the initial job scheduling plan of the project to be processed, and turning to the third step;
step ten, finishing the rescheduling scheme and calculating the total cost.
Based on any of the above embodiments, fig. 3 is a schematic structural diagram of a job management apparatus provided by the present invention, and as shown in fig. 3, the apparatus includes:
an obtaining unit 310, configured to obtain an initial job scheduling plan and a resource interruption interval of a to-be-processed project;
a determining unit 320, configured to determine a job set corresponding to each interruption time based on each interruption time in the resource interruption interval and a job start time and a job end time corresponding to each job in the initial job scheduling plan;
a comparing unit 330, configured to determine a rescheduling job sequence corresponding to any one interrupt time based on the resource usage amount and the job end time of each job in the job set corresponding to any one interrupt time if the resource usage amounts of all jobs in the job set corresponding to any one interrupt time do not meet the preset condition;
an adjusting unit 340, configured to adjust an initial job scheduling plan of the item to be processed based on a rescheduling job sequence corresponding to any interruption time;
the preset condition is that the resource usage of all the jobs in the job set corresponding to any interruption time is less than or equal to the upper limit of the total resource amount corresponding to any interruption time.
The job management device provided by the embodiment of the invention determines a job set corresponding to each interruption time according to each interruption time in a resource interruption interval and job starting time and job ending time corresponding to each job in an initial job scheduling plan; when the resource usage of all the jobs in the job set corresponding to any interruption time does not meet the preset condition, determining a rescheduling job sequence corresponding to any interruption time according to the resource usage of each job in the job set corresponding to any interruption time and the job ending time, and adjusting the initial job scheduling plan of the project to be processed.
Based on any embodiment above, the apparatus further comprises:
a time adjustment unit for adjusting the operation start time and the work period of the interruption uncompleted operation based on the start time of the resource interruption interval and the operation end time corresponding to the interruption uncompleted operation if the interruption uncompleted operation exists in the operation set corresponding to any interruption time;
the operation starting time of the interrupted unfinished operation is smaller than the starting time of the resource interruption interval, and the operation ending time of the interrupted unfinished operation is larger than the starting time of the resource interruption interval.
Based on any of the embodiments described above, the comparing unit is specifically configured to:
determining a plurality of first jobs and a plurality of second jobs corresponding to any interruption time based on the resource usage amount of each job in the job set corresponding to any interruption time, the resource usage amount of all jobs in the job set corresponding to any interruption time, and the total resource amount upper limit corresponding to any interruption time; the resource usage of the first job is greater than the second job;
a rescheduled job sequence corresponding to any one of the interruption times is determined based on the job end times of the plurality of first jobs and the respective first jobs, and the resource usage amounts of the plurality of second jobs and the respective second jobs.
Based on any of the above embodiments, the comparing unit is further specifically configured to:
determining a difference value between the operation ending time and the interruption time of each first operation, and performing descending arrangement on each first operation based on the difference value to obtain a first rescheduling operation subsequence;
sequencing each second job in a descending order based on the resource usage amount of each second job to obtain a second rescheduling job subsequence;
and determining a rescheduling job sequence corresponding to any interruption moment based on the first rescheduling job subsequence and the second rescheduling job subsequence.
Based on any of the embodiments above, the adjusting unit is specifically configured to:
based on the arrangement sequence of each job in the rescheduling job sequence corresponding to any interruption time, sequentially deleting the jobs arranged at the top, and adjusting the job starting time of the deleted jobs to the ending time of the resource interruption interval;
and if the resource usage of all the jobs in the rescheduling job sequence corresponding to any interruption time after the current deletion execution is less than or equal to the resource total upper limit corresponding to any interruption time, stopping the deletion, and adjusting the initial job scheduling plan of the item to be processed based on the rescheduling job sequence corresponding to any interruption time after the current deletion execution.
Based on any of the above embodiments, the apparatus further comprises:
the cost determination unit is used for determining the resource cost of the project to be processed based on the unit price of each resource and the resource usage amount of all the jobs;
determining the rescheduling cost of the project to be processed based on the job end time of all jobs in the initial job scheduling plan and the actual job end time of all jobs after the initial job scheduling plan is adjusted;
determining the punishment cost of the project to be processed based on the actual construction period of the project to be processed after the initial operation scheduling plan is adjusted and the specified total construction period of the project to be processed;
determining the cost of the project to be processed based on the resource cost, the rescheduling cost and the penalty cost.
Based on any of the above embodiments, fig. 4 is a schematic structural diagram of an electronic device provided by the present invention, and as shown in fig. 4, the electronic device may include: a Processor (Processor)410, a communication Interface (communication Interface)420, a Memory (Memory)430 and a communication Bus (communication Bus)440, wherein the Processor 410, the communication Interface 420 and the Memory 430 are communicated with each other via the communication Bus 440. The processor 410 may call logical commands in the memory 430 to perform the following method:
acquiring an initial operation scheduling plan and a resource interruption interval of a project to be processed; determining a job set corresponding to each interruption time based on each interruption time in the resource interruption interval and job starting time and job finishing time corresponding to each job in the initial job scheduling plan; if the resource usage of all the jobs in the job set corresponding to any interruption moment does not meet the preset condition, determining a rescheduling job sequence corresponding to any interruption moment based on the resource usage of each job in the job set corresponding to any interruption moment and the job ending moment; adjusting an initial job scheduling plan of the project to be processed based on a rescheduling job sequence corresponding to any interruption moment; the preset condition is that the resource usage of all the jobs in the job set corresponding to any interruption time is less than or equal to the upper limit of the total resource amount corresponding to any interruption time.
In addition, the logic commands in the memory 430 may be implemented in the form of software functional units and stored in a computer readable storage medium when the logic commands are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes a plurality of commands for enabling a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The processor in the electronic device provided in the embodiment of the present invention may call a logic instruction in the memory to implement the method, and the specific implementation manner of the method is consistent with the implementation manner of the method, and the same beneficial effects may be achieved, which is not described herein again.
Embodiments of the present invention further provide a non-transitory computer-readable storage medium, on which a computer program is stored, where the computer program is implemented to perform the methods provided in the foregoing embodiments when executed by a processor, and a specific implementation manner of the method is consistent with the foregoing method implementation manner and can achieve the same beneficial effects, and details are not repeated herein.
Embodiments of the present invention provide a computer program product, which includes a computer program, and when being executed by a processor, the computer program implements the steps of the method.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes commands for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, and not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims (10)

1. A job management method, comprising:
acquiring an initial operation scheduling plan and a resource interruption interval of a project to be processed;
determining a job set corresponding to each interruption time based on each interruption time in the resource interruption interval and job starting time and job ending time corresponding to each job in the initial job scheduling plan;
if the resource usage of all the jobs in the job set corresponding to any interruption time does not meet the preset condition, determining a rescheduling job sequence corresponding to any interruption time based on the resource usage of each job in the job set corresponding to any interruption time and the job ending time;
adjusting the initial job scheduling plan of the project to be processed based on the rescheduling job sequence corresponding to any interruption moment;
the preset condition is that the resource usage of all the jobs in the job set corresponding to any interruption time is less than or equal to the resource total upper limit corresponding to any interruption time.
2. The method according to claim 1, wherein the method for determining, based on the resource usage amount and the job end time of each job in the job set corresponding to the any interrupt time, that precedes the rescheduled job sequence corresponding to the any interrupt time comprises:
if the interruption unfinished operation exists in the operation set corresponding to any interruption time, adjusting the operation starting time and the work period of the interruption unfinished operation based on the starting time of the resource interruption interval and the operation finishing time corresponding to the interruption unfinished operation;
wherein the operation starting time of the interruption unfinished operation is less than the starting time of the resource interruption interval, and the operation finishing time of the interruption unfinished operation is greater than the starting time of the resource interruption interval.
3. The job management method according to claim 1, wherein the determining a rescheduled job sequence corresponding to the any interrupt time based on a resource usage amount and a job end time of each job in the job set corresponding to the any interrupt time comprises:
determining a plurality of first jobs and a plurality of second jobs corresponding to any interruption time based on the resource usage amount of each job in the job set corresponding to any interruption time, the resource usage amount of all jobs in the job set corresponding to any interruption time, and the total resource amount upper limit corresponding to any interruption time; the resource usage of the first job is greater than the second job;
and determining a rescheduling job sequence corresponding to any interruption time based on the job end time of the first jobs and the job end time of each first job and the resource usage amount of the second jobs and the resource usage amount of each second job.
4. The job management method according to claim 3, wherein the determining a rescheduled job sequence corresponding to the any one of the interruption times based on the job end times of the plurality of first jobs and the respective first jobs and the resource usage amounts of the plurality of second jobs and the respective second jobs includes:
determining a difference value between the operation ending time and the interruption time of each first operation, and performing descending arrangement on each first operation based on the difference value to obtain a first rescheduling operation subsequence;
sequencing each second job in a descending order based on the resource usage amount of each second job to obtain a second rescheduling job subsequence;
and determining a rescheduling job sequence corresponding to any interruption moment based on the first rescheduling job subsequence and the second rescheduling job subsequence.
5. The method according to claim 1, wherein the adjusting the initial job scheduling plan of the to-be-processed item based on the rescheduled job sequence corresponding to the any one of the interruption times comprises:
sequentially deleting the jobs ranked at the top based on the arrangement sequence of the jobs in the rescheduling job sequence corresponding to any interruption time, determining the resource usage amount of all the jobs in the rescheduling job sequence corresponding to any interruption time after deleting the jobs ranked at the top each time, and adjusting the job starting time of the deleted jobs to be the ending time of the resource interruption interval;
and if the resource usage of all the jobs in the rescheduling job sequence corresponding to any interruption time after the current deletion is executed is less than or equal to the resource total upper limit corresponding to any interruption time, stopping the deletion, and adjusting the initial job scheduling plan of the project to be processed based on the rescheduling job sequence corresponding to any interruption time after the current deletion is executed.
6. The method according to any one of claims 1 to 5, wherein after the adjustment of the initial job scheduling plan of the item to be processed, the method comprises:
determining the resource cost of the project to be processed based on the unit price of each resource and the resource usage amount of all the jobs;
determining the rescheduling cost of the project to be processed based on the job end time of all jobs in the initial job scheduling plan and the actual job end time of all jobs after the initial job scheduling plan is adjusted;
determining the punishment cost of the project to be processed based on the actual construction period of the project to be processed after the initial operation scheduling plan is adjusted and the specified total construction period of the project to be processed;
determining a cost of the project to be processed based on the resource cost, the rescheduling cost, and the penalty cost.
7. A work management device, comprising:
the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring an initial job scheduling plan and a resource interruption interval of a project to be processed;
a determining unit, configured to determine a job set corresponding to each interruption time based on each interruption time in the resource interruption interval and a job start time and a job end time corresponding to each job in the initial job scheduling plan;
the comparison unit is used for determining a rescheduling job sequence corresponding to any interruption time based on the resource usage amount and the job ending time of each job in the job set corresponding to any interruption time if the resource usage amounts of all jobs in the job set corresponding to any interruption time do not meet the preset condition;
the adjusting unit is used for rescheduling the job sequence corresponding to any interruption time and adjusting the initial job scheduling plan of the project to be processed;
the preset condition is that the resource usage of all the jobs in the job set corresponding to any interruption time is less than or equal to the resource total upper limit corresponding to any interruption time.
8. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the job management method according to any one of claims 1 to 6 when executing the program.
9. A non-transitory computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the job management method according to any one of claims 1 to 6.
10. A computer program product comprising a computer program, wherein the computer program, when executed by a processor, implements a job management method as claimed in any one of claims 1 to 6.
CN202210447938.2A 2022-04-26 2022-04-26 Job management method, apparatus, electronic device, and storage medium Pending CN115049200A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210447938.2A CN115049200A (en) 2022-04-26 2022-04-26 Job management method, apparatus, electronic device, and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210447938.2A CN115049200A (en) 2022-04-26 2022-04-26 Job management method, apparatus, electronic device, and storage medium

Publications (1)

Publication Number Publication Date
CN115049200A true CN115049200A (en) 2022-09-13

Family

ID=83157334

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210447938.2A Pending CN115049200A (en) 2022-04-26 2022-04-26 Job management method, apparatus, electronic device, and storage medium

Country Status (1)

Country Link
CN (1) CN115049200A (en)

Similar Documents

Publication Publication Date Title
US8793693B2 (en) Apparatus and method for predicting a processing time of a computer
US10401840B2 (en) Method and system for scheduling parallel processing machines based on hybrid shuffled frog leaping algorithm and variable neighborhood search algorithm
CN108776862B (en) Intelligent scheduling method supporting splitting of process task quantity
CN104765640B (en) A kind of intelligent Service dispatching method
US9218210B2 (en) Distributed processing system
CN115049201A (en) Job scheduling method and device, electronic equipment and storage medium
CN106775977A (en) Method for scheduling task, apparatus and system
Zribi et al. Minimizing the makespan for the MPM job-shop with availability constraints
CN111651864B (en) Event centralized emission type multi-heterogeneous time queue optimization simulation execution method and system
CN111105133B (en) Production scheduling method, computer device, and storage medium
CN112508398B (en) Dynamic production scheduling method and device based on deep reinforcement learning and electronic equipment
CN106897136A (en) A kind of method for scheduling task and device
CN111984426B (en) Task scheduling method and device, electronic equipment and storage medium
CN108509603B (en) A kind of adaptive dynamic dispatching method and system of data warehouse
CN115033357A (en) Micro-service workflow scheduling method and device based on dynamic resource selection strategy
US8281313B1 (en) Scheduling computer processing jobs that have stages and precedence constraints among the stages
CN112463334B (en) Training task queuing reason analysis method, system, equipment and medium
CN111930485B (en) Job scheduling method based on performance expression
CN115049200A (en) Job management method, apparatus, electronic device, and storage medium
CN110135685B (en) Method and device for distributing product design tasks
CN112181661A (en) Task scheduling method
CN111400010A (en) Task scheduling method and device
US20210374652A1 (en) Storage medium, job scheduling device, and job scheduling method
Hooshyar et al. A Genetic Algorithm to Time-Cost Trade off in project scheduling
CN115033374A (en) Task-to-thread matching method of multi-core programmable controller

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