CN118071003A - Method and system for sharing operation and maintenance service for Internet - Google Patents
Method and system for sharing operation and maintenance service for Internet Download PDFInfo
- Publication number
- CN118071003A CN118071003A CN202410024441.9A CN202410024441A CN118071003A CN 118071003 A CN118071003 A CN 118071003A CN 202410024441 A CN202410024441 A CN 202410024441A CN 118071003 A CN118071003 A CN 118071003A
- Authority
- CN
- China
- Prior art keywords
- store
- ijt
- spare part
- sharing
- spare
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 21
- 238000012423 maintenance Methods 0.000 title claims abstract description 20
- 238000004364 calculation method Methods 0.000 claims description 3
- 230000006870 function Effects 0.000 description 31
- 238000007726 management method Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 2
- 238000010168 coupling process Methods 0.000 description 2
- 238000005859 coupling reaction Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method for sharing operation and maintenance services towards the Internet, which is used for spare part sharing among multiple stores and comprises the following steps: acquiring the total quantity of stores and spare part information of each store, wherein the spare part information comprises the following components: total amount of spare parts, demand for a certain spare part per store, scheduling cost for scheduling the spare parts required for the current store from other stores, the scheduling cost comprising: distance between stores, scheduling time, and/or freight rate; calculating a dynamic sharing index of each spare part of each store, and calculating a total spare part sharing cost of each spare part of each store by combining the total store amount and the spare part information of each store; and selecting the store with the lowest total cost for sharing the spare parts as a spare part providing store of the spare parts required by the current store.
Description
Technical Field
The invention belongs to the technical field of spare part sharing, and particularly relates to a method and a system for sharing operation and maintenance services for the Internet.
Background
Spare part sharing among multiple stores is a common supply chain and inventory management strategy, especially in the retail, chain store or service industries. The goal of spare part sharing is to maximize inventory costs, improve efficiency, and ensure that the required spare parts are available when needed. The following are some common status quo and features of spare part sharing:
Centralized inventory management: multiple stores may track and manage spare part inventory through a centralized inventory management system. This can help ensure that each store can learn in real time about the inventory of spare parts in the overall system.
Real-time data synchronization: in order to achieve spare part sharing, inventory data for each store typically needs to be synchronized in real time. This may be accomplished through the use of advanced information technology systems, such as Enterprise Resource Planning (ERP) software or other inventory management systems.
Demand prediction and analysis: demand forecast is performed using data analysis and algorithms to better distribute spare parts among multiple stores. This helps to reduce excess inventory and ensure timely supply of high demand spare parts.
However, none of the prior art solutions is capable of performing accurate spare part sharing operations between multiple stores.
Disclosure of Invention
In order to solve the technical problems, the invention provides a method for sharing operation and maintenance services for Internet, which is used for sharing spare parts among multiple stores and comprises the following steps:
Acquiring the total quantity of stores and spare part information of each store, wherein the spare part information comprises the following components: total amount of spare parts, demand for a certain spare part per store, scheduling cost for scheduling the spare parts required for the current store from other stores, the scheduling cost comprising: distance between stores, scheduling time, and/or freight rate;
calculating a dynamic sharing index of each spare part of each store, and calculating a total spare part sharing cost of each spare part of each store by combining the total store amount and the spare part information of each store;
and selecting the store with the lowest total cost for sharing the spare parts as a spare part providing store of the spare parts required by the current store.
Further, calculating the total cost of spare part sharing includes:
Wherein TC is total cost of spare part sharing, N is total quantity of spare parts, M is total quantity of spare parts, D ijt (x) is required quantity x of j-th spare parts in the ith store at time t, C ijt (x) is scheduling cost of j-th spare parts of the ith store scheduling required quantity x from other stores at time t, and D' ijt (x) is dynamic sharing index of j-th spare parts of the ith store required quantity x at time t.
Further, the dynamic sharing index D' ijt (x) of the jth spare part of the ith store demand x at the time t includes:
D′ijt(x)＝f(t)·g(Dijt(x))·h(Iijt(x))
Where f (t) is a function of the dynamic sharing index over time, g (D ijt (x)) is a function of the dynamic sharing index over demand, h (I ijt (x)) is a function of the dynamic sharing index over inventory level, and I ijt (x) is the inventory quantity of the jth spare part of the ith store scheduling demand x from other stores at time t.
Further, the function f (t) of the dynamic sharing index over time includes:
f(t)＝ek·t
Where k is a time adjustment factor.
Further, the function g (D ijt (x)) of the dynamic sharing index according to the demand includes:
where c is a demand adjustment factor.
Further, the inventory quantity I ijt (x) of the j-th spare part of the I-th store dispatching the required quantity x from the other stores at the time t comprises:
h(Iijt)＝log(Iijt(x)+1)。
The invention also provides a system for sharing operation and maintenance service oriented to the Internet, which is used for sharing spare parts among multiple stores and comprises the following steps:
the system comprises an acquisition data module, a storage module and a storage module, wherein the acquisition data module is used for acquiring the total quantity of stores and spare part information of each store, and the spare part information comprises: total amount of spare parts, demand for a certain spare part per store, scheduling cost for scheduling the spare parts required for the current store from other stores, the scheduling cost comprising: distance between stores, scheduling time, and/or freight rate;
the calculation module is used for calculating the dynamic sharing index of each spare part of each store and calculating the total cost of spare part sharing of each spare part of each store by combining the total quantity of the stores and the spare part information of each store;
and the sharing module is used for selecting the store with the lowest total cost for sharing the spare parts as the spare part providing store of the spare parts required by the current store.
Further, calculating the total cost of spare part sharing includes:
Wherein TC is total cost of spare part sharing, N is total quantity of spare parts, M is total quantity of spare parts, D ijt (x) is required quantity x of j-th spare parts in the ith store at time t, C ijt (x) is scheduling cost of j-th spare parts of the ith store scheduling required quantity x from other stores at time t, and D' ijt (x) is dynamic sharing index of j-th spare parts of the ith store required quantity x at time t.
Further, the dynamic sharing index D' ijt (x) of the jth spare part of the ith store demand x at the time t includes:
D′ijt(t)×f(t)·g(Dijt(x))·h(Iijt(x))
Where f (t) is a function of the dynamic sharing index over time, g (D ijt (x)) is a function of the dynamic sharing index over demand, h (I ijt (x)) is a function of the dynamic sharing index over inventory level, and I ijt (x) is the inventory quantity of the jth spare part of the ith store scheduling demand x from other stores at time t.
Further, the function f (t) of the dynamic sharing index over time includes:
f (t) =e k·t, where k is a time adjustment factor.
Compared with the prior art, the technical scheme of the invention has the following beneficial effects:
The invention acquires the total quantity of stores and spare part information of each store, wherein the spare part information comprises the following components: total amount of spare parts, demand for a certain spare part per store, scheduling cost for scheduling the spare parts required for the current store from other stores, the scheduling cost comprising: distance between stores, scheduling time, and/or freight rate; calculating a dynamic sharing index of each spare part of each store, and calculating a total spare part sharing cost of each spare part of each store by combining the total store amount and the spare part information of each store; and selecting the store with the lowest total cost for sharing the spare parts as a spare part providing store of the spare parts required by the current store. According to the technical scheme, spare parts can be efficiently shared among a plurality of stores.
Drawings
FIG. 1 is a flow chart of the method of embodiment 1 of the present invention;
fig. 2 is a system configuration diagram of embodiment 2 of the present invention.
Detailed Description
In order to better understand the above technical solutions, the following detailed description will be given with reference to the accompanying drawings and specific embodiments.
The method provided by the invention can be implemented in a terminal environment, wherein the terminal can comprise one or more of the following components: processor, storage medium, and display screen. Wherein the storage medium has stored therein at least one instruction that is loaded and executed by the processor to implement the method described in the embodiments below.
The processor may include one or more processing cores. The processor connects various parts within the overall terminal using various interfaces and lines, performs various functions of the terminal and processes data by executing or executing instructions, programs, code sets, or instruction sets stored in the storage medium, and invoking data stored in the storage medium.
The storage medium may include a random access Memory (Random Access Memory, RAM) or a Read-Only Memory (ROM). The storage medium may be used to store instructions, programs, code sets, or instructions.
The display screen is used for displaying a user interface of each application program.
All subscripts in the formula of the invention are only used for distinguishing parameters and have no practical meaning.
In addition, it will be appreciated by those skilled in the art that the structure of the terminal described above is not limiting and that the terminal may include more or fewer components, or may combine certain components, or a different arrangement of components. For example, the terminal further includes components such as a radio frequency circuit, an input unit, a sensor, an audio circuit, a power supply, and the like, which are not described herein.
Example 1
As shown in fig. 1, an embodiment of the present invention provides a method for sharing operation and maintenance services on the internet, which is used for spare part sharing among multiple stores, and includes:
Step 101, acquiring total store quantity and spare part information of each store, wherein the spare part information comprises: total amount of spare parts, demand for a certain spare part per store, scheduling cost for scheduling the spare parts required for the current store from other stores, the scheduling cost comprising: distance between stores, scheduling time, and/or freight rate;
step 102, calculating a dynamic sharing index of each spare part of each store, and calculating the total cost of spare part sharing of each spare part of each store by combining the total quantity of the stores and the spare part information of each store;
specifically, calculating the total cost of spare part sharing includes:
Wherein TC is total cost of spare part sharing, N is total quantity of spare parts, M is total quantity of spare parts, D ijt (x) is required quantity x of j-th spare parts in the ith store at time t, C ijt (x) is scheduling cost of j-th spare parts of the ith store scheduling required quantity x from other stores at time t, and D' ijt (x) is dynamic sharing index of j-th spare parts of the ith store required quantity x at time t.
Specifically, the dynamic sharing index D' ijt (x) of the jth spare part of the ith store demand x at the time t includes:
D′ijt(x)＝f(t)·g(Dijt(x))·h(Iijt(x))
Where f (t) is a function of the dynamic sharing index over time, g (D ijt (x)) is a function of the dynamic sharing index over demand, h (I ijt (x)) is a function of the dynamic sharing index over inventory level, and I ijt (x) is the inventory quantity of the jth spare part of the ith store scheduling demand x from other stores at time t.
Specifically, the function f (t) of the dynamic sharing index over time includes:
f(t)＝ek·t
Where k is a time adjustment factor.
Specifically, the function g (D ijt (x)) of the dynamic sharing index according to the demand includes:
where c is a demand adjustment factor.
Specifically, the inventory quantity I ijt (x) of the jth spare part of the ith store dispatching the required quantity x from the other stores at the time t comprises:
h(Iijt)＝log(Iijt(x)+1)。
and step 103, selecting the store with the lowest total cost for sharing the spare parts as a spare part providing store of the spare parts required by the current store.
Example 2
As shown in fig. 2, the embodiment of the present invention further provides a system for sharing operation and maintenance services towards the internet, which is used for sharing spare parts among multiple stores, and includes:
the system comprises an acquisition data module, a storage module and a storage module, wherein the acquisition data module is used for acquiring the total quantity of stores and spare part information of each store, and the spare part information comprises: total amount of spare parts, demand for a certain spare part per store, scheduling cost for scheduling the spare parts required for the current store from other stores, the scheduling cost comprising: distance between stores, scheduling time, and/or freight rate;
the calculation module is used for calculating the dynamic sharing index of each spare part of each store and calculating the total cost of spare part sharing of each spare part of each store by combining the total quantity of the stores and the spare part information of each store;
specifically, calculating the total cost of spare part sharing includes:
Wherein TC is total cost of spare part sharing, N is total quantity of spare parts, M is total quantity of spare parts, D ijt (x) is required quantity x of j-th spare parts in the ith store at time t, C ijt (x) is scheduling cost of j-th spare parts of the ith store scheduling required quantity x from other stores at time t, and D' ijt (x) is dynamic sharing index of j-th spare parts of the ith store required quantity x at time t.
Specifically, the dynamic sharing index D' ijt (x) of the jth spare part of the ith store demand x at the time t includes:
D′ijt(x)＝f(t)·g(Dijt(x))·h(Iijt(x))
Where f (t) is a function of the dynamic sharing index over time, g (D ijt (x)) is a function of the dynamic sharing index over demand, h (I ijt (x)) is a function of the dynamic sharing index over inventory level, and I ijt (x) is the inventory quantity of the jth spare part of the ith store scheduling demand x from other stores at time t.
Specifically, the function f (t) of the dynamic sharing index over time includes:
f(t)＝ek·t
Where k is a time adjustment factor.
Specifically, the function g (D ijt (x)) of the dynamic sharing index according to the demand includes:
where c is a demand adjustment factor.
Specifically, the inventory quantity I ijt (x) of the jth spare part of the ith store dispatching the required quantity x from the other stores at the time t comprises:
h(Iijt)＝log(Iijt(x)+1)。
and the sharing module is used for selecting the store with the lowest total cost for sharing the spare parts as the spare part providing store of the spare parts required by the current store.
Example 3
The embodiment of the invention also provides a storage medium which stores a plurality of instructions for realizing the method for sharing operation and maintenance service oriented to the Internet.
Alternatively, in this embodiment, the storage medium may be located in any one of the computer terminals in the computer terminal group in the computer network, or in any one of the mobile terminals in the mobile terminal group.
Alternatively, in the present embodiment, the storage medium is configured to store program code for performing the steps of: step 101, acquiring total store quantity and spare part information of each store, wherein the spare part information comprises: total amount of spare parts, demand for a certain spare part per store, scheduling cost for scheduling the spare parts required for the current store from other stores, the scheduling cost comprising: distance between stores, scheduling time, and/or freight rate;
step 102, calculating a dynamic sharing index of each spare part of each store, and calculating the total cost of spare part sharing of each spare part of each store by combining the total quantity of the stores and the spare part information of each store;
specifically, calculating the total cost of spare part sharing includes:
Where TC is total cost of spare part sharing, N is total quantity of spare parts, M is total quantity of spare parts, D ijt (x) is required quantity x of j-th spare parts in the ith store at time t, c ijt (x) is scheduling cost of j-th spare parts of the ith store scheduling required quantity x from other stores at time t, and D' ijt (x) is dynamic sharing index of j-th spare parts of the ith store required quantity x at time t.
Specifically, the dynamic sharing index D' ijt (x) of the jth spare part of the ith store demand x at the time t includes:
D′ijt(x)＝f(t)·g(Dijt(x))·h(Iijt(x))
Where f (t) is a function of the dynamic sharing index over time, g (D ijt (x)) is a function of the dynamic sharing index over demand, h (I ijt (x)) is a function of the dynamic sharing index over inventory level, and I ijt (x) is the inventory quantity of the jth spare part of the ith store scheduling demand x from other stores at time t.
Specifically, the function f (t) of the dynamic sharing index over time includes:
f(t)＝ek·t
Where k is a time adjustment factor.
Specifically, the function g (D ijt (x)) of the dynamic sharing index according to the demand includes:
wherein C is a demand adjustment factor.
Specifically, the inventory quantity I ijt (x) of the jth spare part of the ith store dispatching the required quantity x from the other stores at the time t comprises:
h(Iijt)＝log(Iijt(x)+1)。
and step 103, selecting the store with the lowest total cost for sharing the spare parts as a spare part providing store of the spare parts required by the current store.
Example 4
The embodiment of the invention also provides electronic equipment, which comprises a processor and a storage medium connected with the processor, wherein the storage medium stores a plurality of instructions, and the instructions can be loaded and executed by the processor so that the processor can execute a method for sharing operation and maintenance services oriented to the Internet.
Specifically, the electronic device of the present embodiment may be a computer terminal, and the computer terminal may include: one or more processors, and a storage medium.
The storage medium may be used to store a software program and a module, such as a method for implementing an internet-oriented shared operation service in the embodiment of the present invention, and the processor executes various functional applications and data processing by running the software program and the module stored in the storage medium, that is, implements the method for implementing an internet-oriented shared operation service. The storage medium may include a high-speed random access storage medium, and may also include a non-volatile storage medium, such as one or more magnetic storage systems, flash memory, or other non-volatile solid-state storage medium. In some examples, the storage medium may further include a storage medium remotely located with respect to the processor, and the remote storage medium may be connected to the terminal through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The processor may invoke the information stored in the storage medium and the application program via the transmission system to perform the steps of: step 101, acquiring total store quantity and spare part information of each store, wherein the spare part information comprises: total amount of spare parts, demand for a certain spare part per store, scheduling cost for scheduling the spare parts required for the current store from other stores, the scheduling cost comprising: distance between stores, scheduling time, and/or freight rate;
step 102, calculating a dynamic sharing index of each spare part of each store, and calculating the total cost of spare part sharing of each spare part of each store by combining the total quantity of the stores and the spare part information of each store;
specifically, calculating the total cost of spare part sharing includes:
Where TC is total cost of spare part sharing, N is total quantity of spare parts, M is total quantity of spare parts, D ijt (x) is required quantity x of j-th spare parts in the ith store at time t, c ijt (x) is scheduling cost of j-th spare parts of the ith store scheduling required quantity x from other stores at time t, and D' ijt (x) is dynamic sharing index of j-th spare parts of the ith store required quantity x at time t.
Specifically, the dynamic sharing index D' ijt (x) of the jth spare part of the ith store demand x at the time t includes:
D′ijt(c)＝f(t)·g(Dijt(x))·h(Iijt(x))
Where f (t) is a function of the dynamic sharing index over time, g (D ijt (x)) is a function of the dynamic sharing index over demand, h (I ijt (x)) is a function of the dynamic sharing index over inventory level, and I ijt (x) is the inventory quantity of the jth spare part of the ith store scheduling demand x from other stores at time t.
Specifically, the function f (t) of the dynamic sharing index over time includes:
f(t)＝ek·t
Where k is a time adjustment factor.
Specifically, the function g (D ijt (x)) of the dynamic sharing index according to the demand includes:
where c is a demand adjustment factor.
Specifically, the inventory quantity I ijt (x) of the jth spare part of the ith store dispatching the required quantity x from the other stores at the time t comprises:
h(Iijt)＝log(Iijt(x)+1)。
and step 103, selecting the store with the lowest total cost for sharing the spare parts as a spare part providing store of the spare parts required by the current store.
The foregoing embodiment numbers of the present invention are merely for the purpose of description, and do not represent the advantages or disadvantages of the embodiments.
In the foregoing embodiments of the present invention, the descriptions of the embodiments are emphasized, and for a portion of this disclosure that is not described in detail in this embodiment, reference is made to the related descriptions of other embodiments.
In the embodiments provided in the present invention, it should be understood that the disclosed technology may be implemented in other manners. The system embodiments described above are merely exemplary, and for example, the division of the units is merely a logic function division, and there may be another division manner in actual implementation, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some interfaces, units or modules, or may be in electrical or other forms.
The units described as separate units may or may not be physically separate, and units shown 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 units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied essentially or partly in the form of a software product or all or part of the technical solution, which is stored in a storage medium, and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform 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 Read-Only Memory (ROM), a random-access Memory (RAM, random Access Memory), a removable hard disk, a magnetic disk, or an optical disk, etc., which can store program codes.
It is apparent that the above examples are given by way of illustration only and are not limiting of the embodiments. Other variations or modifications of the above teachings will be apparent to those of ordinary skill in the art. It is not necessary here nor is it exhaustive of all embodiments. While still being apparent from variations or modifications that may be made by those skilled in the art are within the scope of the invention.
Claims (10)
1. A method for sharing operation and maintenance services towards the internet, which is used for spare part sharing among multiple stores, and is characterized by comprising the following steps:
Acquiring the total quantity of stores and spare part information of each store, wherein the spare part information comprises the following components: total amount of spare parts, demand for a certain spare part per store, scheduling cost for scheduling the spare parts required for the current store from other stores, the scheduling cost comprising: distance between stores, scheduling time, and/or freight rate;
calculating a dynamic sharing index of each spare part of each store, and calculating a total spare part sharing cost of each spare part of each store by combining the total store amount and the spare part information of each store;
and selecting the store with the lowest total cost for sharing the spare parts as a spare part providing store of the spare parts required by the current store.
2. The method for sharing an operation and maintenance service over the internet as claimed in claim 1, wherein calculating the total cost of sharing spare parts comprises:
Wherein TC is total cost of spare part sharing, N is total quantity of spare parts, M is total quantity of spare parts, D ijt (x) is required quantity x of j-th spare parts in the ith store at time t, C ijt (x) is scheduling cost of j-th spare parts of the ith store scheduling required quantity x from other stores at time t, and D' ijt (x) is dynamic sharing index of j-th spare parts of the ith store required quantity x at time t.
3. The method for sharing an operation and maintenance service over the internet according to claim 2, wherein the dynamic sharing index D' ijt (x) of the j-th spare part of the i-th store demand x at the time t comprises:
D′ijt(x)＝f(t)·g(Dijt(x))·h(Iijt(x))
Where f (t) is a function of the dynamic sharing index over time, g (D ijt (x)) is a function of the dynamic sharing index over demand, h (I ijt (x)) is a function of the dynamic sharing index over inventory level, and I ijt (x) is the inventory quantity of the jth spare part of the ith store scheduling demand x from other stores at time t.
4. A method for sharing an operation and maintenance service over the internet as claimed in claim 3, wherein the function f (t) of the dynamic sharing index over time comprises:
f(t)＝ek·t
Where k is a time adjustment factor.
5. The method for sharing an operation and maintenance service over the internet according to claim 1, wherein the function g (D ijt (x)) of the dynamic sharing index according to the demand includes:
where c is a demand adjustment factor.
6. The method for sharing an operation and maintenance service over the internet according to claim 1, wherein the step of scheduling the inventory quantity I ijt (x) of the j-th spare part of the x required quantity from the other stores at the time t comprises:
h(Iijt)＝log(Iijt(x)+1)。
7. A system for internet-oriented sharing of operation and maintenance services for spare part sharing between multiple stores, comprising:
the system comprises an acquisition data module, a storage module and a storage module, wherein the acquisition data module is used for acquiring the total quantity of stores and spare part information of each store, and the spare part information comprises: total amount of spare parts, demand for a certain spare part per store, scheduling cost for scheduling the spare parts required for the current store from other stores, the scheduling cost comprising: distance between stores, scheduling time, and/or freight rate;
the calculation module is used for calculating the dynamic sharing index of each spare part of each store and calculating the total cost of spare part sharing of each spare part of each store by combining the total quantity of the stores and the spare part information of each store;
and the sharing module is used for selecting the store with the lowest total cost for sharing the spare parts as the spare part providing store of the spare parts required by the current store.
8. The internet-oriented shared operations and maintenance service system of claim 7, wherein calculating the total cost of spare part sharing comprises:
Wherein TC is total cost of spare part sharing, N is total quantity of spare parts, M is total quantity of spare parts, D ijt (x) is required quantity x of j-th spare parts in the ith store at time t, C ijt (x) is scheduling cost of j-th spare parts of the ith store scheduling required quantity x from other stores at time t, and D' ijt (x) is dynamic sharing index of j-th spare parts of the ith store required quantity x at time t.
9. The internet-oriented shared operation and maintenance service system according to claim 8, wherein the dynamic sharing index D' ijt (x) of the j-th spare part of the i-th store demand x at time t comprises:
D′ijt(x)＝f(t)·g(Dijt(x))·h(Iijt(x))
Where f (t) is a function of the dynamic sharing index over time, g (D ijt (x)) is a function of the dynamic sharing index over demand, h (I ijt (x)) is a function of the dynamic sharing index over inventory level, and I ijt (x) is the inventory quantity of the jth spare part of the ith store scheduling demand x from other stores at time t.
10. The internet-oriented shared operation and maintenance service system according to claim 9, wherein the dynamic sharing index change function f (t) with time comprises:
f(t)＝ek·t
Where k is a time adjustment factor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410024441.9A CN118071003A (en) | 2024-01-05 | 2024-01-05 | Method and system for sharing operation and maintenance service for Internet |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410024441.9A CN118071003A (en) | 2024-01-05 | 2024-01-05 | Method and system for sharing operation and maintenance service for Internet |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN118071003A true CN118071003A (en) | 2024-05-24 |
Family
ID=91109907
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410024441.9A Pending CN118071003A (en) | 2024-01-05 | 2024-01-05 | Method and system for sharing operation and maintenance service for Internet |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118071003A (en) |
-
2024
- 2024-01-05 CN CN202410024441.9A patent/CN118071003A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109451072A (en) | A kind of message caching system and method based on Kafka | |
| CN108540568B (en) | Computing capacity sharing method and intelligent equipment | |
| CN104243405A (en) | Request processing method, device and system | |
| CN107909486A (en) | Commission management method, application server and computer-readable recording medium | |
| CN109376011A (en) | The method and apparatus of resource are managed in virtualization system | |
| CN110968366A (en) | Task unloading method, device and equipment based on limited MEC resources | |
| CN109857524A (en) | Streaming computing method, apparatus, equipment and computer readable storage medium | |
| CN108881651A (en) | Data processing method, device and equipment of call platform and storage medium | |
| CN105335313A (en) | Basic data transmission method and apparatus | |
| CN102542368B (en) | Cache system access method and device | |
| CN106856441A (en) | VIM systems of selection and device in NFVO | |
| CN116402318B (en) | Multi-stage computing power resource distribution method and device for power distribution network and network architecture | |
| CN111275557A (en) | Method and device for controlling risk of resource management | |
| CN118071003A (en) | Method and system for sharing operation and maintenance service for Internet | |
| CN110443441A (en) | Regular efficacy monitoring method, apparatus, computer equipment and storage medium | |
| CN115936365A (en) | Regional power spot market clearing method and device for optimizing power of multi-terminal direct current tie line | |
| CN115543582A (en) | Method, system and equipment for unified scheduling of super computing power network | |
| CN104735149A (en) | Cloud computing resource management system and method | |
| CN114612212A (en) | Business processing method, device and system based on risk control | |
| CN117057538B (en) | Store maintenance personnel scheduling method and system based on model | |
| CN117057704B (en) | Method and system for rapidly scheduling multiple spare parts under complex working conditions | |
| CN117056588B (en) | Intelligent recommending method and system for maintenance store of automobile manufacturing equipment | |
| CN111400598A (en) | Information push method, server, multi-port repeater and storage medium | |
| CN117953634A (en) | Method and system for sharing equipment instrument by Internet | |
| CN117474734B (en) | Existing line transformation and urban line network line and station multi-element fusion method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |