A method and device for guaranteeing task scheduling
A task scheduling and location information technology, applied in multi-program devices, instruments, data processing applications, etc., can solve the problems of low degree of automation, complex decision-making process, long time consumption, etc., to achieve optimal benefits, improve effectiveness and efficiency. Accuracy, the effect of reducing work intensity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0078] Embodiment 1, the situation where the support team is equal to the support object
[0079] Assuming that there are n guaranteed objects and n guaranteed teams to complete them, each guaranteed team can only complete one guaranteed object, and each guaranteed object can only be completed by one guaranteed team, which is called a balanced task scheduling problem. Establish a mathematical model of balanced task scheduling and introduce a 0-1 variable x ij ,make
[0080]
[0081] let c ij (i,j=1,2,...,n) represents the cost of assigning the i-th support team to complete the j-th support object, then the mathematical model of the balanced task scheduling problem is:
[0082]
[0083]
[0084] Among them, S is the total cost of completing the support task, k is the number of support teams, n is the number of support objects; c ij The cost of guaranteeing the j-th guarantee object for the i-th support team, where 1≤i≤k, 1≤j≤n; x ij is a decision variable, where 1≤...
Embodiment 2
[0106] Embodiment 2, the situation where the support team is larger than the support object
[0107] Assume that there are n guarantee objects, k guarantee teams to complete them, and there are k-n guarantee objects b n+1 ,b n+2 ,...,b k , and set the cost value of all support teams to the support object as:
[0108]
[0109]
[0110] Transformed into a balanced task scheduling problem:
[0111]
[0112] Then the problem is transformed into: there are k guarantee objects, k guarantee teams to complete, each guarantee team can only complete one guarantee object, and each guarantee object can only be completed by one guarantee team, which is transformed into balanced task scheduling problem, the model is:
[0113]
[0114]
[0115] Among them, S is the total cost of completing the support task, k is the number of support teams, n is the number of support objects; c ij The cost of guaranteeing the j-th guarantee object for the i-th support team, where 1≤i≤k, 1≤j...
Embodiment 3
[0138] Embodiment 3, the situation where the support team is smaller than the support object
[0139] Option One
[0140] Assume that there are n items of guarantee objects, k guarantee teams to complete them, and there are n-k guarantee teams p k+1 ,p k+2 ,...,p n , and set the cost value of all support teams to the support object as:
[0141]
[0142]
[0143] Transformed into a balanced task scheduling problem:
[0144]
[0145] Then the problem is transformed into: there are n guarantee objects, and n guarantee teams can complete them. Each guarantee team can only complete one guarantee object, and each guarantee object can only be completed by one guarantee team, which is transformed into balanced task scheduling problem, the model is:
[0146]
[0147]
[0148] Among them, S is the total cost of completing the support task, k is the number of support teams, n is the number of support objects; c ij The cost of guaranteeing the j-th guarantee object fo...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com