Scheduling scheme repairing method for resource interruption problem and storage medium

Abstract

The invention relates to a scheduling scheme repairing method for a resource interruption problem and a storage medium, and the method comprises the steps: obtaining a resource interruption interval [tks, tkf] and a scheduling scheme to obtain a set A, elements in the A are jobs directly influenced by resource interruption, and the start time of the jobs, the start time of which is earlier than the start time of the tks, in the set A is updated to tks; calculating the usage amount of the resource k at each moment in the resource interruption interval, positioning the moment when the usage amount exceeds a preset resource upper limit, obtaining a job set at the moment, sorting the jobs in the job set according to a preset rule, and moving the first job and the subsequent jobs backwards for a fixed length. Compared with the prior art, the resource usage amount of each moment in the resource interruption interval is calculated, the job is selected to move backwards after the resource usage amount exceeds the preset upper limit, the number of jobs participating in rescheduling is reduced as much as possible, and therefore the job starting time change cost is reduced.

Description

technical field [0001] The invention relates to the technical field of scheduling scheme optimization, in particular to a scheduling scheme repair method and a storage medium facing the problem of resource interruption. Background technique [0002] RIP is derived from the classic project scheduling problem, where the goal of the problem is to find the minimum value of resource input given a given duration. The description of the resource input problem (RIP) considering dynamic resource interruption is as follows: the project consists of several jobs, and there is a certain time sequence relationship between the jobs. Interrupt, release the resources occupied by it, and continue execution at a later time. Given that the project duration is T, the project contains n jobs, and all jobs need to use K different updatable resources, these resources can be reused, the resource set R={1, 2,...,K}, k∈R is Resource number, the job set is J={1, 2, ..., n}, where 1 and n are virtual ...

AI Technical Summary

Problems solved by technology

The algorithm has high efficiency and the rules are very simple and easy to understand. However, for projects with a tight total construction period and a high delay time penalty coefficient, the solution cost generated by this algorithm is often too high, and it is not feasible in actual operation.

Images