JP2003521025A - Method and apparatus for managing short-lived indistinguishable goods based on real-time futures prices - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a planning method to clarify the economy of consumption, production and transportation of goods having a short life and indistinguishable, and to provide a method of consumption, production and transportation of such goods having a short life and indistinguishable. Identify temporal changes in the economy. A particular embodiment comprises a device that consumes short-lived indistinguishable goods based on a knowledge interval set that includes at least one knowledge interval of short-lived indistinguishable goods at time intervals, including cost. And a method and apparatus for planning. The method includes determining the need for a short-lived indistinguishable product over a time interval (2004) and the need for a short-lived indistinguishable product over a time interval to create a device operation schedule. Exploring the knowledge interval set based on the (2008). Further embodiments include methods and apparatus for planning and operating the device.

Description

Detailed Description of the Invention

[0001]

TECHNICAL FIELD OF THE INVENTION

The present invention relates to planning and managing the operation of each device using short-lived indistinguishable products with respect to in-transit and transacted electrical output applied to one or more grids of AC power networks.

[0002]

[Prior art]

In the present specification, an indistinguishable product refers to a product in which the product is strictly traded by the quantity. A single unit of an indistinguishable item is indistinguishable from other units of that item. One kilowatt-hour 60Hz AC power delivered by a power line is indistinguishable from another one kilowatt-hour delivered simultaneously on the same line to the same location. A product that has a short life and cannot be distinguished is a product whose existence is very short and that cannot be distinguished. Power generation, network bandwidth, airplane seats and freeway entrance fees during rush hours are all examples of indistinguishable products that only exist for a short period of time. In contrast, start-up lots on an assembly line are examples of products that are short-lived and distinguishable, as they produce tangible results that vary widely in content.

Many devices use one or more short-lived indistinguishable items during their operation. Some devices can produce one or more short-lived indistinguishable items during their operation. Examples of these include hydroelectric dams, video content serving servers, airports that prepare planes for departure (hence providing seats for such planes), and highway entrance ramps. Some devices consume one or more short-lived indistinguishable items during their operation. These include home appliances, most factories, video content subscribers,
Includes air travelers and drivers attempting to enter the highway through highway entrance ramps. During their operation, some devices carry one or more short-lived indistinguishable items. Examples of these include power lines, communication networks, airplane transfer points connecting various airways, and highway interchanges. Some devices produce one type of short-lived indistinguishable product while consuming another type of short-lived indistinguishable product. Examples include DC to AC power converters and network bridges, routers, gateways, and firewall servers.

In all the examples mentioned above, consumption of such short-lived indistinguishable goods,
There is a need to provide a method of planning that reveals the economy of production and transportation. Furthermore, it is necessary to be able to account for the temporal changes in the economy of consumption, production and transportation of such short-lived indistinguishable goods. Further, there is a need to control such devices based on the results of such planning. In addition, there is a need to measure the usage and cost of such devices based on the time-varying economy of consumption, production, and transportation of such short-lived indistinguishable goods. Furthermore,
Based on the temporal changes in this economy, it is necessary to measure the usage and cost of such devices in operation.

Since the invention of AC power technology, the United States and many other countries have benefited from the ability to share AC power over significant distances. This AC power technology has proven enormous in value. However, the management and control of the AC power grid is
Have a basic problem. Before addressing this management and control issue, it is important to consider some of the basic physical characteristics of power distribution.

An AC power grid is an AC generator and an AC power load on a power line that are controlled so that the entire network functions as an essentially constant frequency and uniform phase function. Is a wire network that connects The phase shift is compensated by the phase shifter to provide a uniform phase characteristic across the AC power grid. The frequency shift is compensated by the generator. Changes in frequency are generally caused by variations between the load and the power generated. This compensation has the effect of providing an operationally essentially constant frequency and uniform phase through the AC grid. The distribution frequency of AC power in the United States, Canada, Mexico, and several other countries is 60 Hz, while in other countries it is 50
Hz. Depending on the situation, power may be distributed using a two-phase transmission method. In other particular cases, the electricity is distributed in a three-phase transmission system.

The grid used in the present invention refers to a power system having two or more AC power networks and DC power lines capable of transferring energy between nodes of different AC power networks or between nodes of a single AC power network.

Cities, generators, etc. act as nodes of the AC power grid. A particular node may actually have more than two generators or loads. The bus locally connects this local installation of nodes. High voltage AC transmission lines transfer power between cities and generators at the main load centers of the AC grid. As an example, in the United States there is an AC grid that goes down from British Columbia, Canada, to Northern Mexico and across the Rocky Mountains, including the so-called Western Procurement Council. Texas has another AC grid that essentially includes the rest of the United States and Canada, with the exception of parts of Quebec. Together, these three AC grids are connected by DC power lines to form the North American grid. These are not connected by alternating current. These are asynchronous. That is, they are not synchronized in frequency or phase throughout the United States, Canada, and Northern Mexico.

It is easy to see that power generation is short-lived and indistinguishable. A kilowatt, like any other, is treated rationally and lasts only a relatively short time. It turns out that power transmission is also short-lived and indistinguishable. Transmission of electric power is usually performed by AC transmission lines between nodes of the AC power grid. In addition, DC power lines are used to connect specific nodes, either nodes of a single AC power grid or separate AC power grids.

The duration of power storage is generally limited. Commonly used storage systems pump water to a hilltop storage site and store it until needed. When needed, it is fed by gravity to one or more turbines to generate electricity. For economic reasons such systems are not used to store electricity for very long periods, often only for a day or two. It should be noted that the power interface points to such systems are short-lived and indistinguishable.

Power switching is usually not done between power lines that necessarily include high power (megawatts or more). Current examples of AC power switching include switching between amplifiers and antenna feeds in broadcast wireless systems, but typically only a fraction of a megawatt. However, once such system components become capable of handling high power lines, the power flowing through the interfaces of such switches to the grid is still short-lived and indistinguishable.

AC power distribution systems are distinguished from other flow-based systems such as DC power, gas, water and oil transmission systems by some basic physical characteristics. AC power grids differ from gas, water, oil, and other fluid flow distribution systems in that power generation and load changes propagate across such networks at approximately the speed of light. The effects of power generation and load occur practically simultaneously across the AC grid.

Due to the frequency and phase stability across the AC grid, the change in power is
Has the effect of superposition. This ensures that the power carried on any power line of the network is essentially a linear function of the generators and loads on the network. Furthermore, when the path of the power line is connected to two nodes, the power of the first node carried by the path depends on the power generated at the second node, as related to the above linear function. Offset.

Since these AC grids operate in the safe range, the flow patterns can be predicted to a considerable extent if the configuration of the network is unchanged. The National Electrical Reliability Council calculates a set of systems of transfer distribution coefficients available on the Northern American Reliability Council website www.nerc.com and how power is distributed across various power lines. Is showing. This is the transfer direction is node 1
-It is a linear function of the input quantity that changes the sign when changing from node 2 to node 2-node 1. Such a function is skew-symmetric with respect to the node.

In the case of a DC network, the supply of power from one point to another can be controlled directly. This cannot be done on the AC grid. It is a characteristic of the AC power grid that all power lines are affected by the above-mentioned transfer distribution coefficient and the power generation and load at a specific node at a fixed rate.

As an example, when AC power is sent from San Francisco Bonneville Electric Power Company to San Francisco, some of it goes through direct routes, some goes to Arizona via Idaho, and backflows from Southern California to Northern California. To do. There is a problem with the flow from Southern California to Northern California, which limits what can be transported from Bonneville Electric Power Corporation to San Francisco.

In the case of an AC power network, it can be seen that the number of times the power is input on any of the networks and taken off by the load anywhere on the network is unlimited. However, after all, the capacity of this network is limited. This constrained flow element is a major problem for the power industry, as certain power lines or collections of power lines in a network are consumed before others. Generally, this power line can be limited by its associated power line load capacity or transformer capacity limit. It should be noted that multiple transformers may be involved, and different transformers may have different transformer capacity limits. These restricted flow elements are called flow gates. Over the last few years, the importance of FlowGate has begun to grow through NERC's actions responsible for building a model to estimate the impact of FlowGate that can be downloaded from the website.

In the present invention, a flow gate of a specific AC power network means an assembly of at least one power line, and the total maximum safe load capacity thereof acts as a congestion factor of the network and is three or more of this network. AC power supply between the nodes is restricted.

All power lines have a maximum safe load capacity and can therefore be considered as a kind of flow gate. However, historical congestion analysis of a particular AC grid has shown that only a few flow gates cause almost all congestion problems. Such a flow gate is called an effective flow gate in the present invention.

The transfer of relevant AC power across a particular flow gate is additive due to the effects of superposition described above. Therefore, when sending 100 megawatts along the path, the transmission may impact the flowgate by 10% and add 10 megawatts to the flowgate. The second generator may give the flowgate a shock of 5%. Generating 100 MW with the second generator would add 5 to the flow gate.

FIG. 1 shows a typical AC power grid based on AC power technology of the time as found in the prior art. This network is 10, 20, 30, 40, 50, 60, 70,
It contains 12 nodes designated 80, 90, 100, 110, 120.

The AC power transmission line 12 connects between the node 10 and the node 20. Transmission line 14 is node 10
And the node 40 are connected. The power transmission line 22 connects between the node 20 and the node 30.
The power transmission line 32 connects between the node 30 and the node 40. The power transmission line 42 connects between the node 40 and the node 120. The power transmission line 44 connects between the node 40 and the node 60. The power transmission line 46 connects between the node 40 and the node 50. Transmission line 52 is connected to nodes 50 and 11
Connect between 0s. The power transmission line 54 connects between the node 50 and the node 60. Power line 56
Connects between the node 50 and the node 70. The power transmission line 62 connects between the node 60 and the node 110. The power transmission line 64 connects between the node 60 and the node 70. The transmission line 82 is
The node 80 and the node 120 are connected. The power transmission line 92 connects between the node 90 and the node 120. The power transmission line 94 connects between the node 90 and the node 110. The power transmission line 96 connects between the node 90 and the node 100. The power transmission line 102 connects between the node 100 and the node 110. The power transmission line 112 connects between the node 110 and the node 120.

Flowgate A 210 is a constraint on the network. In that these transmission lines have a transmission capacity limit that is easily overloaded if this maximum safe load capacity is exceeded, the transmission lines 32, 34, 42 will have flow gate A210 depending on the total maximum safe load capacity.
Constrained by.

The flow gate B220 is a constraint on the network. The transmission lines 42 and 44 are restricted by the flow gate B220. This transmission line is also constrained by the total maximum safe load capacity, due to system limitations such as proximity at some critical connection points of systems such as mountain pass.

The flow gate C230 is a constraint on the network. Transmission lines 52, 62 are constrained by flow gate C230 to a total maximum safe load capacity.

FIG. 2 shows a table of associated AC power functions for each flow gate of a collection of flow gates for each bus of various nodes of the exemplary AC power network of FIG. 1 disclosed in the prior art.

The bus 1 locally connects all the equipment of the node 10. Bus 2 locally connects all the equipment of node 20. The bus 3 locally connects all the equipment of the node 30. The bus 4 locally connects all the equipment of the node 40.
The bus 5 locally connects all the equipment of the node 50. The bus 6 locally connects all the equipment of the node 60.

The bus 7 locally connects all the equipment of the node 70. The bus 8 locally connects all the equipment of the node 80. The bus 9 locally connects all the equipment of the node 90. The bus 10 locally connects all the equipment of the node 100.
The bus 11 locally connects all the equipment of the node 110. The bus 12 locally connects all the equipment of the node 120.

Although the equipment of these nodes is connected by a corresponding bus, the power generation capacity and the load capacity often change greatly. As an example, cities often consume far more AC power than they generate. As another example, the nodes of a main hydroelectric dam, such as the Grand Coolie Dam, tend to generate much more AC power than they consume.

Since the maximum amount of electric power that can be transferred is the amount of electric power at the power generation node, the related AC power functions of various buses are all decimals of 1. Moreover, some of this AC power function is negative. Bus 10 is exactly zero in its power function.
It essentially acts as a reference node for calculating the relevant function.

Next, consider the historical market of electricity and power transmission. It is noteworthy that electricity has long been an exception to commodity market targets for a variety of historical and technical reasons. Despite deregulation of the power industry, the eligibility to be a buyer and a seller to negotiate and execute transactions remains severely limited. The previous discussion of this limitation concerns reliability.

In the United States, the Federal Energy Regulatory Commission (FERC) called for the development of Regional Transmission Organizations (RTOs) to more beneficially adjust the market and promote reliability (Docket).
No. RM99-2-00 issued May 13, 1999).

The power industry has a long history of managing power generation using centralized shipping methods for goods in opposition to market opening. The centralized power transmission method was suitable for an industry consisting of monopolies that were integrated above and below. The traditional approach to the RTO initiative so far has been to maintain central control as much as possible while opening up access to competitive wholesalers and retailers. As a result, prices have fluctuated, liquidation has been discussed, and it has become difficult to reconcile demand and supply on a simultaneous basis. The basic problem is that the centralized shipping method does not work if the parties do not have a common ownership or purpose.

[0034] RTOs have certain essential technical functions, with a total focus on reliability, regional security cooperation, and emergency operator intervention. RTOs have problems in the areas of scheduling, congestion management, ancillary servicing, metering, billing, and clearing. As used herein, ancillary services often relate to power generation. The power plant will reserve some of its capacity to be provided in real time according to the operator's demand, and will support the balance of the network to handle urgent requirements that can be quickly addressed by the secured capacity. It should be noted that all of these issues relate to the short-lived indistinguishable appliances or the economic consequences of a process necessarily involving short-lived indistinguishable appliances.

Consider how AC power transfer is managed today. Transmission rights are considered and negotiated for transfer between two points in the network known as the contract path. Such an idea is contrary to the above-mentioned physical features of these AC grids. This is because power generation or load changes at any node essentially have a primary effect on all transmission lines of the network and, to some extent, strongly influence all flow gates in the network.

This contract route system for planning power transmission reserves the right to transmit a specific direct route through the AC grid. This is done by purchasing transmission rights from each of the transmission line owners of the respective power lines that make up this direct path. Certain constraints that occur in the effective flow gates away from this direct path often actually limit the transmission capacity of that direct path.

This contract routing system offers the possibility of directing AC power to follow the route through the network that would have been chosen for natural gas. By switching the valve, it is possible to virtually direct the AC power to a specific route through the AC power network. This contract route system was proposed because it was considered to be conceptually easier as it only required to reserve a single route. The basic problem with the contract path approach is that the contract path placement for transmission does not actually match the path of the electricity flowing into the AC grid.

Today's contract channels are based on a first come, first served plan. As a result, resale capability is very limited. As an example, consider three nodes A, B, C of an AC power grid. Suppose a party buys a transmission right from A to B and a transmission right from B to C. Using the contract path approach, this does not mean that you own the transmission right from A to C, because the contract path is not additive. Even if they have the right to transmit from A to B and B to C, they do not have the right to transmit from A to C. In order to transport from A to C, individual power transmission rights from A to C must be purchased. This is because there are certain unsatisfied flowgate constraints in the two separate paths that will be triggered in the combined path. Therefore, in the traditional contract-based market, even if the power transmission right from A to B is purchased, its value is
It only transfers energy to.

[0039] Today, there are some special approaches to restricting the flow of one path because it affects another path. These approaches ignore the physical features of the AC grid. This leads to situations where some routes are actually constrained, when a particular route is overly constrained, a cut is issued across the contract route that is clearly inappropriate to compensate. . The central operator has been forced to spill the flowgate and forbid the transmission of power across the path, which is clearly inappropriate to compensate.
Function.

Another alternative approach is to incorporate all of the generator cost and buyer priorities into the mathematical optimization plan to calculate the optimal flow. This alternative approach has significant disadvantages. In the commercial market, it is quite difficult to show people all costs. Most people are reluctant to do this. Moreover, such costs change frequently. The load must specify priorities between consumers and non-consumers, which is a tremendous information burden.
They are or are unlikely to do this. First of all, it seems unlikely. Even if you do that, all of this information is tremendously burdensome to the central operator who collects it.

In the case of such an alternative approach, when people consume power and turn the distribution device on and off, there is a need for two-way communication between the controlling device and all parties involved in the system. Become. Providing the necessary level of reliable communication and a direct control system has proved impossible. Moreover, people do not like to let the central operator manage their business life.

Another approach in the industry is a power interchange scheme called PJM that developed a system called Local Pricing for Pennsylvania, New Jersey and Maryland. This is a centralized power distribution method. However, the local flow model is buried in it. It supports central management of some of the generators, associated equipment and equipment to obtain a consistent solution based on the power distribution matrix.

This approach suffers from at least the same problems faced by other central management plans. The amount of detail information such systems acquire or use to optimize AC power transfer is very limited. Power users are again blind to options. Stakeholders can't decide what works best. The central operator gives instructions to the parties concerned. It is difficult to imagine that this situation is optimal.

In addition, another major inconvenience in this approach is
The point is that I don't know the price. If a entrant wishes to hedge these prices, it will have to rely on a separate financial instrument to “fix” the profit or loss before trading. Trading of these financial securities does not provide feedback to the actual LMP solution solution, and critical futures market information that may contribute to market efficiency and corner stability is lost.

NERC has developed, to some extent, a way to address flow gates. It was distributed in November 1998 by the NERC Trading Booking and Schedule Self-Decision Working Team, “Di
scussion Paper on Aligning Transmission Reservations and Energy Schedule
s to Actual Flows ”. The team proposed moving to a system that reserves and plans transmissions based on actual use of congestion flow gates, which the power industry calls the FLOWBAT method. The proposal has a serious problem that it does not address the issue of allocating flowgate capacity when demand exceeds supply.By not mentioning this issue, they are currently on a first-come, first-served basis. The drawbacks mentioned above for centralized planning also pertain to this approach.

NERC has also endorsed the General Agreement on Parallel Path Attempts (GAPP). GAPP
A system in which one power transmission supplier compensates a second power transmission supplier for parallel power flows in the system of the second power transmission supplier caused by transactions approved by the first power transmission supplier. . GAPP is in this case based on a distribution function called trading party functions (TPFs). These distribution functions relate to power transmission paths rather than flow gates. GAPP will attempt to procure compensation paid by transmission users for the actual electricity flow. However, GAPP is strictly an ex-post settlement system. This modifies the current contract path plan only to redistribute the revenue. It makes no attempt to allocate insufficient transmission capacity.

In summary, in at least all of the examples mentioned above, there is a need to provide a method of planning that reveals the economy of consumption, production and transportation of such short-lived and indistinguishable goods. Furthermore, it is necessary to be able to account for the temporal changes in the economy of consumption, production and transportation of such short-lived indistinguishable goods. Furthermore,
It is necessary to control these devices based on the results of such planning. Furthermore, there is a need to measure the usage and cost of such devices in operation, based on the temporal changes in this economy. What is further needed is a mechanism for trading electrically short-lived, indistinguishable products that optimizes electrical grid scheduling, congestion management, supplementary services, measurements, and account billing and settlement. . Furthermore, what is needed is an AC power transmission market system that is compatible with the physical processes of AC power networks. Further, transmission rights are primarily constrained by the critical flow gates, so what is needed is to account for the impact at the critical flow gates on each contract transmission. Method and mechanism for planning the operation of the device and further controlling the device based on trading power generation and transmission rights in a timely, reliable and efficient way to automatically guarantee the correct operation of the power grid is necessary.

[0048]

[Means for Solving the Problems]

Particular embodiments meet at least the requirements and requirements discussed in the prior art.

Certain embodiments provide a device that consumes short-lived indistinguishable goods based on a knowledge interval set that includes at least one knowledge interval of short-lived indistinguishable goods at time intervals, including cost. Including how to plan. This method determines the need for a short life indistinguishable product over the planning time interval, and a need for a short life indistinguishable product over the planning time interval to create a device operation schedule. Based on the knowledge interval set.

Such a method advantageously incorporates futures market prices for short-lived indistinguishable products represented by knowledge intervals to create device operation schedules.

Certain further embodiments include, in the knowledge interval set, creating a first knowledge interval for a short-lived indistinguishable product at a first time interval that includes a first cost. Such an embodiment advantageously supports the creation of new knowledge of futures market prices within a knowledge interval set.

Certain further embodiments create a first knowledge interval by receiving and creating the first knowledge interval based on the create knowledge interval message to create the first knowledge interval. Support the steps to be taken. Such embodiments advantageously support sending messages to deliver futures market price information.

Certain further embodiments support processing the received knowledge creation message to create a first knowledge interval and inserting the first knowledge interval into a knowledge interval set. . Such embodiments advantageously support at least one, if not all, of the set including encryption, error detection and correction coding, and authentication analysis during processing of received knowledge interval creation messages.

Certain embodiments support exchanging, modifying, and removing a second knowledge interval prior to a set of knowledge intervals based on the time intervals of the first and second knowledge intervals. Such an embodiment advantageously supports modification of the time interval stored in the knowledge interval of the knowledge interval set.

Certain embodiments support knowledge intervals that include a set of time intervals that includes at least one time interval. Certain further embodiments include
Supports knowledge intervals that include a set of time intervals for one time interval. Certain other further embodiments support a set of time intervals that includes at least two time intervals. Such an embodiment advantageously supports off-peak knowledge intervals and provides a notation for updating a set of knowledge intervals that includes a second knowledge interval with a first knowledge interval that includes overlapping time intervals. To do.

Certain embodiments support removing knowledge intervals from a set of knowledge intervals. Such an embodiment advantageously supports maintaining a knowledge interval set within predefined size constraints. Certain further embodiments support removal of knowledge intervals based on received and processed knowledge interval removal messages, and advantageously support the issuing of knowledge interval removals from external sources. Certain other additional embodiments include real-time construction and
It supports the removal of knowledge intervals that precede in real time, and advantageously supports the localized removal of knowledge intervals. For certain embodiments, the time interval precedes this real time if it has more than the previously defined time increment. These predetermined time increments can be made for one hour, one day, one month, or several billing cycles expressed in length of time.

Certain embodiments support the creation and removal of knowledge intervals by receiving and processing a knowledge interval message that indicates whether to create or remove a knowledge interval based on the content of the knowledge message. To do. Such an embodiment advantageously supports a unified message processing protocol that incorporates various knowledge interval set operations, including at least the creation and removal of knowledge intervals. Such an embodiment further advantageously provides encryption, error detection and correction,
And can support authentication.

Particular embodiments include maintaining a bid interval set of short-lived indistinguishable item bid intervals, each of which includes a bid price, a bid quantity, and a bid time interval. Such embodiments advantageously support tracking bids for short-lived indistinguishable items in a set of time intervals.

Certain further embodiments commit the first bid of the set of bid intervals and commit the first bid interval to create a committed first bid interval of the set of bid intervals, the knowledge interval. Using the committed first bid interval to create a first knowledge interval of the set. Such embodiments advantageously support virtual trading on short-lived indistinguishable products and the incorporation of consensus agreements into a set of knowledge intervals used to create device operation schedules.

Certain further embodiments support the incorporation of quantities into the knowledge interval set of knowledge intervals and the creation of quantities in the knowledge interval based on the quantities in the first committed bid interval. Such an embodiment further advantageously supports virtual trading on short-lived indistinguishable products and incorporation of consensus agreements into a set of knowledge intervals used to create device operation schedules. It should be noted that the quantity and cost in the first knowledge interval may incorporate regulatory tariffs, taxes, and other indirect costs that do not necessarily exist directly within the bidding interval itself.

Certain other additional embodiments include determining the need for short-lived indistinguishable goods over a planning time interval, which includes examining an equipment usage set that includes equipment usage entries. And each of these entries
A delivery date and a short-lived indistinguishable product need schedule to create a short-lived indistinct product need over a planning time interval, the schedule including a quantity. Such embodiments advantageously support situations where various equipment usages, including delivery dates and need schedules, can be integrated to create product needs at time intervals. As an example, the dishes may need to be washed before dinner, but the laundry must be finished before breakfast.

Certain further embodiments include the need for short-lived indistinguishable products over time intervals that further include cost limits. With respect to the first time interval, placing a first bid of a first bid quantity at a first bid price is for a short life indistinguishable product, including quantity and cost limits. Based on need. Such an embodiment further advantageously supports trading short-lived indistinguishable goods based on the cost constraints of consumers of such goods. As an example, a factory can promise to make a certain number of units at a certain selling price by a certain delivery date. This commitment determines what the factory can spend on short-lived, indistinguishable products to make such units, as well as the quantity, delivery time, and need schedules of such products.

[0063] Certain other additional embodiments include creating a device operation schedule, which includes determining an equipment usage plan that includes equipment usage items. Each equipment use item includes an action that belongs to an action set including a start action, a stop action, and a throttle action, and a start time. Such embodiments advantageously support the commonly required activities of starting and stopping the device and modifying or throttling operating parameter (s).

Certain further embodiments include methods for controlling devices that consume short-lived indistinguishable merchandise based on knowledge interval sets. Such methods include methods of planning a device to create a device operation schedule as disclosed herein and operating the device based on the device operation schedule. Such embodiments advantageously support not only planning for the device, but also operating the device based on the device operation schedule.

Certain further embodiments include at least one operation included in a set of device start, stop, and throttle. Such embodiments advantageously reflect the most basic operation of standard devices that consume indistinguishable goods with short lifetimes. Certain further embodiments include starting, stopping, and throttle operation of the device, respectively. Such an embodiment further advantageously reflects the most basic operation of most standard devices that consume short-lived, indistinguishable goods.

Certain further embodiments include starting and stopping a device based on a device operation schedule based on at least one of the equipment usage items of an equipment usage plan, each including a start behavior, a stop behavior, and a throttle behavior. And the step of throttling. Such an embodiment advantageously starts, stops, and shuts down the device based on each action within the equipment usage item of the equipment usage plan.
Or throttle.

Certain further embodiments include equipment usage items that include throttle behavior and further include throttle settings. Throttling the device based on the device operation schedule is further based on at least one of the equipment usage items of the equipment usage plan including throttle behavior and throttle settings. Such embodiments advantageously provide for changes in operating parameters through throttle settings within the throttle behavior equipment usage item.

Certain further embodiments include equipment usage items that include initiation actions and further include throttle settings. The step of starting the device based on the device operation schedule is further based on at least one of the equipment usage items of the equipment usage plan including the start behavior and the throttle setting. Such embodiments advantageously provide activation parameterization through throttle settings within the equipment usage item of the initiation behavior.

Certain embodiments further include a device comprising a device set that includes at least two devices that consume short-lived indistinguishable items. The operation includes a method of planning a device that consumes a short-lived indistinguishable product based on a knowledge interval set and operating the device set based on the device set operation schedule to create a device set operation schedule. Be done. Such embodiments advantageously support the planning and operating steps of a large number of devices. Examples of such embodiments include, by way of example, homes in industrialized countries, where there are numerous devices that consume electricity, and assembly plants, which have various electricity consuming devices.

Certain further embodiments include at least one of a set comprising starting at least one device of the device set, stopping at least one device, and throttling at least one device. Operating the device set based on the device set operation schedule. Such embodiments advantageously reflect the most basic operation of standard devices that consume indistinguishable goods with short lifetimes.

Certain further embodiments provide a device set operating schedule that includes at least one of a set for each device of the device set, including starting the device, stopping the device, and throttling the device. Based on the steps, operating the device set. Such an embodiment is
More advantageously, it reflects the most basic operation of standard devices that consume indistinguishable goods with short lifetimes.

Certain further embodiments operate the device set based on a device set operating schedule for each device in the device set, including starting the device, stopping the device, and throttling the device. Including steps. Such embodiments more advantageously reflect the most basic operation of standard devices that consume short-lived, indistinguishable goods.

Certain further embodiments include measuring the consumption of short-lived indistinguishable merchandise by the device. Such embodiments advantageously support determination of short-lived, indistinguishable consumption of goods by the device.

Certain further embodiments of measuring consumption measure consumption rates within a measurement time interval, determine a cost for forming a measurement cost factor during the measurement time interval, and measure the measurement time interval. Calculating the cost of consumption of the device over the Such an embodiment advantageously supports short-lived indistinguishable product costs, consumption rates, and measurement time intervals for calculating consumption costs over measurement time intervals.

Certain further embodiments of measuring consumption maintain a cumulative cost for short-lived indistinguishable devices and consumption costs for devices that consume short-lived indistinguishable products over a measurement time interval. Updating the cumulative cost for the short-lived indistinguishable device device. Such embodiments advantageously support cumulative costs for devices with short life and indistinguishable goods.

Certain embodiments include devices that consume a second short-lived indistinguishable item. The method of planning is based on a knowledge interval set including at least one knowledge interval of a first short-lived indistinguishable product, and a knowledge interval including at least one knowledge interval of a second short-lived indistinct product. The method further comprises planning based on the set. The planning step determines the need for a second short life indistinguishable product over the planning time interval, and creates a device operation schedule to identify the first short life over the planning time interval. The method further includes examining a knowledge interval set based on the product need and a second short-lived indistinguishable product need. Such an embodiment advantageously supports planning based on futures prices for both short-lived indistinguishable products.

Certain further embodiments integrate the two knowledge interval sets into a single knowledge interval set that includes at least one knowledge interval for each short-lived indistinguishable product. Such an embodiment advantageously supports maintaining a single set of knowledge intervals that integrates the capabilities of separate sets of knowledge intervals for two short-lived indistinguishable items.

Certain embodiments include a device that consumes a short-lived indistinguishable product and produces a second short-lived indistinguishable product. Device planning includes a planning method based on a knowledge interval set of a first short-lived indistinguishable merchandise item with cost and a second short-lifetime indistinct merchandise knowledge interval set with price. The operation determines the need for a second short life indistinguishable product over the planning time interval, and creates a device operation schedule to create a device operation schedule for the first short life indistinguishable product. Investigating a knowledge interval set based on the need and a second short-lived indistinguishable product need. Such embodiments advantageously support the step of planning for a device that consumes a first short-lived indistinguishable product and produces a second short-lived indistinguishable product.

Certain embodiments include a device for delivering a second short-lived indistinguishable item. Device planning includes a planning method based on a knowledge interval set of short-lived indistinguishable products with cost and a knowledge interval set of second short-lived indistinct product knowledge intervals with price. The operation determines the need for a second short life indistinguishable product over the planning time interval, and the need for a short life indistinguishable product over the planning time interval to create a device operation schedule. Inspecting a knowledge interval set based on a second short-lived indistinguishable product need. Such an embodiment advantageously supports the step of planning for a device that consumes one short-lived indistinguishable item and carries a second short-lived indistinct item.

Certain embodiments plan a device that generates a short-lived indistinguishable product based on a knowledge interval set that includes at least one knowledge interval of the short-lived indistinct product in a time interval that includes price. Including the method. This method is based on the need for short life indistinguishable products over the planning time interval to determine the need for short life indistinguishable products over the planning time interval and to create a device operation schedule. Including a step of examining the interval set.

Such a method advantageously incorporates futures market prices for short-lived indistinguishable commodities represented by knowledge intervals to create device operation schedules.

Certain embodiments are methods of planning a device that carries a short-lived indistinguishable based on a knowledge interval set that includes at least one knowledge interval of a short-lived indistinguishable product at a time interval that includes price. including. This method is based on the need for short life indistinguishable products over the planning time interval to determine the need for short life indistinguishable products over the planning time interval and to create a device operation schedule. Including a step of examining the interval set.

Such a method advantageously incorporates futures market prices for short-lived indistinguishable commodities represented by knowledge intervals to create device operation schedules.

Certain embodiments include electricity as a short-lived indistinguishable item. Such embodiments advantageously relate to power grids and devices on such grids. Certain further embodiments include DC electricity as a short-lived indistinguishable item. Such embodiments more advantageously relate to power grids and devices on such grids. Certain other additional embodiments include DC electricity as a short-lived indistinguishable item. Such embodiments more advantageously relate to power grids and devices on such grids.

Particular embodiments include, in at least one computer-readable memory operably coupled to a computer in a computing system that supports the step of planning a device, as described above. Includes a program operating system with existing program steps.
Such embodiments advantageously support the use of computers to implement such embodiments.

Certain further embodiments are operatively coupled to a computer in a computing system that supports the step of planning a device that further supports communication for a knowledge interval set, as described above. A program operating system comprising program steps resident in at least one computer readable memory. Such embodiments advantageously support communication for knowledge intervals over time.

Certain other additional embodiments provide for access to a computer in a computing system that supports the step of planning a device that further supports communication for a bid interval set, as described above. A program residing in at least one computer-readable memory associated with
Includes a program operating system with steps. Such embodiments advantageously support trading of short-lived indistinguishable items as part of the planning operation of the device.

Certain further embodiments include at least one computer operably coupled to a computer in a computing system that supports the steps of planning and operating a device, as described above. A program operating system with program steps residing in one computer-readable memory. Such embodiments advantageously include operation and planning of the device.

Certain embodiments are herein described as program steps included in a program operating system that are advantageously executed by a computing system that includes at least one computer having an associated computer-readable memory. Supports the operations described in. The program steps need not all belong to the same instruction execution system, but can advantageously include program steps executing on multiple computers. The computing system may advantageously further include a client computer set and a server system coupled by a network. The network may advantageously be associated with a particular client computer on an ongoing or sporadic basis. The server system includes at least one server computer having a computer memory operably coupled thereto. In a particular further embodiment, the server system advantageously comprises a number of server computers coupled to a network, each of which has a coupled accessible computer memory. In a particular further embodiment, the server system supports redundant program steps that maintain various portions or all of the virtual exchange for short-lived indistinguishable products.

These and other advantages of the invention will be apparent upon reading the following detailed description and reviewing the various figures of the drawings.

[0091]

BEST MODE FOR CARRYING OUT THE INVENTION

FIG. 3A illustrates a virtual exchange 1000 that includes active orders and market intervals having associated market conditions, according to certain embodiments.

Virtual exchange mechanism 1000 includes a set of market intervals, each having an associated market state, and a valid order. The market includes product types and locations. Trading in the market is done at Market Interval 1100, 11
From the perspective of 20, 1140, and 1160. The market intervals of a market each include a market product type, a market position, and a calendar system with interval endpoints. The market status of the market interval includes the market price of the market interval product type at the market interval position during the market interval time interval.

For certain further embodiments, the valid orders include the quantity of the market interval product type and the price of the market interval product type. This valid order is a bid order or an ask valid order.

For certain further embodiments, the virtual exchange supports the step of trading short-lived indistinguishable commodities in a power grid that includes at least one AC power network. Each AC power network further includes a node set of at least two nodes. In certain further embodiments, the market interval product types of the market interval set are elements of the product type set that include energy and AC power transfer. In a particular further embodiment, the position of the market interval having the energy product type is the first node of the node set of the AC power network included in the power grid. In certain further embodiments,
The location of a market interval having an AC power transfer product type is from the first node of the first AC power network included in the power grid to the second node of the first AC power network.

FIG. 3B illustrates a market interval including product type, location, and time interval, according to particular embodiments. This product type includes short-lived indistinguishable products in certain embodiments. In certain further embodiments, all product types are short-lived indistinguishable products.

For certain embodiments, location refers to a single node. For certain embodiments, nodes may be geographically designated. For certain embodiments, a node may be designated in terms of nodes in a network, including both a set of nodes and a set of lines, each line being a first node to a second node. Is. The term line used in the present specification does not mean only a straight line. In a particular embodiment, a node may be designated with respect to nodes of the network that are included in the grid of one or more networks, and may further include special wires connecting nodes of the network that may be separate. Can be included.

For certain further embodiments, the location may add a transition or transfer from the first node to the second node. As explained above, such a transition within the network will correspond to the line between the first node and the second node.

FIG. 3C further includes a number of time intervals, according to certain embodiments.
It shows the improvement of the market interval shown in. In this figure, as an example,
It shows two time intervals. For certain embodiments, more than two time intervals may be included in a market interval. In certain further embodiments, each of the multiple time intervals does not overlap in time with other time intervals included in the market interval.

FIG. 4A illustrates short-lived indistinguishable products based on a knowledge interval set including at least one knowledge interval of short-lived indistinguishable products in a time interval, including cost, according to certain embodiments. 3 shows a flow chart of how to plan a device for consumption.

Operation 2000 initiates the operation of this flow chart. Arrow 2002 shows the flow of execution from action 2000 to action 2004. Operation 2004 is planning time
Perform the steps of determining the need for a short life indistinguishable product over an interval. Arrow 2006 indicates execution from action 2004 to action 2008. Operation 2008 performs a step of exploring a knowledge interval set based on the need for short-lived indistinguishable goods over a planning time interval to create a device operation schedule. Arrow 2010 indicates execution from action 2008 to action 2012. motion
By 2012, the operation of this flow chart ends.

For certain embodiments, these operations reside in combined computer-readable memory residing on at least one computer in a computing system that supports virtual exchanges for short-lived indistinguishable commodities. Supported by the program step.

As used herein, the term computer refers to instruction set computers, reasoning computers, analog computers, and collections of these basic types of computers. Computer further refers to an information device that incorporates one or more computers within its structure. Such information devices can be physically separate units, can be explicitly integrated into other devices, or can be clearly located in the vicinity of one or more physically moving natural persons. Can be integrated into.

As used herein, a particular computer, such as an instruction processing computer and a reasoning computer, holds something referred to herein as an instruction.
Includes combined computer-readable memory. Instructions, as used herein with respect to instruction set computers, refer to information that controls the state transitions of such instruction computers. Based on the individual information or set of information currently being executed and the internal state, the instruction processing computer determines the future state of this state processing computer. Note that such an instruction can be directly executed by the instruction processing computer, or can be interpretively executed by the instruction processing computer.

Instructions, as used herein with respect to instruction set computers, refer to information presented to a reasoning computer, which information is based on the reasoning infrastructure of the reasoning computer being directed by the presented instructions. Used to infer the future state of. Such reasoning infrastructure may reside within the reasoning computer in particular cases, or may reside in a combined computer-accessible memory readable and writable by the reasoning computer. As part of the inference computer, various forms of Horn clause predicates, constraint rules, pattern recognition templates, fractal pattern templates,
And a fuzzy logic predicate structuring element.

An analog computer as used herein includes, as part thereof, a device directly coupled to analog circuitry. As used herein, such analog circuits include, as part thereof, a radio frequency IF stage, an optoelectronic interface such as a laser embedded in an optical fiber communication system, audio and video pattern recognition circuits, audio and video output. Including devices and. An analog computer as used herein includes, as part thereof, an acoustic interface with a natural person, an auditory and visual identification portal for AC power transfer contracts for flow gates, and encoding and decoding used in telecommunications. Includes a mechanism and interface with the consensus contract recording device.

Program steps, as used herein, refer to instructions, which by execution or inference, are in the form of instructing a computer to be coupled to a computer-readable memory in which the program steps reside. It should be noted that, for certain embodiments, program steps may be native executable instructions of an instruction processing computer. For certain other embodiments, the program steps can be instructions that are executed interpretively in an instruction processing computer.

FIG. 4B further comprises creating a first knowledge interval for a short-lived indistinguishable product at a first time interval that includes a first cost in a knowledge interval set, according to certain embodiments. Detailed Flow of Action 2000 in Figure 4A
The chart is shown.

The arrow 2030 shows the flow of execution from the start operation 2000 to the operation 2032. Operation 2032 is
Performing a step of creating a first knowledge interval of a short-lived indistinguishable product at a first time interval that includes a first cost in the knowledge interval set. Arrow 2034 indicates execution from action 2032 to action 2036. Operation 2036 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 5A shows a detailed flow chart of operation 2032 of FIG. 4B performing the steps of receiving a create knowledge interval message and creating a knowledge interval, according to a particular embodiment.

The arrow 2050 shows the flow of execution from the start operation 2032 to the operation 2052. Operation 2052 is
Performing the step of receiving a knowledge interval creation message to create a received knowledge interval creation message. Arrows 2054 indicate actions 2052 to 2056
Indicates execution to. Act 2056 includes creating a first knowledge interval for the short-lived indistinguishable product at the first time interval, including the first cost in the knowledge interval set, based on the received knowledge interval creation message. Run. Arrow 2058 indicates execution from action 2056 to action 2060. Operation 2060 ends the operation of this flow chart.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 5B is a detail of operation 2056 of FIG. 5A performing the steps of processing a received knowledge interval creation message and inserting a first knowledge interval into a knowledge interval collection, according to a particular embodiment. Shows a simple flow chart.

An arrow 2070 shows a flow of execution from the start operation 2056 to the operation 2072. Operation 2072 is
Performing a step of processing a received knowledge interval creation message to create a processed knowledge interval for a short-lived indistinguishable product at a first time interval, including a first cost. Arrow 2074 indicates execution from act 2072 to act 2076. Action 2076 includes the first cost as the first knowledge interval for the indistinguishable merchandise of the short life at the first time interval, which includes the first cost and the short life at the first time interval. Performing the step of inserting the processed knowledge intervals of the indistinguishable goods of the above into the knowledge interval set. Arrow 2078 indicates execution from action 2076 to action 2080. Operation 2080 ends the operation of this flow chart.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 6A illustrates a knowledge interval set 1200 including a knowledge interval 1210 according to a particular embodiment.

It should be noted that, for certain embodiments, knowledge interval set 1200 may be implemented in computer-accessible memory coupled to a computer. For certain further embodiments, knowledge interval set 1200 may be implemented as a table containing knowledge intervals 1210 as entries in the table. For certain further alternative embodiments, knowledge interval set 1200 may be implemented as an instance of a record structure that includes a pointer to an instance of the record structure of knowledge interval 1210. For certain further alternative embodiments, knowledge interval set 1200 may be implemented as an object instance that includes a reference to an object class instance of knowledge interval 1210. For certain further embodiments, knowledge interval set 1200 may be implemented as an object instance that contains a pointer reference to an object class instance of knowledge interval 1210. For certain further alternative embodiments, knowledge interval set 1200 may be implemented as an object instance that includes a handle reference to an object class instance of knowledge interval 1210.

FIG. 6B illustrates a knowledge interval set 1200 that does not include a knowledge interval, according to certain embodiments.

It should be noted that, for particular embodiments, knowledge interval set 1200 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, knowledge interval set 1200 may be implemented as a table that does not include knowledge interval entries in the table. In another particular further embodiment, the knowledge interval set 1200 may be implemented as a record structure instance that does not include a pointer to the record structure instance of the knowledge interval. For certain further embodiments, knowledge interval set 1200 may be implemented as a record structure instance that includes a null pointer to the record structure instance of the knowledge interval. In another particular further embodiment, knowledge interval set 1200 may be implemented as an object instance that does not include a reference to the object class instance of the knowledge interval. In another particular further embodiment, the knowledge interval set 1200 can be implemented as an object instance that contains a null reference to the object class instance of the knowledge interval. In another particular further embodiment, the knowledge interval set 1200 may be implemented as an object instance that does not include a pointer reference to an object class instance of the knowledge interval. In another particular further embodiment, the knowledge interval set 1200 can be implemented as an object instance that contains a null pointer reference to the object class instance of the knowledge interval. In another particular further embodiment, the knowledge interval set 1200 can be implemented as an object instance that does not include a handle reference to the object class instance of the knowledge interval. In certain other further embodiments, the knowledge interval set 1200 can be implemented as an object instance that contains a null handle reference to the object class instance of the knowledge interval.

FIG. 6C illustrates a knowledge interval set 1200 including knowledge intervals 1210, 1220, according to certain embodiments.

It should be noted that, for particular embodiments, knowledge interval set 1200 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, the knowledge interval set 1200 includes knowledge intervals 1210 and 1220.
Can be implemented as a table containing as an entry in the table. In another particular further embodiment, the knowledge interval set 1200 is a knowledge interval 1210.
And 1220 record structure instances that include pointers to the record structure instances. In another particular further embodiment,
Knowledge interval set 1200 may be implemented as an object instance that contains references to the object class instances of knowledge intervals 1210 and 1220. For certain further embodiments, knowledge interval set 1200 may be implemented as an object instance that contains pointer references to the object class instances of knowledge intervals 1210 and 1220. In another particular further embodiment, the knowledge interval set 1200 is a knowledge interval 1210.
And 1220 can be implemented as an object instance containing a handle reference to an object class instance. In another particular further embodiment, knowledge interval set 1200 may be implemented as a record structure instance that includes pointers to a linked pointer list of record structure instances of knowledge intervals 1210 and 1220. In a similar manner, 1200 object instances can utilize references, pointer references, and handle references to instances of objects that form a linked list of references that include knowledge intervals 1210 and 1220.

In a particular embodiment, three or more knowledge intervals are added to the knowledge interval set 12
Can be included in 00. For certain embodiments, the knowledge interval set may be implemented as a set of inference clauses, in which case the knowledge interval may then be represented as a set of inference clauses.

FIG. 6D illustrates a second knowledge interval set 1202 that includes knowledge intervals 1230 and 1240, according to certain embodiments.

It should be noted that, for certain embodiments, knowledge interval set 1202 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, the knowledge interval set 1202 includes knowledge intervals 1230 and 1240.
Can be implemented as a table containing as an entry in the table. In another particular further embodiment, the knowledge interval set 1202 is a knowledge interval 1230.
And 1240, which may be implemented as an instance of a record structure that includes a pointer to an instance of the record structure. In another particular further embodiment,
Knowledge interval set 1202 may be implemented as an object instance that contains references to object class instances of knowledge intervals 1230 and 1240. For certain further embodiments, knowledge interval set 1202 may be implemented as an object instance containing pointer references to the object class instances of knowledge intervals 1230 and 1240. In another particular further embodiment, the knowledge interval set 1202 is a knowledge interval 1230.
And 1240 can be implemented as an object instance containing a handle reference to an object class instance. For certain further alternative embodiments, knowledge interval set 1202 may be implemented as a record structure instance that includes pointers to linked pointer lists of record structure instances of knowledge intervals 1230 and 1240. In a similar manner, object instances at 1202 can utilize references, pointer references, and handle references to instances of objects that form a linked list of references that include knowledge intervals 1230 and 1240.

In a particular embodiment, three or more knowledge intervals are added to the knowledge interval set 12
Can be included in 02. For certain embodiments, only one knowledge interval may be included in knowledge interval set 1202. For certain embodiments, knowledge intervals may not be included in knowledge interval set 1202. For certain embodiments, the knowledge interval set may be implemented as a set of inference clauses, where the knowledge interval may then be represented as a set of inference clauses. For certain embodiments, more than two knowledge interval sets may be implemented.

FIG. 7A illustrates a short-lived indistinguishable product 1212 and time according to a particular embodiment.
A knowledge interval 1210 including an interval 1214 and a cost 1216 is shown.

It should be noted that, for particular embodiments, knowledge interval 1210 may be implemented in a computer accessible memory coupled to a computer. In certain further embodiments, the knowledge interval 1210 includes a product 1212 and a time interval 1214.
And a cost 1216 as an entry in the table can be implemented. In another particular further embodiment, the knowledge interval 1210 is a product 12
It can be implemented as an instance of a record structure that includes a pointer to an instance of the record structure of 12, a time interval 1214 and a cost 1216. For certain further alternative embodiments, the knowledge interval 1210 may be implemented as an object instance that includes a reference to an object class instance of a product 1212, a time interval 1214, and a cost 1216.
For certain further embodiments, knowledge interval 1210 may be implemented as an object instance that includes pointer references to object class instances of product 1212, time interval 1214, and cost 1216.
In another particular further embodiment, the knowledge interval 1210 may be implemented as an object instance that includes a handle reference to an object class instance of a product 1212, a time interval 1214, and a cost 1216.

Note that in a particular embodiment, the knowledge interval set 1200 is
Knowledge intervals 1210 and 1220 can be included that include different short-lived indistinguishable items. In certain other embodiments, the knowledge interval set may have as part of it added knowledge intervals for non-distinguishable merchandise items.

FIG. 7B illustrates a knowledge interval 1210 that may include a time interval 1214 and a cost 1216 without an explicit reference to a short-lived indistinguishable product, according to certain embodiments. .

It should be noted that, for particular embodiments, knowledge interval 1210 may be implemented in a computer-accessible memory coupled to a computer. In certain further embodiments, the knowledge interval 1210 includes a product 1212 and a time interval 1214.
And a cost 1216 as an entry in the table can be implemented. In another particular further embodiment, the knowledge interval 1210 is a product 12
It can be implemented as an instance of a record structure that includes a pointer to an instance of the record structure of 12, a time interval 1214 and a cost 1216. For certain further alternative embodiments, the knowledge interval 1210 may be implemented as an object instance that includes a reference to an object class instance of a product 1212, a time interval 1214, and a cost 1216.
For certain further embodiments, knowledge interval 1210 may be implemented as an object instance that includes pointer references to object class instances of product 1212, time interval 1214, and cost 1216.
In another particular further embodiment, the knowledge interval 1210 may be implemented as an object instance that includes a handle reference to an object class instance of a product 1212, a time interval 1214, and a cost 1216.

Note that in a particular embodiment, the knowledge interval set 1200 is
Knowledge intervals 1210 and 1220 may be included that do not have an explicit product designation 1212, but include different short-lived indistinguishable products inferred by being included in a separate table, linked list, or the like. In certain other embodiments, the knowledge interval set does not have an explicit product designation 1212 and is not a short-lived indistinguishable product, but is inferred by being included in a separate table, linked list, etc. You can add a knowledge interval for a product.

FIG. 7C illustrates a short-lived indistinguishable product 1212 and time according to certain embodiments.
FIG. 10 is a diagram showing a knowledge interval 1210 including an interval set 1218 and a cost 1216.

It should be noted that, for particular embodiments, knowledge interval 1210 may be implemented in a computer accessible memory coupled to a computer. In a particular further embodiment, the knowledge interval 1210 includes a product 1212 and a time interval set.
It can be implemented as a table that includes 1218 and costs 1216 as entries in the table. In certain other further embodiments, the knowledge interval 1210 can be implemented as an instance of a record structure that includes pointers to the record structure instance of the product 1212, the time interval set 1218, and the cost 1216. In another particular further embodiment, the knowledge interval 1210 is a product 12
Object class with 12 and time interval set 1218 and cost 1216
It can be implemented as an object instance that contains a reference to the instance. For certain further embodiments, the knowledge interval 1210 may be implemented as an object instance that includes pointer references to object class instances of a product 1212, a time interval set 1218, and a cost 1216. In another particular further embodiment, the knowledge interval 1210 may be implemented as an object instance that includes a handle reference to an object class instance of a product 1212, a time interval set 1218, and a cost 1216. .

Note that in a particular embodiment, the knowledge interval set 1200 is
Knowledge intervals 1210 and 1220 can be included that include different short-lived indistinguishable items. In certain other embodiments, the knowledge interval set may have as part of it added knowledge intervals for non-distinguishable merchandise items.

In a particular alternative embodiment, as described above, the knowledge interval 1210 does not include an explicit reference to a short-lived indistinguishable merchandise and the time interval 1210.
14 and costs 1216.

FIG. 7D illustrates a time interval set 1218 that includes time intervals 1214-1 and 1214-2, according to certain embodiments.

It should be noted that, for particular embodiments, time interval set 1218 may be implemented in computer-accessible memory coupled to a computer. In certain further embodiments, the time interval set 1218 is a time interval set.
It can be implemented as a table that includes 1214-1 and 1214-2 as entries in the table. For certain other further embodiments, the time interval set 1218 may be implemented as an instance of a record structure that includes pointers to the record structure instances of time intervals 1214-1 and 1214-2. In another particular further embodiment, the time interval set 1218 can be implemented as an object instance that contains references to the object class instances of the time intervals 1214-1 and 1214-2. For certain further embodiments, the time interval set 1218 includes time intervals 1214-1 and 12-1.
It can be implemented as an object instance that contains a pointer reference to the 14-2 object class instance. In certain other further embodiments, the time interval set 1218 includes time intervals 1214-1 and 1214-2.
Can be implemented as an object instance containing a handle reference to the object class instance of.

For certain embodiments, the time interval set 1218 may include, as part thereof, one time interval 1214-1. For certain embodiments, the time interval set 1218 may include more than two time intervals as part thereof.

FIG. 8A illustrates a short-lived indistinguishable product 1212 and a time stamp according to certain embodiments.
A knowledge interval 1210 including an interval 1214 and a price 1216-1 is shown.

It should be noted that, for particular embodiments, knowledge interval 1210 may be implemented in a computer-accessible memory coupled to a computer. In certain further embodiments, the knowledge interval 1210 includes a product 1212 and a time interval 1214.
And price 1216-1 as an entry in the table. In another particular further embodiment, the knowledge interval 1210 is a product 12
It can be implemented as an instance of a record structure that includes a pointer to an instance of the record structure of 12, the time interval 1214 and the price 1216-1. In certain other further embodiments, the knowledge interval 1210 can be implemented as an object instance that includes a reference to the object class instance of the product 1212, the time interval 1214, and the price 1216-1. .
For certain further embodiments, the knowledge interval 1210 may be implemented as an object instance that contains pointer references to object class instances of the product 1212, the time interval 1214, and the price 1216-1.
In another particular further embodiment, the knowledge interval 1210 may be implemented as an object instance that includes a handle reference to the object class instance of the product 1212, the time interval 1214, and the price 1216-1. it can.

Note that in certain embodiments, the knowledge interval set 1200 is
Knowledge intervals 1210 and 1220 can be included that include different short-lived indistinguishable items. In certain other embodiments, the knowledge interval set may have as part of it added knowledge intervals for non-distinguishable merchandise items.

FIG. 8B illustrates a knowledge interval 1210 that can include a time interval 1214 and a price 1216-1 without an explicit reference to a short-lived indistinguishable product, according to certain embodiments. ing.

It should be noted that, for particular embodiments, knowledge interval 1210 may be implemented in a computer-accessible memory coupled to a computer. In certain further embodiments, the knowledge interval 1210 includes a product 1212 and a time interval 1214.
And price 1216-1 as an entry in the table. In another particular further embodiment, the knowledge interval 1210 is a product 12
It can be implemented as an instance of a record structure that includes a pointer to an instance of the record structure of 12, the time interval 1214 and the price 1216-1. In certain other further embodiments, the knowledge interval 1210 can be implemented as an object instance that includes a reference to the object class instance of the product 1212, the time interval 1214, and the price 1216-1. .
For certain further embodiments, the knowledge interval 1210 may be implemented as an object instance that contains pointer references to object class instances of the product 1212, the time interval 1214, and the price 1216-1.
In another particular further embodiment, the knowledge interval 1210 may be implemented as an object instance that includes a handle reference to the object class instance of the product 1212, the time interval 1214, and the price 1216-1. it can.

Note that in a particular embodiment, the knowledge interval set 1200 is
Knowledge intervals 1210 and 1220 may be included that do not have an explicit product designation 1212, but include different short-lived indistinguishable products inferred by being included in a separate table, linked list, or the like. In certain other embodiments, the knowledge interval set may have as part of it added knowledge intervals for non-distinguishable merchandise items. In certain further embodiments, the knowledge interval set does not carry an explicit product designation as part of it, but is indistinguishable for short lives, which is inferred by being included in a separate table, linked list, etc. You can add knowledge intervals for non-commodity products.

FIG. 8C illustrates a short-lived indistinguishable product 1212 and time according to certain embodiments.
A knowledge interval 1210 including an interval set 1218 and prices 1216-1 is shown.

It should be noted that, for particular embodiments, knowledge interval 1210 may be implemented in a computer-accessible memory coupled to a computer. In a particular further embodiment, the knowledge interval 1210 includes a product 1212 and a time interval set.
It can be implemented as a table containing 1218 and prices 1216-1 as entries in the table. In certain other further embodiments, the knowledge interval 1210 may be implemented as an instance of a record structure that includes pointers to an instance of the record structure for the product 1212, the time interval set 1218, and the price 1216-1. it can. In another particular further embodiment, the knowledge interval 1210 is a product 12
Object class with 12 and time interval set 1218 and price 1216-1
It can be implemented as an object instance that contains a reference to the instance. For certain further embodiments, the knowledge interval 1210 may be implemented as an object instance that includes pointer references to object class instances of the product 1212, the time interval set 1218, and the price 1216-1. . In another particular further embodiment, the knowledge interval 1210 is implemented as an object instance containing a handle reference to the object class instance of the product 1212, the time interval set 1218, and the price 1216-1. You can

Note that in a particular embodiment, the knowledge interval set 1200 is
Knowledge intervals 1210 and 1220 can be included that include different short-lived indistinguishable items. In certain other embodiments, the knowledge interval set may have as part of it added knowledge intervals for non-distinguishable merchandise items.

In a particular alternative embodiment, as described above, the knowledge interval 1210 does not include an explicit reference to a short-lived indistinguishable merchandise.
14 and the price 1216-1 can be included.

FIG. 9A illustrates a second knowledge interval with a first knowledge interval within a knowledge interval set, with the first and second knowledge intervals sharing the same time interval, according to certain embodiments. 5B illustrates a detailed flow chart of operation 2056 of FIG.

The arrow 2090 shows the flow of execution from the start operation 2056 to the operation 2092. Operation 2092
Performing the replacement of the second knowledge interval with the first knowledge interval in the set of knowledge intervals. Arrow 2094 indicates execution from action 2092 to action 2096. Operation 2096 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 9B illustrates when the first time interval of the first knowledge interval intersects the time interval (s) of the second knowledge interval already included in the knowledge interval set, according to a particular embodiment. Shows a detailed flow chart of operation 2056 of FIG. 5A, further performing the step of cutting the time interval or set of time intervals and modifying the second knowledge interval to insert into the first time interval. ing.

Arrow 2110 shows the flow of execution from start operation 2056 to operation 2112. Operation 2112 is
Determining a set of remaining time intervals of at least one remaining time interval such that the remaining time intervals collectively include a second time interval that is not included in the first time interval. To execute. Arrow 2114 indicates execution from act 2112 to act 2116. Act 2116 performs replacing the second time interval of the second knowledge interval with the remaining time interval set in the knowledge interval set. Arrows 2118 indicate actions 2116 to 2120.
Indicates execution to. Act 2120 performs inserting a first knowledge interval for a short-lived indistinguishable product at a first time interval, including a first cost. Arrow 2122 indicates execution from action 2120 to action 2124. By operation 2124,
The operation of this flow chart ends.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 10A illustrates performing a step of deleting a second knowledge interval from a knowledge interval according to a particular embodiment when the second time interval is greater than that included in the first time interval. Figure 5 shows a detailed flow chart of 5A operation 2056.

The arrow 2130 shows the flow of execution from the start operation 2056 to the operation 2132. Operation 2132
Perform the step of removing the second knowledge interval from the knowledge interval. Arrow
2134 shows the execution from act 2132 to act 2136. This flow can be
The operation of the chart ends.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 10B illustrates removing a first knowledge interval of a short-lived indistinguishable product at a first time interval, including a first cost, from a set of knowledge intervals according to a particular embodiment. The flow chart to perform is shown.

Operation 2150 initiates the operation of this flow chart. Arrow 2152 shows the flow of execution from action 2150 to action 2154. Act 2154 performs removing the first knowledge interval of the short-lived indistinguishable product at the first time interval, including the first cost, from the knowledge interval set. Arrow 2156 moves
Shown is the execution from 2154 to operation 2158. Operation 2158 ends the operation of this flow chart.

For certain embodiments, these operations reside in combined computer-readable memory residing on at least one computer in a computing system that supports virtual exchanges for short-lived indistinguishable commodities. Supported by the program step.

FIG. 11A illustrates a detailed flow chart of operation 2154 of FIG. 10B further performing the steps of receiving and processing a knowledge interval removal message, according to certain embodiments.

The arrow 2170 shows the flow of execution from the start operation 2154 to the operation 2172. Operation 2172 is
Performing the step of receiving a knowledge interval removal message to create a received knowledge interval removal message. The arrow 2174 indicates the operation 2172 to the operation 2176.
Indicates execution to. Act 2176 removes the first knowledge interval of the short-lived indistinguishable product at the first time interval from the set of knowledge intervals based on the received knowledge interval removal message. Run. Arrow 2178 indicates execution from action 2176 to action 2180. Operation 2180 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 11B shows a flow chart for performing the steps of building real time according to a particular embodiment.

Operation 2190 initiates the operation of this flow chart. Arrow 2192 shows the flow of execution from action 2190 to action 2194. Act 2194 performs the steps of building real time. Arrow 2196 indicates execution from action 2194 to action 2198. Operation 2198 ends the operation of this flow chart.

For certain embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 12A illustrates a first time interval of a first knowledge interval, including a first cost, from a set of knowledge intervals whenever the first time interval of the first knowledge interval precedes in real time, according to a particular embodiment. FIG. 10B shows a detailed flow chart of operation 2154 of FIG. 10B further performing the step of removing the first knowledge interval of the short-lived indistinguishable merchandise at the time interval.

Arrow 2210 shows the flow of execution from start operation 2154 to operation 2212. Operation 2212
Performing a step of determining whether the first time interval of the first knowledge interval precedes in real time. Arrow 2214 indicates execution from act 2212 to act 2216. Action 2216 distinguishes a short life span at the first time interval, including the first cost, from the set of knowledge intervals whenever the first time interval of the first knowledge interval precedes in real time. Perform the steps to remove the first knowledge interval of the impossible product. Arrow 2218 indicates execution from act 2216 to act 2220. Operation 2220 ends the operation of this flow chart.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 12B illustrates a first knowledge interval including a first cost from a set of knowledge intervals whenever the first time interval of the first knowledge interval precedes in real time, according to a particular embodiment. FIG. 12B illustrates a detailed flow chart of operation 2216 of FIG. 12A further performing the steps of removing the first knowledge interval of a short-lived indistinguishable product at a time interval.

Arrow 2230 shows the flow of execution from start operation 2216 to operation 2232. Operation 2232
Determine whether the first time interval of the first knowledge interval precedes in real time. Arrow 2234 indicates execution from action 2232 to action 2236 when this determination is "Yes". The arrow 2248 indicates the execution up to the operation 2240 when this determination is “No”.

Operation 2236 includes a first time, including a first cost, from the knowledge interval set.
Performing the steps of removing the first knowledge interval of indistinguishable merchandise at short intervals. Arrow 2238 indicates execution from action 2236 to action 2240. Action 22
With 40, the operation of this flow chart ends.

In a particular embodiment, these operations are a program residing in a combined computer readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 13A shows a flow chart for performing the steps of receiving and processing a knowledge message, according to a particular embodiment.

Operation 2250 initiates the operation of this flow chart. Arrow 2252 indicates execution from action 2250 to action 2254. Act 2254 performs the steps of receiving a first knowledge message to create a first received knowledge message. Arrow 2256 indicates execution from action 2254 to action 2258. Act 2258 performs the steps of processing the first received knowledge message. Arrow 2260 is from action 2258
Shows execution to 2262. Operation 2262 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 13B shows a detailed flow chart of operation 2258 of FIG. 13A further performing the steps of processing a first received knowledge message, according to a particular embodiment.

Arrow 2270 shows the flow of execution from start operation 2258 to operation 2272. Operation 2272
Performing a step of examining a first received knowledge message to create a message type belonging to a knowledge message type set including create_knowledge_interval and remove_knowledge_interval. Arrow 2274 indicates behavior 2272 to behavior 2276
Indicates execution to. Operation 2276 includes a first time, in the knowledge interval set, including a first cost, based on the first received knowledge message whenever the message type of the first received knowledge message is create_knowledge_interval.・
Perform a step of creating a first knowledge interval for indistinguishable merchandise at short intervals. Arrow 2278 indicates execution from action 2276 to action 2280. Action 22
80 is the message type of the first received knowledge message is remove_knowledge_i
Whenever nterval, based on the first received knowledge message, within the knowledge interval set, the first knowledge of the short-lived indistinguishable product at the first time interval, including the first cost. Perform the step of removing the interval. Arrow
2282 shows the execution of action 2280 to action 2284. Operation 2284 allows this flow
The operation of the chart ends.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 14A shows that, whenever the message type of the first received knowledge message is create_knowledge_interval, according to the particular embodiment, based on the first received knowledge message, within the knowledge interval set, 13B shows a detailed flow chart of operation 2276 of FIG. 13B further performing the steps of creating a first knowledge interval for a short-lived indistinguishable product at a first time interval, including a cost. .

The arrow 2290 shows the flow of execution from the start operation 2276 to the operation 2292. Operation 2292
The message type of the first received knowledge message is create_knowledge_inter
Determine if it is val. The arrow 2294 indicates the execution from the operation 2292 to the operation 2296 when this determination is “Yes”. The arrow 2308 indicates the execution up to the operation 2300 when this determination is “No”.

Operation 2296 is based on the first received knowledge message and, within the knowledge interval set, a first knowledge of a short life indistinguishable product at a first time interval, including a first cost. Take steps to create an interval. Arrow 2298 indicates execution from action 2296 to action 2300. Operation 2300 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 14B shows that, whenever the message type of the first received knowledge message is remove_knowledge_interval, according to the particular embodiment, based on the first received knowledge message, within the knowledge interval set, FIG. 13B shows a detailed flow chart of operation 2280 of FIG. 13B further performing the step of removing the first knowledge interval of the short-lived indistinguishable product at the first time interval, including one cost. .

Arrow 2310 shows the flow of execution from start operation 2280 to operation 2312. Operation 2312
The message type of the first received knowledge message is remove_knowledge_inter
Determine if it is val. Arrow 2314 indicates execution from action 2312 to action 2316 when this determination is "Yes". The arrow 2328 indicates the execution up to the operation 2320 when this judgment is “No”.

Operation 2316 is based on the first received knowledge message and, within the knowledge interval set, includes the first cost and the first knowledge of the short-lived indistinguishable product at the first time interval. Perform the step of removing the interval. Arrow 2318 indicates execution from act 2316 to act 2320. Operation 2320 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 15A performs the steps of examining a first received knowledge message to create a message type that includes at least one element of a knowledge message type set, according to certain embodiments. FIG. 6B illustrates a detailed flow chart of operation 2272.

The arrow 2330 shows the flow of execution from the start operation 2272 to the operation 2332. Operation 2332 is
Performing a step of examining the first received knowledge message to create a message type that includes at least one element of the knowledge message type set.
Arrow 2334 indicates the execution from act 2332 to act 2336. Operation 2336 ends the operation of this flow chart.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 15B shows that, whenever the message type of the first received knowledge message includes create_knowledge_interval, according to a particular embodiment, based on the first received knowledge message, within the knowledge interval set, FIG. 13B illustrates a detailed flow chart of operation 2276 of FIG. 13B performing steps to create a first knowledge interval for a short life indistinguishable product at a first time interval, including a cost. .

Arrow 2350 shows the flow of execution from start operation 2376 to operation 2352. Operation 2352 is
The message type of the first received knowledge message is create_knowledge_inter
Whenever val is included, the first knowledge of the short-lived indistinguishable product at the first time interval, including the first cost, within the knowledge interval set, based on the first received knowledge message. Take steps to create an interval. Arrow 2354
Shows the execution from act 2352 to act 2356. Operation 2356 ends the operation of this flow chart.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 15C illustrates that, whenever the message type of the first received knowledge message includes remove_knowledge_interval, according to a particular embodiment, based on the first received knowledge message, within the knowledge interval set, FIG. 13B illustrates a detailed flow chart of operation 2280 of FIG. 13B performing steps to remove a first knowledge interval of a short-lived indistinguishable item at a first time interval, including a cost.

Arrow 2370 shows the flow of execution from start operation 2280 to operation 2372. Operation 2372
The message type of the first received knowledge message is remove_knowledge_inter
Whenever val is included, the first knowledge of the short-lived indistinguishable product at the first time interval, including the first cost, within the knowledge interval set, based on the first received knowledge message. Perform the step of removing the interval. Arrow 2374
Shows execution from act 2372 to act 2376. Operation 2376 ends the operation of this flow chart.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 16A shows that, whenever the message type of the first received knowledge message includes create_knowledge_interval, according to a particular embodiment, based on the first received knowledge message, within the knowledge interval set, FIG. 15B shows a detailed flow chart of operation 2352 of FIG. 15B further performing the steps of creating a first knowledge interval for a short-lived indistinguishable product at a first time interval, including a cost. .

The arrow 2390 shows the flow of execution from the start operation 2352 to the operation 2392. Operation 2392 is
The message type of the first received knowledge message is create_knowledge_inter
Determine if it is val. The arrow 2394 indicates the execution from the operation 2392 to the operation 2396 when this judgment is “Yes”. An arrow 2408 indicates execution up to the operation 2400 when this judgment is “No”.

Operation 2396 is based on the first received knowledge message and, within the knowledge interval set, a first knowledge of a short life indistinguishable product at a first time interval, including a first cost. Take steps to create an interval. Arrow 2398 indicates execution from action 2396 to action 2400. Operation 2400 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 16B shows that, whenever the message type of the first received knowledge message includes remove_knowledge_interval, according to the particular embodiment, based on the first received knowledge message, within the knowledge interval set, FIG. 15B shows a detailed flow chart of operation 2372 of FIG. 15C further performing the step of removing the first knowledge interval of the short-lived indistinguishable product at the first time interval, including one cost. .

Arrow 2410 indicates the flow of execution from start operation 2372 to operation 2412. Operation 2412
The message type of the first received knowledge message is remove_knowledge_inter
Determine if it is val. Arrow 2414 indicates execution from operation 2412 to operation 2416 when this determination is “Yes”. Arrow 2428 indicates execution up to operation 2420 when this determination is “No”.

Act 2416 is based on the first received knowledge message and, within the knowledge interval set, a first knowledge of a short life indistinguishable product at a first time interval, including a first cost. Perform the step of removing the interval. Arrow 2418 indicates execution from act 2416 to act 2420. Operation 2420 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 17A shows a flow chart for performing the steps of maintaining a bid interval set of bid intervals according to a particular embodiment.

Operation 2430 initiates the operation of this flow chart. Arrow 2432 shows the flow of execution from act 2430 to act 2434. Act 2434 performs maintaining a bid interval set of bid intervals. Arrow 2436 operates from operation 2434
Shows execution to 2438. Operation 2438 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in a computing system supporting at least the steps of planning the operation of the device. Supported by steps.

FIG. 17B illustrates a detailed flow chart of operation 2434 of FIG. 17A performing the steps of maintaining a bid interval set of bid intervals, according to a particular embodiment.

Arrow 2450 shows the flow of execution from start operation 2434 to operation 2452. Operation 2452
A first time to create a first bid of a bid interval set that includes a first bid quantity as a bid quantity, a first bid price as a bid price, and a first time interval as a bid time interval. Performing the first bid for the first bid quantity at the first bid price for the interval. Arrow 2454 works
Shown is the execution from 2452 to operation 2456. Operation 2456 ends the operation of this flow chart.

Arrow 2460 shows the flow of execution from start operation 2434 to operation 2462. Operation 2462 is
First bid quantity as bid quantity, first bid price as bid price, bid time
The step of committing the first bid interval is performed to create a committed first bid interval of the set of bid intervals including a first time interval as the interval and a committed flag. Arrow 2464, action 2462
From execution to operation 2456. Operation 2456 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 18A illustrates a bid interval set 1300 that includes bid intervals 1310, according to certain embodiments.

It should be noted that, for certain embodiments, bid interval set 1300 may be implemented in computer-accessible memory coupled to a computer. For certain further embodiments, bid interval set 1300 may be implemented as a table that includes bid intervals 1310 as entries in the table. For certain other further embodiments, bid interval set 1300 may be implemented as an instance of a record structure that includes a pointer to an instance of the record structure for bid interval 1310. For certain other further embodiments, bid interval set 1300 may be implemented as an object instance that includes a reference to an object class instance of bid interval 1310. For certain further embodiments, bid interval set 1300 may be implemented as an object instance that includes a pointer reference to an object class instance of bid interval 1310. For certain further alternative embodiments, the bid interval set 1300 may be implemented as an object instance that includes a handle reference to an object class instance of the bid interval 1310.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 18B illustrates a bid interval set 1300 that does not include bid intervals, in accordance with certain embodiments.

It should be noted that, for certain embodiments, bid interval set 1300 may be implemented in computer-accessible memory coupled to a computer. For certain further embodiments, bid interval set 1300 may be implemented as a table that does not include bid interval entries in the table. For certain other further embodiments, bid interval set 1300 may be implemented as a record structure instance that does not include a pointer to the record structure instance of the bid interval. For certain further embodiments, bid interval set 1300 may be implemented as a record structure instance that includes a null pointer to the record structure instance of the bid interval. For certain other additional embodiments, the bid interval set 1300 may be implemented as an object instance that does not include a reference to an object class instance of the bid interval. For certain further alternative embodiments, the bid interval set 1300 may be implemented as an object instance that includes a null reference to the bid interval's object class instance. In another particular further embodiment, the bid interval set 1300 may be implemented as an object instance that does not include a pointer reference to the bid interval's object class instance. For certain other additional embodiments, the bid interval set 1300 may be implemented as an object instance that includes a null pointer reference to the bid interval's object class instance. For certain other additional embodiments, the bid interval set 1300 may be implemented as an object instance that does not include a handle reference to the bid interval's object class instance. For certain further alternative embodiments, the bid interval set 1300 may be implemented as an object instance that includes a null handle reference to the bid interval's object class instance.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 18C is a diagram illustrating a bid interval set 1300 including bid intervals 1310, 1320, according to certain embodiments.

It should be noted that, for certain embodiments, bid interval set 1300 may be implemented in computer-accessible memory coupled to a computer. For certain further embodiments, bid interval set 1300 includes bid intervals 1310 and 1320.
Can be implemented as a table containing as an entry in the table. In another particular further embodiment, the bid interval set 1300 may include a bid interval 1310.
And 1320 record structure instances that include pointers to the record structure instances. In another particular further embodiment,
Bid interval set 1300 may be implemented as an object instance that includes references to object class instances of bid intervals 1310 and 1320. For certain further embodiments, bid interval set 1300 may be implemented as an object instance that contains pointer references to the object class instances of bid intervals 1310 and 1320. In another particular further embodiment, the bid interval set 1300 may include a bid interval 1310.
And 1320 as object instances containing handle references to object class instances. For certain other further embodiments, bid interval set 1300 may be implemented as a record structure instance that includes a pointer to a linked pointer list of record structure instances for bid intervals 1310 and 1320. In a similar manner, 1300 object instances can utilize references, pointer references, and handle references to instances of objects that form a linked list of references that include bid intervals 1310 and 1320.

For certain embodiments, three or more bid intervals may be included in the bid interval set 13
Can be included in 00. For certain embodiments, the bid interval set may be implemented as a set of inference clauses, where the bid interval may then be represented as a set of inference clauses.

In a particular embodiment, these operations are a program residing in a combined computer readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 18D illustrates a second set of bid intervals 1302 that includes bid intervals 1330 and 1340, according to certain embodiments.

It should be noted that, for certain embodiments, bid interval set 1302 may be implemented in computer-accessible memory coupled to a computer. For certain further embodiments, bid interval set 1302 may include bid intervals 1330 and 1340.
Can be implemented as a table containing as an entry in the table. In another particular further embodiment, the bid interval set 1302 is a bid interval 1330.
And 1340 record structure instances that include pointers to the record structure instances. In another particular further embodiment,
Bid interval set 1302 may be implemented as an object instance that contains references to object class instances of bid intervals 1330 and 1340. For certain further embodiments, bid interval set 1302 may be implemented as an object instance that contains pointer references to the object class instances of bid intervals 1330 and 1340. In another particular further embodiment, the bid interval set 1302 is a bid interval 1330.
And 1340 can be implemented as an object instance containing a handle reference to an object class instance. For certain other further embodiments, bid interval set 1302 may be implemented as a record structure instance that includes pointers to linked pointer lists of record structure instances of bid intervals 1330 and 1340. In a similar manner, 1202 object instances can utilize references, pointer references, and handle references to instances of objects that form a linked list of references that include bid intervals 1330 and 1340.

For certain embodiments, three or more bid intervals may be included in the bid interval set 13
Can be included in 02. For certain embodiments, only one bid interval may be included in bid interval set 1302. For certain embodiments, bid intervals may not be included in bid interval set 1302. For certain embodiments, the bid interval set may be implemented as a set of inference clauses, where the bid interval may then be represented as a set of inference clauses. For certain embodiments, more than two bid interval sets may be implemented.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system supporting at least the steps of planning the operation of the device. Supported by steps.

FIG. 19A illustrates a bid interval 1310 that includes a short-lived indistinguishable product 1312, a bid time interval 1314, a bid price 1316, and a bid quantity 1316-1, according to certain embodiments.

It should be noted that, for certain embodiments, bid interval 1310 may be implemented in computer-accessible memory coupled to a computer. For certain further embodiments, bid interval 1310 may be implemented as a table that includes bid product 1312, bid time interval 1314, bid price 1316, and bid quantity 1316-1 as entries in the table. it can. In another particular further embodiment,
Bid interval 1310 may be implemented as an instance of a record structure that includes pointers to record structure instances of bid item 1312, bid time interval 1314, bid price 1316, and bid quantity 1316-1. In another particular further embodiment, the bid interval 1310 includes an object class of a bid item 1312, a bid time interval 1314, a bid price 1316, and a bid quantity 1316-1.
It can be implemented as an object instance that contains a reference to the instance. In certain further embodiments, the bid interval 1310 may include the bid item 13
An object containing a pointer reference to an object class instance of 12, a bid time interval 1314, a bid price 1316 and a bid quantity 1316-1.
Can be implemented as an instance. In another particular further embodiment,
Bid interval 1310 may be implemented as an object instance that includes a handle reference to an object class instance of bid item 1312, bid time interval 1314, bid price 1316, and bid quantity 1316-1.

Note that in a particular embodiment, the bid interval set 1300 is, as part thereof,
Bidding intervals 1310 and 1320 may be included that include different short-lived indistinguishable items. In certain other embodiments, a bid interval set may have as part of it added bid intervals for non-distinguishable, non-distinguishable items.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 19B does not include an explicit reference to short-lived indistinguishable items, according to certain embodiments, bid time interval 1314, bid price 1316, and bid quantity 13
16-1 illustrates a bid interval 1310 that can include 16-1 and.

It should be noted that, for certain embodiments, bid interval 1310 may be implemented in computer-accessible memory coupled to a computer. For certain further embodiments, bid interval 1310 may be implemented as a table that includes bid product 1312, bid time interval 1314, bid price 1316, and bid quantity 1316-1 as entries in the table. it can. In another particular further embodiment,
Bid interval 1310 may be implemented as an instance of a record structure that includes pointers to record structure instances of bid item 1312, bid time interval 1314, bid price 1316, and bid quantity 1316-1. In another particular further embodiment, the bid interval 1310 includes an object class of a bid item 1312, a bid time interval 1314, a bid price 1316, and a bid quantity 1316-1.
It can be implemented as an object instance that contains a reference to the instance. In certain further embodiments, the bid interval 1310 may include the bid item 13
An object containing a pointer reference to an object class instance of 12, a bid time interval 1314, a bid price 1316 and a bid quantity 1316-1.
Can be implemented as an instance. In another particular further embodiment,
Bid interval 1310 may be implemented as an object instance that includes a handle reference to an object class instance of bid item 1312, bid time interval 1314, bid price 1316, and bid quantity 1316-1.

[0232] Note that in a particular embodiment, the bid interval set 1300 is
Bid intervals 1310 and 1320 may be included that do not have an explicit bid item designation 1312 but include different short-lived indistinguishable items that are inferred by being included in a separate table, linked list, or the like. In certain other embodiments, the bid interval set does not have an explicit bid item designation 1312 as part of it, but
It is possible to add bid intervals for non-distinguishable products that are inferred by being included in separate tables, linked lists, etc.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 19C illustrates a bid interval 1310 that includes a short-lived indistinguishable product 1312, a bid time interval set 1318, a bid price 1316, and a bid quantity 1316-1 according to certain embodiments. .

It should be noted that, for certain embodiments, bid interval 1310 may be implemented in computer-accessible memory coupled to a computer. In certain further embodiments, the bid interval 1310 is implemented as a table that includes the bid item 1312, the bid time interval set 1318, the bid price 1316, and the bid quantity 1316-1 as entries in the table. You can In another particular further embodiment, the bid interval 1310 includes a bid item 1312 and a bid time interval set 1318.
, A bid price 1316, and a bid quantity 1316-1 can be implemented as an instance of a record structure that includes a pointer to an instance of the record structure. For certain other further embodiments, the bid interval 1310 includes references to object class instances of bid item 1312, bid time interval set 1318, bid price 1316, and bid quantity 1316-1. It can be implemented as an object instance. For certain further embodiments, the bid interval 1310 is an object that contains pointer references to object class instances of bid item 1312, bid time interval set 1318, bid price 1316, and bid quantity 1316-1. -Can be implemented as an instance. In another particular further embodiment, the bid interval 1310 includes an object class of a bid item 1312, a bid time interval set 1318, a bid price 1316 and a bid quantity 1316-1.
It can be implemented as an object instance that contains a handle reference to the instance.

It should be noted that, in a particular embodiment, the bid interval set 1300 is, as part thereof,
Bidding intervals 1310 and 1320 may be included that include different short-lived indistinguishable items. In certain other embodiments, a bid interval set may have as part of it added bid intervals for non-distinguishable, non-distinguishable items.

For certain other embodiments, as described above, the bid interval 1310 may include a bid time interval 1314 and a bid price without including an explicit reference to a short-lived indistinguishable bid item. 1316 and can be included.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 19D illustrates bid time intervals 1314-1 and 1314-2, according to certain embodiments.
13B shows a bid time interval set 1318 including.

It should be noted that for certain embodiments, the bid time interval set 1318 may be implemented in computer-accessible memory coupled to a computer.
For certain further embodiments, bid-time interval set 1318 may be implemented as a table that includes bid-time intervals 1314-1 and 1314-2 as entries in the table. For certain other additional embodiments, the bid time interval set 1318 may be implemented as an instance of a record structure that includes a pointer to an instance of the record structure of bid time intervals 1314-1 and 1314-2. In another particular further embodiment, the bid time interval set 1318 is an object class of the bid time intervals 1314-1 and 1314-2.
It can be implemented as an object instance that contains a reference to the instance. For certain further embodiments, the bid time interval set 1318 may be implemented as an object instance containing pointer references to the object class instances of bid time intervals 1314-1 and 1314-2. In another particular further embodiment, the bid-time interval set 13
18 can be implemented as an object instance containing handle references to the object class instances of bid time intervals 1314-1 and 1314-2.

For certain embodiments, bid-time interval set 1318 may include, as part thereof, one bid-time interval 1314-1. For certain embodiments, the bid time interval set 1318 may include more than two bid time intervals as part thereof.

In certain embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 20A includes a short-lived indistinguishable product 1312, a bid time interval 1314, a bid price 1316, a bid quantity 1316-1, and a committed flag 1316-2 according to certain embodiments. Bid interval 1310 is shown.

It should be noted that, for certain embodiments, bid interval 1310 may be implemented in computer-accessible memory coupled to a computer. For certain further embodiments, the bid interval 1310 includes a bid item 1312, a bid time interval 1314, a bid price 1316, a bid quantity 1316-1, and a committed flag 1316-2 entry in the table. Can be implemented as a table. In another particular further embodiment, the bid interval 1310 includes a record structure of a bid item 1312, a bid time interval 1314, a bid price 1316, a bid quantity 1316-1, and a committed flag 1316-2. Can be implemented as an instance of a record structure containing a pointer to an instance of. In another particular further embodiment, the bid interval 1310 includes a bid item 1312, a bid time interval 1314, and
It can be implemented as an object instance containing a reference to the object class instance with bid price 1316, bid quantity 1316-1 and committed flag 1316-2. For certain further embodiments, the bid interval 1310 includes a bid item 1312, a bid time interval 1314, a bid price 1316, and a bid quantity.
It can be implemented as an object instance that contains pointer references to the object class instance with 1316-1 and committed flag 1316-2. In certain other further embodiments, the bid interval 1310 may include the bid item 13
It can be implemented as an object instance containing a handle reference to an object class instance with 12, a bid time interval 1314, a bid price 1316, a bid quantity 1316-1 and a committed flag 1316-2.

Note that in a particular embodiment, the bid interval set 1300 is, as part thereof,
Bidding intervals 1310 and 1320 may be included that include different short-lived indistinguishable items. In certain other embodiments, a bid interval set may have as part of it added bid intervals for non-distinguishable, non-distinguishable items.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 20B does not include an explicit reference to short-lived indistinguishable items, according to certain embodiments, bid time interval 1314, bid price 1316, and bid quantity 13
16-1 illustrates a bid interval 1310 that can include 16-1 and a committed flag 1316-2.

It should be noted that, for certain embodiments, bid interval 1310 may be implemented in computer-accessible memory coupled to a computer. For certain further embodiments, the bid interval 1310 includes a bid item 1312, a bid time interval 1314, a bid price 1316, a bid quantity 1316-1, and a committed flag 1316-2 entry in the table. Can be implemented as a table. In another particular further embodiment, the bid interval 1310 includes a record structure of a bid item 1312, a bid time interval 1314, a bid price 1316, a bid quantity 1316-1, and a committed flag 1316-2. Can be implemented as an instance of a record structure containing a pointer to an instance of. In another particular further embodiment, the bid interval 1310 includes a bid item 1312, a bid time interval 1314, and
It can be implemented as an object instance containing a reference to the object class instance with bid price 1316, bid quantity 1316-1 and committed flag 1316-2. For certain further embodiments, the bid interval 1310 includes a bid item 1312, a bid time interval 1314, a bid price 1316, and a bid quantity.
It can be implemented as an object instance that contains pointer references to the object class instance with 1316-1 and committed flag 1316-2. In certain other further embodiments, the bid interval 1310 may include the bid item 13
It can be implemented as an object instance containing a handle reference to an object class instance of 12, a bid time interval 1314, a bid price 1316, a bid quantity 1316-1 and a committed flag 1316-2.

It should be noted that, in a particular embodiment, the bid interval set 1300 is
Bid intervals 1310 and 1320 may be included that do not have an explicit bid item designation 1312 but include different short-lived indistinguishable items that are inferred by being included in a separate table, linked list, or the like. In certain other embodiments, the bid interval set does not have an explicit bid item designation 1312 as part of it, but
It is possible to add bid intervals for non-distinguishable products that are inferred by being included in separate tables, linked lists, etc.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 20C illustrates a short-lived indistinguishable product 1312, a bid time interval set 1318, a bid price 1316, a bid quantity 1316-1, and a committed flag 1316-2, according to certain embodiments. A bid interval 1310 is shown including.

It should be noted that, for certain embodiments, bid interval 1310 may be implemented in computer-accessible memory coupled to a computer. For certain further embodiments, the bid interval 1310 may include a bid item 1312, a bid time interval set 1318, a bid price 1316, a bid quantity 1316-1, and a committed flag 1316.
-2 and can be implemented as a table containing as entries in the table.
In another particular further embodiment, the bid interval 1310 is a record of a bid item 1312, a bid time interval set 1318, a bid price 1316, a bid quantity 1316-1, and a committed flag 1316-2. It can be implemented as an instance of a record structure that contains a pointer to an instance of the structure. In another particular further embodiment, the bid interval 1310 is an object of a bid item 1312, a bid time interval set 1318, a bid price 1316, a bid quantity 1316-1, and a committed flag 1316-2. It can be implemented as an object instance containing a reference to a class instance. In certain further embodiments, the bid interval 1310 includes a bid item 1312, a bid time interval set 1318, and a bid price.
It can be implemented as an object instance containing a pointer reference to the object class instance with 1316, bid quantity 1316-1 and committed flag 1316-2. In another particular further embodiment, the bidding interval 13
10 is a bid product 1312, a bid time interval set 1318, a bid price 1316,
It can be implemented as an object instance containing a handle reference to the object class instance with bid quantity 1316-1 and committed flag 1316-2.

It should be noted that, in a particular embodiment, the bid interval set 1300 is, as part thereof,
Bidding intervals 1310 and 1320 may be included that include different short-lived indistinguishable items. In certain other embodiments, a bid interval set may have as part of it added bid intervals for non-distinguishable, non-distinguishable items.

For certain other embodiments, as described above, bid interval 1310 may include bid time interval 1314, or bid price 1316, without including an explicit reference to a short-lived indistinguishable item. Can be included.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 21A illustrates operation 2032 of FIG. 4B performing the steps of creating a first knowledge interval of a knowledge interval set based on a first committed bid interval of the bid interval set, according to certain embodiments. A detailed flow chart is shown.

Arrow 2470 shows the flow of execution from start operation 2032 to operation 2472. Operation 2472 is
Performing a step of creating a first knowledge interval of the knowledge interval set based on the first committed bid interval of the bid interval set. Arrow 2474 indicates execution from action 2472 to action 2476. Operation 2476 ends the operation of this flow chart.

FIG. 21B further acts to perform the step of creating a first knowledge interval of the knowledge interval set based on the first committed bid interval of the bid interval set, according to certain embodiments. 2 shows a detailed flow chart of the 2472.

Arrow 2490 shows the flow of execution from start operation 2472 to operation 2492. Behavior 2492
Performing the step of setting the quantity of the first knowledge interval by the first bid quantity of the first committed bid interval. Arrows 2494 indicate actions 2492 to 24
Shows execution to 96. Act 2496 performs the step of setting the first time interval of the first knowledge interval by the first bid time interval of the first committed bid interval. Arrow 2498 indicates execution from act 2496 to act 2500. Operation 2500 performs the step of setting the first cost of the first knowledge interval by the first bid price of the first committed bid interval.
Arrow 2502 indicates execution from action 2500 to action 2504. Operation 2504 ends the operation of this flow chart.

The operations associated with setting the quantity by the second quantity may include, as part thereof, a direct allocation operation in certain embodiments. For certain embodiments, the set operation may further include, as part thereof, the addition of increments beyond the quantity specified herein. In a particular embodiment, the setting operation is
In addition, as part of it, it may include subtraction of decrements beyond the quantity specified here. The terms of such increments and decrements can be a function of the quantities specified here, such as local taxes, tariffs, and other charges. These can be changed over time.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system supporting at least the steps of planning the operation of the device. Supported by steps.

FIG. 22A shows an equipment usage set 1 including equipment usage entries 1410, according to certain embodiments.
Shows 400.

It should be noted that, for particular embodiments, equipment usage set 1400 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, equipment usage set 1400 may be implemented as a table that includes equipment usage entries 1410 as entries in the table. For certain other additional embodiments, the equipment usage set 1400 may be implemented as an instance of a record structure that includes a pointer to an instance of the record structure of the equipment usage entry 1410. For certain other additional embodiments, the equipment usage set 1400 may be implemented as an object instance that includes a reference to the object class instance of the equipment usage entry 1410. For certain further embodiments, the equipment usage set 1400 may be implemented as an object instance that contains a pointer reference to the object class instance of the equipment usage entry 1410. For certain other further embodiments, the equipment usage set 1400 may be implemented as an object instance that includes a handle reference to the object class instance of the equipment usage entry 1410.

FIG. 22B illustrates a facility usage set 1 that does not include a facility usage entry, according to certain embodiments.
Shows 400.

It should be noted that, for certain embodiments, equipment usage set 1400 may be implemented in computer-accessible memory coupled to a computer. For certain further embodiments, the equipment usage set 1400 may be implemented as a table that does not include entries for equipment usage entries in the table. For certain other further embodiments, the equipment usage set 1400 may be implemented as a record structure instance that does not include a pointer to the record structure instance of the equipment usage entry. For certain further embodiments, the equipment usage set 1400 may be implemented as a record structure instance that includes a null pointer to the record structure instance of the equipment usage entry. In another particular further embodiment, the equipment usage set 14
00 can be implemented as an object instance that does not include a reference to the object class instance of the equipment usage entry. In another particular further embodiment, the equipment usage set 1400 can be implemented as an object instance that contains a null reference to the object class instance of the equipment usage entry. In another particular further embodiment, the equipment usage set 14
00 can be implemented as an object instance that does not include a pointer reference to the object class instance of the equipment usage entry. For certain other additional embodiments, the equipment usage set 1400 may be implemented as an object instance that includes a null pointer reference to the object class instance of the equipment usage entry. In another particular further embodiment, the equipment usage set 1400 can be implemented as an object instance that does not include a handle reference to the object class instance of the equipment usage entry. In another particular further embodiment, the equipment usage set 1400 may be implemented as an object instance that contains a null handle reference to the object class instance of the equipment usage entry.

FIG. 22C illustrates an equipment usage set 1400 that includes equipment usage entries 1410, 1420, according to certain embodiments.

It should be noted that, for certain embodiments, equipment usage set 1400 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, equipment usage set 1400 may be implemented as a table that includes equipment usage entries 1410 and 1420 as entries in the table. For certain other further embodiments, the equipment usage set 1400 may be implemented as an instance of a record structure that includes a pointer to an instance of the record structure for equipment usage entries 1410 and 1420. In another particular further embodiment, the equipment usage set 14
00 may be implemented as an object instance that contains references to the object class instances of equipment usage entries 1410 and 1420. For certain further embodiments, the equipment usage set 1400 includes equipment usage entries 1410 and 14
It can be implemented as an object instance containing pointer references to 20 object class instances. In another particular further embodiment, the equipment usage set 1400 may be implemented as an object instance that contains handle references to the object class instances of the equipment usage entries 1410 and 1420. In another particular further embodiment, the equipment usage set 14
00 may be implemented as a record structure instance that contains a pointer to a linked pointer list of record structure instances for equipment usage entries 1410 and 1420. In a similar manner, 1400 object instances can utilize references, pointer references, and handle references to instances of objects that form a linked list of references that include equipment usage entries 1410 and 1420.

For certain embodiments, more than two equipment usage entries may be included in the equipment usage set 1400. For certain embodiments, the equipment usage set may be implemented as a set of inference clauses, where the equipment usage entry may then be represented as a set of inference clauses.

FIG. 22D illustrates a second equipment usage set 1402 that includes equipment usage entries 1430 and 1440, according to certain embodiments.

It should be noted that, for particular embodiments, equipment usage set 1402 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, equipment usage set 1402 may be implemented as a table that includes equipment usage entries 1430 and 1440 as entries in the table. For certain other additional embodiments, the equipment usage set 1402 may be implemented as an instance of a record structure that includes a pointer to an instance of the record structure of the equipment usage entries 1430 and 1440. In another particular further embodiment, the equipment usage set 14
02 may be implemented as an object instance that contains references to the object class instances of equipment usage entries 1430 and 1440. In certain further embodiments, the equipment usage set 1402 includes equipment usage entries 1430 and 14
It can be implemented as an object instance that contains pointer references to 40 object class instances. In another particular further embodiment, the equipment usage set 1402 may be implemented as an object instance that contains a handle reference to the object class instance of the equipment usage entries 1430 and 1440. In another particular further embodiment, the equipment usage set 14
02 can be implemented as a record structure instance that contains a pointer to a linked pointer list of record structure instances for equipment usage entries 1430 and 1440. In a similar manner, 1402 object instances can utilize references, pointer references, and handle references to instances of objects that form a linked list of references that include equipment usage entries 1430 and 1440.

For certain embodiments, more than two equipment usage entries may be included in the equipment usage set 1402. In a particular embodiment, only one equipment usage entry,
It can be included in the equipment usage set 1402. For certain embodiments, the equipment usage entry may not be included in the equipment usage set 1402. For certain embodiments, the equipment usage set may be implemented as a set of inference clauses, where the equipment usage entry may then be represented as a set of inference clauses. For certain embodiments, more than two equipment usage sets may be implemented.

FIG. 23A is a diagram illustrating a facility usage entry 1410 that includes a short-lived indistinguishable product 1412, a need schedule 1416, and a due date 1414, according to a specific embodiment.

It should be noted that, for certain embodiments, the equipment usage entry 1410 may be implemented in computer accessible memory coupled to a computer. In certain further embodiments, the equipment usage entry 1410 includes a product 1412 and a need schedule.
1416 and the delivery date 1414 can be implemented as a table including the entries in the table. In another particular further embodiment, the equipment usage entry 1410 may be implemented as an instance of a record structure that includes pointers to the record structure instance of the item 1412, the need schedule 1416, and the due date 1414. In another particular further embodiment, the equipment usage entry 1410 may be implemented as an object instance that includes a reference to an object class instance of a product 1412, a need schedule 1416, and a due date 1414. For certain further embodiments, the equipment usage entry 1410 may be implemented as an object instance that includes pointer references to object class instances of goods 1412, need schedule 1416, and due date 1414. In certain other further embodiments, the equipment usage entry 1410 may be implemented as an object instance that includes a handle reference to an object class instance of a product 1412, a need schedule 1416, and a due date 1414. .

Note that for certain embodiments, the equipment usage entry set 1200 may include, as part thereof, equipment usage entries 1410 and 1220 that include indistinguishable goods with different short lives. In certain other embodiments, the equipment usage entry set may have as part of it added equipment usage entries for non-distinguishable merchandise items.

FIG. 23B illustrates a facility usage entry 1410 that may include a need schedule 1416 and a due date 1414, without an explicit reference to a short-lived indistinguishable product, according to certain embodiments. There is.

It should be noted that, for certain embodiments, the equipment usage entry 1410 may be implemented in computer accessible memory coupled to a computer. In certain further embodiments, the equipment usage entry 1410 includes a product 1412 and a need schedule.
1416 and the delivery date 1414 can be implemented as a table including the entries in the table. In another particular further embodiment, the equipment usage entry 1410 may be implemented as an instance of a record structure that includes pointers to the record structure instance of the item 1412, the need schedule 1416, and the due date 1414. In another particular further embodiment, the equipment usage entry 1410 may be implemented as an object instance that includes a reference to an object class instance of a product 1412, a need schedule 1416, and a due date 1414. For certain further embodiments, the equipment usage entry 1410 may be implemented as an object instance that includes pointer references to object class instances of goods 1412, need schedule 1416, and due date 1414. In certain other further embodiments, the equipment usage entry 1410 may be implemented as an object instance that includes a handle reference to an object class instance of a product 1412, a need schedule 1416, and a due date 1414. .

It should be noted that, in the case of the specific embodiment, the equipment use entry set 1200 does not have an explicit product designation 1412 as a part of it, but is presumed to be included in a separate table, linked list, or the like. , Facility usage entries 1410 and 1220 containing different short-lived indistinguishable products. In certain other embodiments, the equipment usage entry set does not have an explicit product designation 1412 as part of it, but has a short life, which is inferred by being included in a separate table, linked list, etc. You can add equipment usage entries for products that are not indistinguishable products.

FIG. 23C illustrates a facility usage entry 1410 that includes a short-lived indistinguishable product 1412, a need schedule set 1418, and a due date 1414, according to certain embodiments.

It should be noted that, for certain embodiments, the equipment usage entry 1410 may be implemented in computer accessible memory coupled to a computer. For certain further embodiments, the equipment usage entry 1410 may be implemented as a table that includes a product 1412, a need schedule set 1418, and a due date 1414 as entries in the table. In another particular further embodiment, the equipment usage entry 1410 may be implemented as an instance of a record structure that includes pointers to the record structure instance of the item 1412, the need schedule set 1418, and the due date 1414. . In another particular further embodiment, the equipment usage entry 1410 can be implemented as an object instance that includes a reference to an object class instance of a product 1412, a need schedule set 1418, and a due date 1414. . In a particular further embodiment, the equipment usage entry 1410 is the item 14
12, need schedule set 1418, and due date 1414 can be implemented as an object instance containing a pointer reference to an object class instance. In another particular further embodiment, the equipment usage entry 1410 may be implemented as an object instance containing a handle reference to an object class instance of a product 1412, a need schedule set 1418, and a due date 1414. it can.

Note that for certain embodiments, the equipment usage entry set 1200 may include, as part thereof, equipment usage entries 1410 and 1220 that include indistinguishable goods with different short lives. In certain other embodiments, the equipment usage entry set may have as part of it added equipment usage entries for non-distinguishable merchandise items.

For certain other embodiments, as described above, the equipment usage entry 1410 does not include an explicit reference to a short-lived indistinguishable merchandise and a need schedule.
1416 and the delivery date 1414 can be included.

FIG. 23D illustrates a need schedule set 1418 that includes need schedules 1414-1 and 1414-2, according to certain embodiments.

It should be noted that, for certain embodiments, need schedule set 1418 may be implemented in computer-accessible memory coupled to a computer. For certain further embodiments, the need schedule set 1418 is a need schedule.
It can be implemented as a table containing 1414-1 and 1414-2 as entries in the table. For certain other additional embodiments, the need schedule set 1418 can be implemented as an instance of a record structure that includes a pointer to an instance of the record structure of the need schedules 1414-1 and 1414-2. For certain other further embodiments, the need schedule set 1418 can be implemented as an object instance that includes a reference to an object class instance of the need schedule 1414-1 and 1414-2. For certain further embodiments, the need schedule set 1418 includes the need schedules 1414-1 and 1414.
It can be implemented as an object instance that contains a pointer reference to the 14-2 object class instance. In another particular further embodiment, the need schedule set 1418 includes the need schedules 1414-1 and 1414-2.
Can be implemented as an object instance containing a handle reference to the object class instance of.

For certain embodiments, need schedule set 1418 can include, as part thereof, one instance of need schedule 1414-1. For certain embodiments, need schedule set 1418 can include more than two need schedules as part thereof.

FIG. 24A illustrates a product need including a short life indistinguishable product 1512, a need time interval 1514, a cost limit 1516, and a quantity 1516-1 according to certain embodiments.
1510 is shown.

It should be noted that, for certain embodiments, merchandise need 1510 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, the commodity need 1510 may be implemented as a table that includes the commodity 1512, a need time interval 1514, a cost limit 1516, and a quantity 1516-1 as entries in the table. it can. In another particular further embodiment, the commodity need 15
10 is product 1512, need time interval 1514, cost limit 1516, quantity
It can be implemented as an instance of a record structure that contains a pointer to an instance of the record structure with 1516-1. In another particular further embodiment,
Product need 1510 is product 1512, need time interval 1514, and cost limit
It can be implemented as an object instance containing a reference to an object class instance of 1516 and quantity 1516-1. In a particular further embodiment, the commodity need 1510 is an object 1512, a need time interval 1514, a cost bound 1516, and an object object containing a pointer reference to an object class instance of quantity 1516-1. Can be implemented as an instance. In another particular further embodiment, the commodity need 1510 includes an object 1512, a need time interval 1514, a cost limit 1516, and a quantity 1516-1.
It can be implemented as an object instance that contains a handle reference to a class instance.

It should be noted that for certain embodiments, the product need set 1500 may include, as part thereof, product needs 1510 and 1520, which include different short-lived indistinguishable products. In certain other embodiments, the commodity need set may, as part thereof, add commodity needs for non-distinguishable merchandise with a short life.

FIG. 24B does not include an explicit reference to short-lived indistinguishable merchandise, need time interval 1514, and cost limit 1516, according to certain embodiments, and quantity.
It illustrates a product need 1510 that can include only 1516-1. Such an embodiment may only check if sufficient short-lived, indistinguishable goods are available to perform the tasks of the facility.

It should be noted that, for certain embodiments, merchandise need 1510 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, merchandise need 1510 may be implemented as a table that includes merchandise 1512 and quantity 1516-1 as entries in the table. In another particular further embodiment, the commodity need 1510 can be implemented as an instance of a record structure that includes a pointer to an instance of the record structure for the commodity 1512 and quantity 1516-1. In another particular further embodiment, the commodity need 1510 can be implemented as an object instance containing a reference to an object class instance of the commodity 1512 and quantity 1516-1. In certain further embodiments,
Commodity need 1510 may be implemented as an object instance that includes a pointer reference to a commodities 1512 and an object class instance of quantity 1516-1. In another particular further embodiment, the commodity need 1510 is a commodity 1512.
And a quantity 1516-1 can be implemented as an object instance containing a handle reference to an object class instance.

It should be noted that, in the particular embodiment, the commodity need set 1500 does not have an explicit commodity designation 1512 as part of it, but is inferred by being included in a separate table, linked list, etc. Product need 1510, including indistinguishable products with different short lives
And 1520 can be included. In another particular embodiment, the commodity need set is
As part of this, it is possible to add a product need for a product that does not have an explicit product designation 1512 but is not a product with a short life and cannot be distinguished, which is estimated by being included in a separate table, linked list, etc. it can.

FIG. 24C illustrates a product need 1510 that includes a short-lived indistinguishable product 1512, a need time interval set 1518, a cost limit 1516, and a quantity 1516-1 according to certain embodiments. There is.

It should be noted that, for certain embodiments, merchandise need 1510 may be implemented in a computer-accessible memory coupled to a computer. In a particular further embodiment, the commodity need 1510 includes a commodity 1512 and a need time interval set 15.
18, a cost limit 1516, and a quantity 1516-1 can be implemented as a table containing entries in the table. In another particular further embodiment, product need 1510 includes product 1512, need time interval set 1518, and cost limit 1516.
Can be implemented as an instance of a record structure that includes a pointer to an instance of the record structure with a quantity of 1516-1. In another particular further embodiment, the commodity need 1510 includes a reference to an object class instance of commodity 1512, need time interval set 1518, cost limit 1516, and quantity 1516-1. It can be implemented as an object instance. In a particular further embodiment, a commodity need 1510 is an object class of a commodity 1512, a need time interval set 1518, a cost limit 1516, and a quantity 1516-1.
It can be implemented as an object instance that contains a pointer reference to the instance. In another particular further embodiment, commodity need 1510 includes commodity 1512, need time interval set 1518, cost limit 1516, and quantity 1516.
It can be implemented as an object instance containing a handle reference to an object class instance with -1.

It should be noted that for certain embodiments, the product need set 1500 may include, as part thereof, product needs 1510 and 1520 that include different short-lived indistinguishable products. In certain other embodiments, the commodity need set may, as part thereof, add commodity needs for non-distinguishable merchandise with a short life.

For certain other embodiments, as described above, the commodity need 1510 does not include an explicit reference to a short-lived, indistinguishable bid item, and the need time interval 1514 includes: Cost limits 1516 can be included.

FIG. 24D shows a need time interval 1514-1 and 1514-according to a particular embodiment.
A need time interval set 1518 including two is shown.

It should be noted that for certain embodiments, the need time interval set 1518 may be implemented in computer accessible memory coupled to a computer. For certain further embodiments, the need time interval set 1518 may be implemented as a table that includes the need time intervals 1514-1 and 1514-2 as entries in the table. In another particular further embodiment, the need time interval set 1518 may be implemented as an instance of a record structure that includes a pointer to an instance of the record structure of the need time intervals 1514-1 and 1514-2. it can. In certain other further embodiments, the need time
Interval set 1518 may be implemented as an object instance containing references to the object class instances of need time intervals 1514-1 and 1514-2. For certain further embodiments, the need time interval set 1518 may be implemented as an object instance that contains pointer references to the object class instances of the need time intervals 1514-1 and 1514-2. . In another particular further embodiment, the need time interval set 1518 is implemented as an object instance containing handle references to the object class instances of the need time intervals 1514-1 and 1514-2. You can

For certain embodiments, the need time interval set 1518 can include one need time interval 1514-1 as part thereof. For certain embodiments, the need time interval set 1518 may include, as part thereof, more than two need time intervals.

FIG. 25A illustrates a commodity need set 1500 that includes a commodity need 1510, according to certain embodiments.
Is shown.

It should be noted that for certain embodiments, the commodity need set 1500 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, item need set 1500 may be implemented as a table that includes item needs 1510 as entries in the table. For certain other additional embodiments, the product need set 1500 may be implemented as an instance of a record structure that includes a pointer to an instance of the record structure for the product need 1510. In another particular further embodiment, the commodity need set 1500 includes a commodity need 1510.
Can be implemented as an object instance containing a reference to an object class instance of For certain further embodiments, commodity need set 1500 may be implemented as an object instance that includes a pointer reference to an object class instance of commodity need 1510.
In another particular further embodiment, the product need set 1500 includes an object class that includes a handle reference to an object class instance of the product class 1510.
Can be implemented as an instance.

FIG. 25B illustrates a product need set 1500 that does not include product needs, according to certain embodiments.
Is shown.

It should be noted that, for certain embodiments, commodity need set 1500 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, product need set 1500 may be implemented as a table that does not include product need entries in the table. For certain other further embodiments, the product need set 1500 may be implemented as a record structure instance that does not include a pointer to a record structure instance of a product need. For certain further embodiments, the product need set 1500 may be implemented as a record structure instance that includes a null pointer to the record structure instance of the product need. For certain other further embodiments, the product need set 1500 may be implemented as an object instance that does not include a reference to a product need object class instance. For certain other further embodiments, the product need set 1500 may be implemented as an object instance that includes a null reference to the product need object class instance. In another particular further embodiment, the commodity need set 1500 can be implemented as an object instance that does not include a pointer reference to the commodity need object class instance. For certain other further embodiments, the product need set 1500 may be implemented as an object instance that includes a null pointer reference to a product need object class instance. In another particular further embodiment, the product need set 1500 can be implemented as an object instance that does not include a handle reference to the product need object class instance. In another particular further embodiment, the commodity need set 1500 can be implemented as an object instance that includes a null handle reference to the commodity need object class instance.

FIG. 25C is a diagram illustrating a merchandise need set 1500 including merchandise needs 1510, 1520, according to a particular embodiment.

It should be noted that, for particular embodiments, commodity need set 1500 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, product need set 1500 may be implemented as a table that includes product needs 1510 and 1520 as entries in the table. For certain other additional embodiments, the commodity need set 1500 may be implemented as an instance of a record structure that includes a pointer to an instance of the record structure for commodity needs 1510 and 1520. For certain other further embodiments, the product need set 1500 may be implemented as an object instance that includes references to object class instances of product needs 1510 and 1520. For certain further embodiments, commodity need set 1500 may be implemented as an object instance that includes pointer references to object class instances of commodity needs 1510 and 1520. In another particular further embodiment, the product need set 1500 can be implemented as an object instance containing handle references to the object class instances of the product needs 1510 and 1520. In another particular further embodiment, the commodity need set 1500 is a commodity need set.
It can be implemented as a record structure instance that contains a pointer to a linked pointer list of 1510 and 1520 record structure instances. In a similar manner, 1500 object instances can utilize references, pointer references, and handle references to instances of objects that form a linked list of references that include commodity needs 1510 and 1520.

For certain embodiments, more than two commodity needs may be included in the commodity need set 1500. For certain embodiments, the commodity need set may be implemented as a set of inference clauses, where the commodity need may then be represented as a set of inference clauses.

FIG. 25D illustrates a second commodity need set 1502 that includes commodity needs 1530 and 1540, according to certain embodiments.

It should be noted that for certain embodiments, the commodity need set 1502 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, product need set 1502 may be implemented as a table that includes product needs 1530 and 1540 as entries in the table. For certain other additional embodiments, the product need set 1502 may be implemented as an instance of a record structure that includes pointers to the record structure instances of the product needs 1530 and 1540. For certain other further embodiments, the product need set 1502 may be implemented as an object instance that includes references to object class instances of product needs 1530 and 1540. For certain further embodiments, product need set 1502 may be implemented as an object instance that contains pointer references to object class instances of product needs 1530 and 1540. In another particular further embodiment, the product need set 1502 can be implemented as an object instance that contains handle references to the object class instances of the product needs 1530 and 1540. In another particular further embodiment, the commodity need set 1502 is a commodity need set.
It can be implemented as a record structure instance that contains a pointer to a linked pointer list of 1530 and 1540 record structure instances. In a similar manner, 1502 object instances can utilize references, pointer references, and handle references to instances of objects that form a linked list of references that include commodity needs 1530 and 1540.

For certain embodiments, more than two merchandise needs may be included in merchandise need set 1502. For certain embodiments, only one item need may be included in item need set 1502. For certain embodiments, merchandise needs may not be included in merchandise need set 1502. For certain embodiments, the commodity need set may be implemented as a set of inference clauses, where the commodity need may then be represented as a set of inference clauses. For certain embodiments, more than two commodity need sets may be implemented.

FIG. 26A shows a detailed flow chart of operation 2004 of FIG. 4A further performing the step of determining the need for short-lived indistinguishable goods over a planning time interval, according to certain embodiments. ing.

An arrow 2510 shows the flow of execution from the start operation 2004 to the operation 2512. Operation 2512
Perform a step of examining a set of equipment usage, each consisting of equipment usage entries, including delivery dates and need schedules, to create short-lived indistinguishable merchandise needs across the planning time interval, including quantity . Arrow 2514
Shows the execution from act 2512 to act 2516. Operation 2516 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 26B illustrates a first set of bid intervals including a first bid quantity as a bid quantity, a first bid price as a bid price, and a first time interval as a bid time interval, according to a particular embodiment. A detailed flow chart of operation 2452 of FIG. 17B performing the steps of placing a first bid of a first bid quantity at a first bid price for a first time interval to create a single bid. Is shown.

Arrow 2530 shows the flow of execution from start operation 2452 to operation 2532. Operation 2532
Based on the need for short-lived indistinguishable products over a planning time interval, including quantity and cost limits, a first bid quantity as a bid quantity, a first bid price as a bid price, and a bid time interval as a bid time interval. Perform a step of placing a first bid of a first bid quantity at a first bid price for the first time interval to create a first bid of a bid interval set that includes a first time interval To do. Arrow 2534 indicates execution from act 2532 to act 2536. Operation 2536
This ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 27A further illustrates exploring a knowledge interval set based on the need for short-lived indistinguishable products over a planning time interval to create a device operation schedule, according to certain embodiments. 26B illustrates a detailed flow chart of the operation 2512 of FIG. 26A to be performed.

Arrow 2550 shows the flow of execution from start operation 2512 to operation 2552. Operation 2552
A step of determining a facility usage plan including a facility usage item including a start time, an action belonging to a behavior set including a stop action, and a throttle action and a start time is executed. Arrow 2554 indicates execution from action 2552 to action 2556. Operation 2556 ends the operation of this flow chart.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 27B illustrates a short-lived indistinguishable product based on a knowledge interval set comprising at least one knowledge interval of a short-lived indistinguishable product at a time interval, including costs, according to certain embodiments. 7 shows a flow chart for performing a method of controlling a device that consumes.

Operation 2570 initiates the operation of this flow chart. Arrow 2572 shows the flow of execution from operation 2570 to operation 2574. Act 2574 performs the steps of operating the device based on the device action schedule. Arrow 2576, movement 25
Shows the execution from 74 to operation 2578. Operation 2578 ends the operation of this flow chart.

The arrow 2580 shows the flow of execution from the start operation 2570 to the operation 2000. Operation 2000
Perform the operations described with respect to FIG. 4A. Arrow 2582 indicates execution from action 2000 to action 2578. Operation 2578 ends the operation of this flow chart.

For certain embodiments, these operations are performed on at least one computer in a computing system that supports at least planning the operation of the device and operating the device based on the plan. Supported by program steps residing in the combined computer-readable memory of the.

FIG. 28A illustrates a facility usage plan 160 including a facility usage item 1610, according to certain embodiments.
Indicates 0.

It should be noted that, for particular embodiments, equipment usage plan 1600 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, equipment usage plan 1600 may be implemented as a table that includes equipment usage items 1610 as entries in the table. For certain other additional embodiments, the equipment usage plan 1600 may be implemented as an instance of a record structure that includes a pointer to an instance of the equipment structure 1610 record structure. For certain other further embodiments, the equipment usage plan 1600 may be implemented as an object instance that includes a reference to an object usage instance 1610 object class instance. For certain further embodiments, equipment usage plan 1600 may be implemented as an object instance that includes a pointer reference to an object class instance of equipment usage item 1610. For certain other further embodiments, the equipment usage plan 1600 may be implemented as an object instance that includes a handle reference to an object class instance of the equipment usage item 1610.

FIG. 28B illustrates a facility usage plan 160 that does not include a facility usage item, according to certain embodiments.
Indicates 0.

It should be noted that, for certain embodiments, equipment usage plan 1600 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, the equipment usage plan 1600 may be implemented as a table that does not include entries for equipment usage items in the table. For certain other further embodiments, the equipment usage plan 1600 may be implemented as a record structure instance that does not include a pointer to a record structure instance of the equipment usage item.
For certain further embodiments, the equipment usage plan 1600 may be implemented as a record structure instance that includes a null pointer to a record structure instance of the equipment usage item. In another particular further embodiment, a facility usage plan 1600
Can be implemented as an object instance that does not include a reference to the equipment usage item object class instance. In certain other further embodiments, the equipment usage plan 1600 can be implemented as an object instance that includes a null reference to the object class instance of the equipment usage item. In another particular further embodiment, the equipment usage plan 1600 is
It can be implemented as an object instance that does not include a pointer reference to the object class instance of the equipment usage item. For certain other further embodiments, the equipment usage plan 1600 may be implemented as an object instance that includes a null pointer reference to the object class instance of the equipment usage item. For certain other further embodiments, the equipment usage plan 1600 may be implemented as an object instance that does not include a handle reference to the equipment usage item object class instance.
For certain other additional embodiments, the equipment usage plan 1600 may be implemented as an object instance that includes a null handle reference to an object usage object class instance.

FIG. 28C illustrates an equipment usage plan 1600 that includes equipment usage items 1610, 1620, according to certain embodiments.

It should be noted that for certain embodiments, the equipment usage plan 1600 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, the equipment usage plan 1600 may be implemented as a table that includes equipment usage items 1610 and 1620 as entries in the table. For certain other further embodiments, the equipment usage plan 1600 may be implemented as an instance of a record structure that includes a pointer to an instance of the record structure for equipment usage items 1610 and 1620. In another particular further embodiment, the equipment usage plan 14
00 may be implemented as an object instance that contains references to the object class instances of equipment usage items 1610 and 1620. In a particular further embodiment, the equipment usage plan 1600 includes an object object containing pointer references to object class instances of equipment usage items 1610 and 1620.
Can be implemented as an instance. In another particular further embodiment,
The equipment usage plan 1600 can be implemented as an object instance that includes handle references to the object class instances of the equipment usage items 1610 and 1620. In another particular further embodiment, the equipment usage plan 1600 is
It can be implemented as a record structure instance containing pointers to a linked pointer list of record structure instances for equipment usage items 1610 and 1620. In a similar manner, the 1600 object instance will have a facility usage item 1610 and
References, pointer references, and handle references to instances of objects that form a linked list of references including 1620 are available.

For certain embodiments, more than two equipment usage items can be included in the equipment usage plan 1600. For certain embodiments, the equipment usage plan may be implemented as a set of inference clauses, where the equipment usage items may then be represented as a set of inference clauses.

FIG. 28D illustrates a second equipment usage plan 1602 that includes equipment usage items 1630 and 1640, according to certain embodiments.

It should be noted that, for particular embodiments, equipment usage plan 1602 may be implemented in a computer-accessible memory coupled to a computer. For certain further embodiments, the equipment usage plan 1602 may be implemented as a table that includes equipment usage items 1630 and 1640 as entries in the table. For certain other further embodiments, the equipment usage plan 1602 may be implemented as an instance of a record structure that includes pointers to instances of the record structure for equipment usage items 1630 and 1640. In another particular further embodiment, the equipment usage plan 16
02 can be implemented as an object instance that contains references to the object class instances of equipment usage items 1630 and 1640. In certain further embodiments, the equipment usage plan 1602 includes an object object containing pointer references to object class instances of equipment usage items 1630 and 1640.
Can be implemented as an instance. In another particular further embodiment,
The equipment usage plan 1602 can be implemented as an object instance that contains handle references to the object class instances of the equipment usage items 1630 and 1640. In another particular further embodiment, the equipment usage plan 1602 is
It can be implemented as a record structure instance that contains pointers to a linked pointer list of record structure instances for equipment usage items 1630 and 1640. In a similar manner, the object instance of 1602 is
References, pointer references, and handle references to instances of objects that form a linked list of references, including 1640, are available.

For certain embodiments, more than two equipment usage items may be included in the equipment usage plan 1602. For certain embodiments, only one equipment usage item may be included in equipment usage plan 1602. In the case of a specific embodiment, the equipment usage items are
It may not be included in the facility use plan 1602. For certain embodiments, the equipment usage plan may be implemented as a set of inference clauses, where the equipment usage items may then be represented as a set of inference clauses. For certain embodiments, more than two equipment usage sets may be implemented.

FIG. 29A illustrates a facility usage item 1610 that includes a facility identifier 1612, a startup time 1614, and an action 1616, according to a particular embodiment.

It should be noted that, for certain embodiments, the equipment usage item 1610 may be implemented in a computer-accessible memory coupled to a computer. In a particular further embodiment, the equipment usage item 1610 includes a product 1612, an activation time 1614, and an action 1616.
Can be implemented as a table that includes and as entries in the table. In another particular further embodiment, the equipment usage item 1610 includes a product 1612 and a startup time.
1614 and act 1616 can be implemented as an instance of a record structure that includes a pointer to an instance of the record structure. In another particular further embodiment, the equipment usage item 1610 may be implemented as an object instance that includes a reference to an object class instance of an item 1612, a launch time 1614, and an action 1616. For certain further embodiments, the equipment usage item 1610 may be implemented as an object instance that includes a pointer reference to an object class instance of an item 1612, an activation time 1614, and an action 1616. In another particular further embodiment, the equipment usage item 1610 can be implemented as an object instance that includes a handle reference to an object class instance of an item 1612, an activation time 1614, and an action 1616.

It should be noted that, for certain embodiments, the facility usage plan 1600 may include, as part thereof, knowledge intervals 1610 and 1620 that include different short-lived indistinguishable products. In certain other embodiments, the equipment usage plan may, as part thereof, add knowledge intervals for non-distinguishable merchandise items that are short-lived.

It should be noted that, for certain embodiments, the equipment usage item 1610 may be implemented in a computer-accessible memory coupled to a computer. In a particular further embodiment, the equipment usage item 1610 includes a product 1612, an activation time 1614, and an action 1616.
Can be implemented as a table that includes and as entries in the table. In another particular further embodiment, the equipment usage item 1610 includes a product 1612 and a startup time.
1614 and act 1616 can be implemented as an instance of a record structure that includes a pointer to an instance of the record structure. In another particular further embodiment, the equipment usage item 1610 may be implemented as an object instance that includes a reference to an object class instance of an item 1612, a launch time 1614, and an action 1616. For certain further embodiments, the equipment usage item 1610 may be implemented as an object instance that includes a pointer reference to an object class instance of an item 1612, an activation time 1614, and an action 1616. In another particular further embodiment, the equipment usage item 1610 can be implemented as an object instance that includes a handle reference to an object class instance of an item 1612, an activation time 1614, and an action 1616.

In the case of the specific embodiment, the equipment usage plan 1600 does not have an explicit product designation 1612 as a part thereof, but is estimated to be included in a separate table, a linked list, or the like. Knowledge interval including indistinguishable products with different short lives
1610 and 1620 can be included. In certain other embodiments, the equipment usage plan does not have an explicit product designation 1612 as part of it, but a separate table,
It is possible to add a knowledge interval of a product that is not indistinguishable product with a short life, which is estimated by being included in the link list or the like.

29C and 29B, which can have values belonging to a behavior set that includes a start behavior 1616-1, a stop behavior 1616-2, and a throttle behavior 1616-3, according to certain embodiments. 1616 of behavior of.

For certain embodiments, act 1616 of mapping 1670 to initiating act 1616-1 may be implemented as a bid mask or shift operation performed on a word or set of words that includes equipment usage item 1610. . In a particular embodiment, the initiation action 16
The act 1616 of the mapping 1672 to 16-2 can be implemented as a bid mask or shift operation performed on the word or set of words that includes the equipment usage item 1610. In a particular embodiment, action 16 of mapping 1672 to start action 1616-3
16 may be implemented as a bid mask or shift operation performed on a word or set of words that includes equipment usage item 1610.

For a particular embodiment, this mapping may be implemented as a table lookup function applied to behavior 1616 to determine the elements of the represented behavior set. For a particular embodiment, this mapping may be implemented as a reference to a class instance for a class behavior set including start behavior, stop behavior and throttle behavior derived classes. For a particular embodiment, this mapping may be implemented as a pointer to executable code, which may be a program step.

FIG. 30 shows a detailed flow chart of operation 2574 of FIG. 27B further performing the steps of operating a device based on a device operation schedule, according to certain embodiments.

Arrow 2600 shows the flow of execution from start operation 2574 to operation 2602. Operation 2602 is
Perform the steps to start the device based on the device operation schedule. Arrow 2604 indicates execution from act 2602 to act 2606. Operation 2606 ends the operation of this flow chart.

Arrow 2610 shows the flow of execution from start operation 2574 to operation 2612. Operation 2612 is
Perform a step of stopping the device based on the device operation schedule. Arrow 2614 indicates execution from act 2612 to act 2616. Operation 2616 ends the operation of this flow chart.

Arrow 2620 indicates the flow of execution from start operation 2574 to operation 2622. Operation 2622 is
Perform the steps to throttle the device based on the device operation schedule. Arrow 2624 indicates execution from operation 2622 to operation 2616. By operation 2616,
The operation of this flow chart ends.

In particular embodiments, at least one of acts 2602, 2612, or 2622 can be performed. In certain further embodiments, all of these operations are performed. In certain further embodiments, more than these acts are performed.

In certain embodiments, there can be more than one controlled device. In such an embodiment, at least one of operations 2602, 2612, or 2622 may be performed for each device. In certain further embodiments, all of these operations can be performed on at least one device. In certain further embodiments,
More than these operations can be performed on at least one device.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 31A shows a detailed flow chart of the operation 2602 of FIG. 30 further performing the steps of starting a device based on a device operation schedule, according to certain embodiments.

The arrow 2630 shows the flow of execution from the start operation 2602 to the operation 2632. Operation 2632 is
The step of starting the device is executed based on the device operation schedule based on at least one of the equipment usage items of the equipment usage plan including the start behavior. Arrow
2634 illustrates the execution of operation 2632 to operation 2636. Operation 2636 allows this flow
The operation of the chart ends.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of a device. Supported by steps.

FIG. 31B illustrates a detailed flow chart of operation 2612 of FIG. 30 further performing the step of shutting down a device based on a device operation schedule, according to certain embodiments.

Arrow 2650 shows the flow of execution from start operation 2612 to operation 2652. Behavior 2652
The step of stopping the device is executed based on the device operation schedule based on at least one of the equipment use items of the equipment use plan including the stop action. Arrow
2654 illustrates performing from operation 2652 to operation 2656. Operation 2656 allows this flow
The operation of the chart ends.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 31C shows a detailed flow chart of operation 2622 of FIG. 30 further performing the step of throttling a device based on a device operation schedule, according to a particular embodiment.

Arrow 2670 shows the flow of execution from start operation 2622 to operation 2672. Operation 2672 is
Performing a step of throttling the device based on a device operation schedule based on at least one of the equipment usage items of the equipment usage plan including the throttle action. Arrow 2674 indicates execution from action 2672 to action 2676. By operation 2676,
The operation of this flow chart ends.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 32A illustrates equipment usage items including behavior 1616 and throttle settings 1616-10.

[0356] For certain embodiments, equipment usage items may include throttle behavior 1616-3 and throttle setting 1616-10. In a particular embodiment, the equipment usage items are
A start action 1616-1 and throttle setting 1616-10 may be included. It should be noted that in the case of the specific embodiment, the equipment use items are stop behavior 1616-2 and throttle setting 1616-10.
Can be included.

Throttle settings, as used herein, refer to the information used to control the consumption, production, or transmission of a device, and thus the associated short-lived, indistinguishable merchandise by the device.

FIG. 32B further performs the step of throttling a device based on a device operation schedule based on at least one of the equipment usage items of the equipment usage plan, including throttle behavior and throttle settings, according to certain embodiments. 31C shows a detailed flow chart of operation 2622 of 31C.

The arrow 2690 shows the flow of execution from the start operation 2622 to the operation 2692. Operation 2692 is
The step of throttling the device is further performed based on the device operation schedule based on at least one of the equipment usage items of the equipment usage plan including throttle behavior and throttle setting. Arrow 2694 indicates execution from action 2692 to action 2696. Operation 2696 ends the operation of this flow chart.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 32C performs the step of starting a device based on a device operation schedule based on at least one of the equipment usage items of the equipment usage plan including start behavior and throttle settings, according to certain embodiments. 2 shows a detailed flow chart of operation 2632.

Arrow 2710 shows the flow of execution from start operation 2632 to operation 2712. Operation 2712 is
The step of starting the device is executed based on the device operation schedule based on at least one of the equipment usage items of the equipment usage plan including the start behavior and the throttle setting. Arrow 2714 indicates execution from action 2712 to action 2716. Operation 2716 ends the operation of this flow chart.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 33A shows that at least a device consumes a short-lived indistinguishable product based on a knowledge interval set that includes at least one of a short-lived indistinguishable product knowledge interval at a time interval, including cost. 6 illustrates a flow chart for performing the steps of planning and controlling a device according to a particular embodiment when including a device set that includes two devices.

Operation 2730 initiates the operation of this flow chart. Arrow 2732 shows the flow of execution from action 2730 to action 2734. Act 2734 performs the steps of manipulating the device set based on the device set operation schedule. Arrow 2736 indicates execution from action 2734 to action 2738. Operation 2738 ends the operation of this flow chart.

Arrow 2740 shows the flow of execution from start operation 2730 to operation 2000. Operation 2000
In order to create the device set operation schedule described with respect to FIG. 27B, short-lived indistinguishable based on a knowledge interval set that includes at least one knowledge interval for a short-lived indistinguishable product, including costs. Implement methods to plan devices that consume goods. Arrow 2742 works
Shows execution from 2000 to operation 2738. Operation 2738 ends the operation of this flow chart.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 33B is a detailed flow chart of operation 2734 of FIG. 33A further performing the step of operating a device set based on a device set operation schedule including at least one of the sets, according to certain embodiments. Is shown.

Arrow 2750 shows the flow of execution from start operation 2734 to operation 2752. Operation 2752
Performing the step of starting at least one of the devices in the device set based on the device operation schedule. Arrow 2754 indicates execution from action 2752 to action 2756. Operation 2756 ends the operation of this flow chart.

Arrow 2760 shows the flow of execution from start operation 2734 to operation 2762. Operation 2762 is
Performing a step of stopping at least one of the devices of the device set based on the device operation schedule. Arrow 2762 indicates the execution from operation 2762 to operation 2756. Operation 2756 ends the operation of this flow chart.

Arrow 2770 shows the flow of execution from start operation 2734 to operation 2772. Operation 2772 is
Performing the step of throttling at least one of the devices in the device set based on the device operation schedule. Arrow 2774 indicates execution from action 2772 to action 2756. Operation 2756 ends the operation of this flow chart.

It should be noted that, for certain embodiments, at least one of operations 2752, 2762, and 2772 can be performed on at least one device of the device set. For certain further embodiments, all operations 2752, 2762, and 2772 may be performed on at least one device in the device set. For certain further embodiments, all operations 2752, 2762, and 2772 may be performed for all devices in the device set.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 34A shows a flow chart for performing the steps of measuring device consumption of short-lived indistinguishable goods, according to a particular embodiment.

Operation 2790 initiates the operation of this flow chart. Arrow 2792 shows the flow of execution from action 2790 to action 2794. Act 2794 performs steps for measuring device consumption of short-lived indistinguishable items. Arrow 2796, action 27
Shown is the execution from 94 to operation 2798. Operation 2798 ends the operation of this flow chart.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 34B shows a detailed flow chart of operation 2794 of FIG. 34A further performing the step of measuring device consumption of short-lived indistinguishable merchandise, in accordance with certain embodiments.

Arrow 2810 shows the flow of execution from start operation 2794 to operation 2812. Operation 2812 is
Performing the step of measuring the device consumption rate of indistinguishable goods within the measurement time interval. Arrow 2814 indicates execution from act 2812 to act 2816. Operation 2816 determines the cost of a short life indistinguishable product within a measurement time interval based on a set of knowledge time intervals to create a measurement cost factor for a short life indistinguishable product during a measurement time interval. Perform the steps that you want. Arrow 2818 indicates execution from act 2816 to act 2820. The operation 2820 is based on the device consumption rate of the short life indistinguishable device at the measurement time interval to create a consumption cost for the device consuming the short life indistinguishable product over the measurement time interval. And performing a step of calculating the cost of consumption of the device based on the measured cost factor of the short life indistinguishable goods based on the measured time interval during the measured time interval. Arrow 2822
Indicates execution from act 2820 to act 2824. Operation 2824 ends the operation of this flow chart.

In a particular embodiment, these operations are programs resident in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of a device. Supported by steps.

[0380] Figure 35A illustrates a detailed flow of operation 2794 of Figure 34A further performing the step of measuring device consumption of short-lived indistinguishable goods, according to certain embodiments.
The chart is shown.

Arrow 2830 shows the flow of execution from start operation 2794 to operation 2832. Operation 2832 is
Performing steps to maintain a cumulative cost for short-lived indistinguishable devices. Arrow 2834 indicates execution from action 2832 to action 2836. Operation 2836 ends the operation of this flow chart.

Arrow 2840 shows the flow of execution from start operation 2794 to operation 2842. Operation 2842 is
Performing a step of updating a device's cumulative cost of the short life indistinguishable product based on the consumption cost for the device consuming the short life indistinguishable product over the measurement time interval. Arrow 2844 indicates execution from action 2842 to action 2836. Operation 2836 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

[0384] Figure 36A illustrates two short life indistinguishables based on a knowledge interval set that includes at least one knowledge interval for a short lifespan in a time interval, including cost, according to certain embodiments. FIG. 4B shows a detailed flow chart of operation 2000 of FIG. 4A, further performing the method of planning a device that consumes an item.

The arrow 2850 shows the flow of execution from the start operation 2000 to the operation 2852. Operation 2852
Based on a set of knowledge intervals that includes at least one knowledge interval of a short-lived indistinguishable product that includes costs, and that includes costs.
Consume a short-lived indistinguishable product and a second short-lived indistinguishable product based on a second knowledge interval set that includes at least one knowledge interval of a second short-lived indistinguishable product in a time interval. Perform a method to plan the device that you want. Arrow 2854 indicates execution from action 2852 to action 2856. motion
2856 ends the operation of this flow chart.

It should be noted that, for certain embodiments, a single set of knowledge intervals may include knowledge intervals for two or more short-lived indistinguishable items. For such an embodiment, the two knowledge interval sets are both considered to be contained in this single knowledge interval set.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 36B is a detailed flow chart of operation 2004 of FIG. 4A performing steps to determine a need for a second short-lived indistinguishable product over a planning time interval, according to certain embodiments. Is shown.

The arrow 2870 shows the flow of execution from the start operation 2004 to the operation 2872. Operation 2872 is
Performing a step of determining the need for a second, short-lived, indistinguishable product over the planning time interval. Arrow 2874 indicates execution from action 2872 to action 2876. Operation 2876 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of a device. Supported by steps.

FIG. 36C illustrates a need for a short life indistinguishable product over a planning time interval and a need for a second short life indistinguishable product to create a device operation schedule, according to certain embodiments. FIG. 4B illustrates a detailed flow chart of operation 2008 of FIG. 4A performing the steps of exploring the knowledge interval set based on FIG.

Arrow 2890 shows the flow of execution from start operation 2008 to operation 2892. Operation 2892 is
A step of investigating a knowledge interval set based on the need for a short life indistinguishable product and a second short life indistinguishable product for the planning time interval to create a device operation schedule. Run. Arrow
2894 shows execution from action 2892 to action 2896. This flow can be
The operation of the chart ends.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of a device. Supported by steps.

FIG. 37A illustrates short-lived indistinguishable products based on a knowledge interval set that includes at least one knowledge interval of short-lived indistinguishable products at time intervals, including cost, according to certain embodiments. FIG. 4B shows a detailed flow chart of operation 2000 of FIG. 4A further performing a method of planning a device that consumes and produces a second short-lived indistinguishable product.

An arrow 2910 shows the flow of execution from the start operation 2000 to the operation 2912. Operation 2912 is
A second short-lived indistinguishable product based on a knowledge interval set that includes at least one knowledge interval of the short-lived indistinguishable product in the time interval, including cost, and A method of planning a device consuming a short-lived indistinguishable product and a second short-lived indistinguishable product based on a second set of knowledge intervals including at least one knowledge interval. Arrow 2914 indicates execution from act 2912 to act 2916. Operation 2916 ends the operation of this flow chart.

It should be noted that, for certain embodiments, a single set of knowledge intervals may include knowledge intervals for two or more short-lived indistinguishable items. For such an embodiment, the two knowledge interval sets are both considered to be contained in this single knowledge interval set.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of a device. Supported by steps.

FIG. 37B is a detailed flow chart of operation 2004 of FIG. 4A performing steps to determine a need for a second short-lived indistinguishable item over a planning time interval, according to certain embodiments. Is shown.

The arrow 2930 shows the flow of execution from the start operation 2004 to the operation 2932. Behavior 2932
Performing a step of determining the need for a second, short-lived, indistinguishable product over the planning time interval. Arrow 2934 indicates execution from action 2932 to action 2936. Operation 2936 ends the operation of this flow chart.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 37C illustrates the need for a short life indistinguishable product over a planning time interval and a second short life life indistinguishable product for creating a device operation schedule according to certain embodiments. FIG. 4B illustrates a detailed flow chart of operation 2008 of FIG. 4A performing the steps of exploring the knowledge interval set based on FIG.

Arrow 2950 shows the flow of execution from start operation 2008 to operation 2952. Operation 2952 is
A step of investigating a knowledge interval set based on the need for a short life indistinguishable product and a second short life indistinguishable product for the planning time interval to create a device operation schedule. Run. Arrow
2954 shows the execution from action 2952 to action 2956. This flow is enabled by operation 2956.
The operation of the chart ends.

In a particular embodiment, these operations are a program residing in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 38A illustrates short-lived indistinguishable products based on a knowledge interval set including at least one knowledge interval of short-lived indistinguishable products in a time interval, including cost, according to certain embodiments. FIG. 4B shows a detailed flow chart of operation 2000 of FIG. 4A further performing a method of planning a device for consuming and consuming a second short-lived indistinguishable product.

An arrow 2970 shows the flow of execution from the start operation 2000 to the operation 2972. Behavior 2972
A second short-lived indistinguishable product based on a knowledge interval set that includes at least one knowledge interval of the short-lived indistinguishable product in the time interval, including cost, and A method of planning a device consuming a short-lived indistinguishable product and a second short-lived indistinguishable product based on a second set of knowledge intervals including at least one knowledge interval. Arrow 2974 indicates the execution from action 2972 to action 2976. Operation 2976 ends the operation of this flow chart.

It should be noted that, for certain embodiments, a single set of knowledge intervals may include knowledge intervals for two or more short-lived indistinguishable items. For such an embodiment, the two knowledge interval sets are both considered to be contained in this single knowledge interval set.

For certain embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 38B is a detailed flow chart of operation 2004 of FIG. 4A performing steps to determine a need for a second short-lived indistinguishable item over a planning time interval, according to certain embodiments. Is shown.

The arrow 2990 shows the flow of execution from the start operation 2004 to the operation 2992. Action 2992
Performing a step of determining the need for a second, short-lived, indistinguishable product over the planning time interval. Arrow 2994 indicates execution from action 2992 to action 2996. Operation 2996 ends the operation of this flow chart.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in the computing system that supports at least the steps of planning the operation of the device. Supported by steps.

[0411] Figure 38C illustrates the need for a short life indistinguishable product and a second short life life indistinguishable product over a planning time interval to create a device operation schedule according to certain embodiments. FIG. 4B illustrates a detailed flow chart of operation 2008 of FIG. 4A performing the steps of exploring the knowledge interval set based on FIG.

An arrow 3010 shows the flow of execution from the start operation 2008 to the operation 3012. Operation 3012
A step of investigating a knowledge interval set based on the need for a short life indistinguishable product and a second short life indistinguishable product for the planning time interval to create a device operation schedule. Run. Arrow
3014 shows execution from act 3012 to act 3016. This flow is
The operation of the chart ends.

In particular embodiments, these operations are programs resident in a combined computer-readable memory on at least one computer in a computing system that supports at least the steps of planning the operation of the device. Supported by steps.

FIG. 39A illustrates an application of a particular embodiment in passive mode. It is linked to the system for price information and cannot be traded in the market.

Price information is received as indicated by arrow 3002. The system 3000 plans the device 3110 based on the price information 3002 for a particular embodiment. For certain further embodiments, the system 3000 may determine the device based on the pricing information 3002.
Plan and operate the 3110.

For certain embodiments, the system 3000 may configure the device based on the pricing information 3002.
Plan the operation of 3110 and device 3120. In certain further embodiments, system 3000 plans and operates devices 3110 and 3120 based on price information 3002.

For certain embodiments, system 3000 includes a measuring capability 3200 based on price information 3002. In certain further embodiments, the system 3000 includes pricing information 3002.
Measuring device 3110 and device 3120, and planning and manipulating.

The system 3000 does not require high intelligence. All that is required is a simple chip or module that can be inserted into each device that receives a signal at a specific radio frequency and can analyze such data in a very simple way. If the price exceeds a certain amount, this will be off. If the price drops, it turns on and so on.

The wireless application protocol, WAP, provides all the services needed to form arrow 3002. Alternatively, there may be dedicated bandwidth allocations, eg, in the United States, price information 3002 may be passively transmitted in the local area.

In principle, the communication 3002 may be wired or any other means or mechanism for broadcasting. Wired distribution of information can be "loaded" on power lines.

Pricing information 3002 can be provided by local networks, including home local networks. The price information 3002 can be distributed by the home Web server. In a particular embodiment, JAVA® is a home web control language based on futures prices for short-lived indistinguishable products such as electricity.

FIG. 39B illustrates an application of the particular embodiment in active mode. Link with a system for handling trading interactions at prices and markets.

Price information is received as indicated by arrow 3002. The bid information is submitted as represented by arrow 3004. The system 3000 is price information 3002 for certain embodiments.
Based on, plan device 3110. In certain further embodiments,
The system 3000 plans and operates the device 3110 based on the price information 3002. System 3000 places bid 3004 as part of the planning process.

For certain embodiments, the system 3000 may determine the device based on the pricing information 3002.
Plan the operation of 3110 and device 3120. In certain further embodiments, system 3000 plans and operates devices 3110 and 3120 based on price information 3002. System 3000 places bid 3004 as part of the planning process.

For certain embodiments, system 3000 includes an ability 3200 to measure based on price information 3002. In certain further embodiments, the system 3000 includes pricing information 3002.
Measuring device 3110 and device 3120, and planning and manipulating. System 3000 places bid 3004 as part of the planning process.

The wireless application protocol, WAP, provides all the services needed to form arrows 3002 and 3004. Alternatively, there may be dedicated bandwidth allocation, for example, in the United States, price information 3002 and bid information 3004 can be passively transmitted and received within a local area.

In principle, communications 3002 and 3004 may be wired or any other means or mechanism for broadcasting. Wired distribution of information can be "loaded" on power lines.

Price information 3002 and bids 3004 can be provided by local networks, including home local networks. The price information 3002 and the bid 3004 can be distributed by the home Web server. For certain embodiments, JAV
A (registered trademark) is a home Web control language based on the futures price of short-lived indistinguishable products such as electricity.

FIG. 40 is a simplified system of a trading computing system 4000 that supports interaction between a set of certified clients based on interaction with a virtual exchange and a computing system, according to certain embodiments. Shows a block.

Trading computing system 4000 comprises at least one computing system 4020 coupled 4024 to computer readable memory 4026. Trading Computing System 4000 and Trading Computing System 4020
Communication and interaction with and is indicated by arrow 4022. These communication and interaction processes 4022 may utilize a variety of communication technologies, including the wireless physical transport layer in certain embodiments. In certain alternative embodiments, communication and interaction 4022 may utilize a wired physical transport layer.

In the case of a specific embodiment, a natural person 4100, a business entity 4120, an agent 4140,
Entities such as software agent 4160 and arrows 4102 and 4122, respectively.
, 4142, and 4182 are used to communicate with trading computing system 4000. For certain embodiments, such messages may use the wired physical transport layer represented by one or more arrows 4102, 4122, 4142, and 4182. For certain embodiments, such messages may use the wireless physical transport layer represented by one or more arrows 4102, 4122, 4142, and 4182. Such messages may use the body signal for certain further embodiments. These messages are
Hand signals can also be used. In another embodiment, such a message may use the acoustic signal of the message. In certain further embodiments, such messages may use verbal messages in the natural language.

The software agent computer 4180 has a computer-readable memory 4086.
Be combined with. In a particular embodiment, the program operating system plans a short-lived indistinguishable commodity consuming device 3110 and 3120.
Supports the steps to be present in computer readable memory 4086. In a particular further embodiment, the program operating system is
Further support for operating steps 10 and 3120. In certain embodiments, bidding is supported by a program operating system residing in computer readable memory 4086. For such an embodiment, trading activity may be considered continued by software agent 4160.

The embodiments described above are provided as examples, and do not limit the scope of the claims.

[Brief description of drawings]

FIG. 1 shows an example of an AC power network based on current AC power technology found in the prior art.

2 is a diagram showing a list of associated AC power functions for each FlowGate of a set of FlowGates for each bus of various nodes of the example AC power network of FIG. 1 disclosed in the prior art.

FIG. 3A is a diagram illustrating a virtual exchange 1000 that includes valid orders and market intervals along with associated market conditions, according to certain embodiments.

FIG. 3B illustrates a market interval including product type, location, and time interval, according to certain embodiments.

FIG. 3C is a diagram further comprising a number of time intervals in accordance with certain embodiments.
It is a figure which shows the improvement of the market interval shown to 3B.

FIG. 3A is a diagram illustrating a virtual exchange 1000 including active orders and market intervals having associated market conditions, according to certain embodiments.

FIG. 3B illustrates a market interval including product type, location, and time interval, according to certain embodiments. This product type includes short-lived indistinguishable products in certain embodiments. In certain further embodiments,
All product types are short-lived, indistinguishable products.

FIG. 3C is a diagram further comprising a number of time intervals in accordance with certain embodiments.
It is a figure which shows the improvement of the market interval shown to 3B.

FIG. 4A is a device consuming a short-lived indistinguishable product based on a knowledge interval set including at least one knowledge interval of the short-lived indistinguishable product at a time interval, including cost, according to certain embodiments. FIG. 6 is a diagram showing a flow chart of a method for planning the.

FIG. 4B further performs the step of creating a first knowledge interval for a short-lived indistinguishable product at a first time interval that includes a first cost in the knowledge interval set according to certain embodiments; FIG. 4B illustrates a detailed flow chart of operation 2000 of FIG. 4A.

FIG. 5A is an act 2032 of FIG. 4B performing the steps of receiving a create knowledge interval message and creating a knowledge interval, according to certain embodiments.
It is a figure which shows the detailed flow chart of.

FIG. 5B is a detailed flow of operation 2056 of FIG. 5A performing the steps of processing a received knowledge interval creation message and inserting a first knowledge interval into the knowledge interval collection, according to certain embodiments. It is a figure which shows a chart.

FIG. 6A illustrates a knowledge interval set 1200 including a knowledge interval 1210 according to certain embodiments.

FIG. 6B illustrates a knowledge interval set 1200 that does not include a knowledge interval, according to certain embodiments.

FIG. 6C illustrates a knowledge interval set 1200 including knowledge intervals 1210, 1220 according to certain embodiments.

FIG. 6D illustrates a second set of knowledge intervals 1202 including knowledge intervals 1230 and 1240, according to certain embodiments.

FIG. 7A illustrates a knowledge interval 1210 including a short-lived indistinguishable product 1212, a time interval 1214, and a cost 1216, according to certain embodiments.

FIG. 7B illustrates a knowledge interval 1210 that can include a time interval 1214 and a cost 1216 without an explicit reference to a short-lived indistinguishable item, according to certain embodiments.

FIG. 7C illustrates a knowledge interval 1210 including a short-lived indistinguishable product 1212, a time interval set 1218, and a cost 1216, according to certain embodiments.

FIG. 7D illustrates a time interval set 1218 including time intervals 1214-1 and 1214-2 according to certain embodiments.

FIG. 8A is a diagram illustrating a knowledge interval 1210 including a short-lived indistinguishable product 1212, a time interval 1214, and a price 1216-1 in accordance with certain embodiments.

FIG. 8B illustrates a knowledge interval 1210 that can include a time interval 1214 and a price 1216-1 without an explicit reference to a short-lived indistinguishable product, according to certain embodiments. .

FIG. 8C illustrates a knowledge interval 1210 including a short-lived indistinguishable product 1212, a time interval set 1218, and a price 1216-1 according to certain embodiments.

FIG. 9A: Replacing a second knowledge interval with a first knowledge interval in a set of knowledge intervals, with the first and second knowledge intervals sharing the same time interval, according to a particular embodiment. FIG. 5B illustrates a detailed flow chart of operation 2056 of FIG. 5A performing FIG.

FIG. 9B illustrates a time interval when a first time interval of a first knowledge interval intersects a time interval (s) of a second knowledge interval already included in the knowledge interval set, according to certain embodiments. A detailed flow of operation 2056 of FIG. 5A further performing the step of cutting the interval or set of time intervals and modifying the second knowledge interval to insert into the first time interval.
It is a figure which shows a chart.

FIG. 10A is an act of FIG. 5A performing a step of deleting a second knowledge interval from a knowledge interval according to a particular embodiment when the second time interval is greater than that included in the first time interval. It is a figure which shows the detailed flow chart of 2056.

FIG. 10B is a flow of performing a step of removing a first knowledge interval of a short-lived indistinguishable product at a first time interval that includes a first cost from a knowledge interval set according to certain embodiments. -A diagram showing a chart.

FIG. 11A illustrates a detailed flow chart of operation 2154 of FIG. 10B further performing the steps of receiving and processing a remove knowledge interval message, according to certain embodiments.

FIG. 11B illustrates a flow chart for performing the steps of building real-time according to certain embodiments.

FIG. 12A illustrates a first time of a first knowledge interval according to certain embodiments.
Whenever an interval precedes in real time, further perform the step of removing the first knowledge interval of the short-lived indistinguishable product at the first time interval, including the first cost, from the knowledge interval set. FIG. 11B illustrates a detailed flow chart of operation 2154 of FIG. 10B.

FIG. 12B illustrates a first time of a first knowledge interval according to certain embodiments.
Whenever an interval precedes in real time, further perform the step of removing the first knowledge interval of the short-lived indistinguishable product at the first time interval, including the first cost, from the knowledge interval set. FIG. 12B illustrates a detailed flow chart of operation 2216 of FIG. 12A.

FIG. 13A illustrates a flow chart for performing the steps of receiving and processing a knowledge message in accordance with certain embodiments.

FIG. 13B illustrates a detailed flow chart of operation 2258 of FIG. 13A further performing the steps of processing a first received knowledge message, according to certain embodiments.

FIG. 14A shows a first cost in a knowledge interval set based on a first received knowledge message whenever the message type of the first received knowledge message is create_knowledge_interval, according to a particular embodiment. FIG. 13B illustrates a detailed flow chart of operation 2276 of FIG. 13B further performing the step of creating a first knowledge interval for a short life indistinguishable product at a first time interval, including:

FIG. 14B shows a first cost in a knowledge interval set based on a first received knowledge message whenever the message type of the first received knowledge message is remove_knowledge_interval, according to a particular embodiment. FIG. 13B illustrates a detailed flow chart of operation 2280 of FIG. 13B further performing a step of removing a first knowledge interval of a short-lived indistinguishable product at a first time interval, including:

FIG. 15A illustrates the operation 2272 of FIG. 13B of performing a step of examining a first received knowledge message to create a message type that includes at least one element of a knowledge message type set, according to certain embodiments. It is a figure which shows a detailed flow chart.

FIG. 15B illustrates a first cost in a knowledge interval set based on a first received knowledge message whenever the message type of the first received knowledge message includes create_knowledge_interval, according to a particular embodiment. FIG. 13B illustrates a detailed flow chart of operation 2276 of FIG. 13B performing steps to create a first knowledge interval of a short life indistinguishable product at a first time interval, including:

FIG. 15C shows a first cost in a knowledge interval set based on a first received knowledge message whenever the message type of the first received knowledge message includes remove_knowledge_interval, according to a particular embodiment. FIG. 13B illustrates a detailed flow chart of operation 2280 of FIG. 13B performing steps to remove a first knowledge interval of a short-lived indistinguishable product at a first time interval, including:

FIG. 16A shows a first cost in a knowledge interval set based on a first received knowledge message whenever the message type of the first received knowledge message includes create_knowledge_interval, according to a particular embodiment. FIG. 16B illustrates a detailed flow chart of operation 2352 of FIG. 15B further performing a step of creating a first knowledge interval of a short-lived indistinguishable product at a first time interval, including:

FIG. 16B shows a first cost in a knowledge interval set based on a first received knowledge message whenever the message type of the first received knowledge message includes remove_knowledge_interval, according to a particular embodiment. FIG. 16C illustrates a detailed flow chart of operation 2372 of FIG. 15C further performing a step of removing a first knowledge interval of a short-lived indistinguishable product at a first time interval, including:

FIG. 17A illustrates a flow chart for performing the steps of maintaining a bid interval set of bid intervals according to a particular embodiment.

FIG. 17B illustrates a detailed flow chart of operation 2434 of FIG. 17A performing steps for maintaining a bid interval set of bid intervals according to certain embodiments.

FIG. 18A illustrates a bid interval set 1300 that includes bid intervals 1310, according to certain embodiments.

FIG. 18B illustrates a bid interval set 1300 that does not include a bid interval, according to certain embodiments.

FIG. 18C illustrates a bid interval set 1300 including bid intervals 1310 and 1320, according to certain embodiments.

FIG. 18D illustrates a second bid interval set 1302 that includes bid intervals 1330 and 1340 according to certain embodiments.

FIG. 19A illustrates a bid interval 1310 that includes a short-lived indistinguishable product 1312, a bid time interval 1314, a bid price 1316, and a bid quantity 1316-1, according to certain embodiments.

FIG. 19B illustrates a bid time interval 1314, a bid price 1316, and a bid quantity without an explicit reference to short-lived indistinguishable items, according to certain embodiments.
FIG. 13 illustrates a bid interval 1310 that may include 1316-1 and 1316-1.

FIG. 19C illustrates a bid interval 1310 including a short-lived indistinguishable product 1312, a bid time interval set 1318, a bid price 1316, and a bid quantity 1316-1, according to certain embodiments.

FIG. 19D illustrates a bid time interval 1314-1 and 1314 according to certain embodiments.
FIG. 13 is a diagram showing a bid time interval set 1318 including -2.

FIG. 20A illustrates a bid interval 1310 including a short-lived indistinguishable product 1312, a bid time interval 1314, a bid price 1316, a bid quantity 1316-1, and a committed flag 1316-2, according to certain embodiments. FIG.

FIG. 20B illustrates a bid time interval 1314, a bid price 1316, and a bid quantity without including an explicit reference to a short-lived indistinguishable item, according to certain embodiments.
Bid interval 1310 that can include 1316-1 and committed flag 1316-2
FIG.

FIG. 20C illustrates a bid interval including a short-lived indistinguishable product 1312, a bid time interval set 1318, a bid price 1316, a bid quantity 1316-1, and a committed flag 1316-2, according to certain embodiments. It is a figure which shows 1310.

FIG. 21A is a detailed illustration of operation 2032 of FIG. 4B performing the step of creating a first knowledge interval of a knowledge interval set based on a first committed bid interval of the bid interval set, according to certain embodiments. It is a figure which shows a flow chart.

FIG. 21B is a detail of operation 2472 of FIG. 21A further performing the step of creating a first knowledge interval of the knowledge interval set based on the first committed bid interval of the bid interval set in accordance with certain embodiments. It is a figure which shows a simple flow chart.

FIG. 22A illustrates a facility usage set 1400 including a facility usage entry 1410, according to certain embodiments.

FIG. 22B illustrates a facility usage set 1400 that does not include a facility usage entry, according to certain embodiments.

FIG. 22C illustrates an equipment usage set 1400 including equipment usage entries 1410, 1420, according to certain embodiments.

FIG. 22D illustrates a second equipment usage set 1402 that includes equipment usage entries 1430 and 1440, according to certain embodiments.

FIG. 23A illustrates a facility usage entry 1410 including a short-lived indistinguishable product 1412, a need schedule 1416, and a due date 1414 according to certain embodiments.

FIG. 23B illustrates a facility usage entry 1410 that may include a need schedule 1416 and a due date 1414 without an explicit reference to a short-lived indistinguishable product, according to certain embodiments.

FIG. 23C illustrates an equipment usage entry 1410 including a short-lived indistinguishable product 1412, a need schedule set 1418, and a due date 1414 according to certain embodiments.

FIG. 23D illustrates a need schedule set 1418 that includes need schedules 1414-1 and 1414-2 according to certain embodiments.

FIG. 24A illustrates a product need 1510 including a short life indistinguishable product 1512, a need time interval 1514, a cost limit 1516, and a quantity 1516-1 in accordance with certain embodiments.

FIG. 24B does not include an explicit reference to a short-lived indistinguishable item, a need time interval 1514, and a cost limit 1516, but only the quantity 1516-1, according to certain embodiments. It is a figure which shows goods necessity 1510.

FIG. 24C illustrates a product need 1510 including a short-lived indistinguishable product 1512, a need time interval set 1518, a cost limit 1516, and a quantity 1516-1 according to certain embodiments.

FIG. 24D is a need time interval 1514-1 and 15-1, according to certain embodiments.
FIG. 16 is a diagram illustrating a need time interval set 1518 including 14-2.

FIG. 25A illustrates a commodity need set 15 including a commodity need 1510, according to certain embodiments.
It is a figure which shows 00.

FIG. 25B illustrates a commodity need set 1500 that does not include a commodity need, according to certain embodiments.
FIG.

FIG. 25C illustrates a commodity need set 1500 including commodity needs 1510, 1520, according to certain embodiments.

FIG. 25D illustrates a second commodity need set 1502 that includes commodity needs 1530 and 1540, according to certain embodiments.

FIG. 26A illustrates a detailed flow chart of operation 2004 of FIG. 4A further performing the step of determining a need for short-lived indistinguishable goods over a planning time interval, according to certain embodiments. .

FIG. 26B is a first bid of a bid interval set that includes a first bid quantity as a bid quantity, a first bid price as a bid price, and a first time interval as a bid time interval, in accordance with certain embodiments. FIG. 17B shows a detailed flow chart of operation 2452 of FIG. 17B performing the step of placing a first bid of a first bid quantity at a first bid price for a first time interval to create It is a figure.

FIG. 27A further performs a step of exploring a knowledge interval set based on a need for short-lived indistinguishable products over a planning time interval to create a device operation schedule, according to certain embodiments, Figure 26A
FIG. 27 is a diagram showing a detailed flowchart of the operation 2512 of FIG.

FIG. 27B consumes a short-lived indistinguishable product based on a knowledge interval set comprising at least one knowledge interval of a short-lived indistinguishable product at a time interval, including cost, according to certain embodiments. FIG. 6 shows a flow chart for performing a method for controlling a device.

FIG. 28A is an equipment usage plan including equipment usage items 1610, according to certain embodiments.
It is a figure which shows 1600.

FIG. 28B is an equipment usage plan that does not include equipment usage items, according to certain embodiments.
It is a figure which shows 1600.

FIG. 28C illustrates a facility usage plan 1600 including facility usage items 1610, 1620, according to certain embodiments.

FIG. 28D illustrates a second equipment usage plan 1602 including equipment usage items 1630 and 1640, according to certain embodiments.

FIG. 29A illustrates an equipment identifier 1612, a startup time 1614, according to certain embodiments,
It is a figure which shows the equipment use item 1610 including the action 1616.

FIG. 29B is a diagram illustrating a facility usage item 1610 that may include an activation time 1614 and an action 1616 without an explicit reference to a facility identifier, according to certain embodiments.

FIG. 29C illustrates a start behavior 1616-1, a stop behavior 1616-2, according to certain embodiments.
FIG. 29A, which can have values belonging to a behavior set that includes throttle behavior 1616-3.
And FIG. 29B shows behavior 1616 of 29B.

FIG. 30 illustrates a detailed flow chart of operation 2574 of FIG. 27B further performing the steps of operating a device based on a device operation schedule, according to certain embodiments.

FIG. 31A illustrates a detailed flow chart of the operation 2602 of FIG. 30 further performing the steps of starting a device based on a device operation schedule, according to certain embodiments.

FIG. 31B illustrates a detailed flow chart of operation 2612 of FIG. 30 further performing stopping devices based on a device operation schedule, according to certain embodiments.

FIG. 31C is a detailed flow chart of operation 2622 of FIG. 30 further performing the step of throttling a device based on a device operation schedule, in accordance with certain embodiments.

FIG. 32A is a diagram showing equipment usage items including behavior 1616 and throttle setting 1616-10.

32B is an operation of FIG. 31C further performing the step of throttling a device based on a device operation schedule based on at least one equipment usage item of an equipment usage plan including throttle behavior and throttle settings, according to certain embodiments. It is a figure which shows the detailed flow chart of 2622.

32C illustrates operation 2632 of FIG. 31A performing the step of starting a device based on a device operation schedule based on at least one of the equipment usage items of an equipment usage plan including start behavior and throttle settings, according to certain embodiments. It is a figure which shows the detailed flow chart of.

FIG. 33A illustrates at least two devices in which the device consumes a short-lived indistinguishable product based on a knowledge interval set that includes at least one of a short-lived indistinguishable product knowledge interval at a time interval, including cost. FIG. 6 shows a flow chart for performing the steps of planning and controlling a device according to a particular embodiment when including a device set including

FIG. 33B shows a detailed flow chart of operation 2734 of FIG. 33A further performing the steps of operating a device set based on a device set operation schedule including at least one of the sets, according to certain embodiments. Is.

FIG. 34A shows a flow chart for performing the steps of measuring device consumption of short-lived indistinguishable goods, according to certain embodiments.

FIG. 34B is a detailed flow chart of operation 2794 of FIG. 34A further performing the step of measuring device consumption of short-lived indistinguishable goods, according to certain embodiments.

FIG. 35A is a detailed flow chart of operation 2794 of FIG. 34A further performing the step of measuring device consumption of short-lived indistinguishable goods, according to certain embodiments.

FIG. 36A consumes two short-lived indistinguishable products based on a knowledge interval set that includes at least one knowledge interval of the short-lived indistinguishable products at a time interval, including cost, according to certain embodiments. FIG. 4B illustrates a detailed flow chart of operation 2000 of FIG. 4A further performing the method for planning a device to perform.

FIG. 36B performs the steps of determining a need for a second short-lived indistinguishable product over a planning time interval, according to certain embodiments.
5 is a diagram showing a detailed flow chart of the operation 2004 of FIG.

FIG. 36C is based on a short life indistinguishable product need and a second short life span indistinguishable product need over a planning time interval to create a device operation schedule according to certain embodiments. FIG. 4B illustrates a detailed flow chart of operation 2008 of FIG. 4A, performing the steps of investigating a knowledge interval set.

FIG. 37A consumes a short-lived indistinguishable product based on a knowledge interval set including at least one knowledge interval of the short-lived indistinguishable product at a time interval, including cost, in accordance with certain embodiments; Further performing a method of planning a device that produces a second short-lived indistinguishable item, FIG. 4A.
8 is a diagram showing a detailed flow chart of the operation 2000 of FIG.

FIG. 37B performs the steps of determining a need for a second short-lived indistinguishable product over a planning time interval, according to certain embodiments, FIG.
5 is a diagram showing a detailed flow chart of the operation 2004 of FIG.

FIG. 37C is based on a need for a short life indistinguishable product and a second short life span indistinguishable product for a planning time interval to create a device operation schedule according to certain embodiments. FIG. 4B illustrates a detailed flow chart of operation 2008 of FIG. 4A, performing the steps of investigating a knowledge interval set.

FIG. 38A consumes a short-lived indistinguishable product based on a knowledge interval set that includes at least one knowledge interval of the short-lived indistinguishable product at a time interval, including cost, in accordance with certain embodiments; Further implementing a method of planning a device for carrying a second short-lived indistinguishable product, FIG. 4A.
8 is a diagram showing a detailed flow chart of the operation 2000 of FIG.

FIG. 38B performs the step of determining a need for a second short-lived indistinguishable product over a planning time interval, according to certain embodiments.
5 is a diagram showing a detailed flow chart of the operation 2004 of FIG.

FIG. 38C is based on a short life indistinguishable product need and a second short life indistinguishable product need over a planning time interval to create a device operation schedule according to certain embodiments. FIG. 4B illustrates a detailed flow chart of operation 2008 of FIG. 4A, performing the steps of investigating a knowledge interval set.

FIG. 39A illustrates an application of a particular embodiment in passive mode. It is linked to the system for price information and cannot be traded in the market.

FIG. 39B illustrates an application of a particular embodiment in active mode. Link with a system for handling trading interactions at prices and markets.

FIG. 40 illustrates a simplified system block of trading computing system 4000 supporting interaction between a set of authorized clients and a computing system based on interaction with a virtual exchange, according to certain embodiments. It is a figure.

[Explanation of symbols]

1000 Virtual Exchange Mechanism 1100, 1120, 1140, 1160 Market Interval 1200, 1202, 1210, 1230, 1240 Knowledge interval set 1212 Short-life products that cannot be distinguished 1214 Time Interval 1216 cost 1216-1 Price 1610, 1620, 1630, 1640 Equipment use items 1612 Equipment identifier 1614 Startup time 1616 Action 2000, 2004, 2008, 2012, 2056, 2060 operation

─────────────────────────────────────────────────── ─── Continuation of front page (51) Int.Cl. ⁷ Identification code FI theme code (reference) H02J 3/46 H02J 3/46 G (81) Designated country EP (AT, BE, CH, CY, DE, DK) , ES, FI, FR, GB, GR, IE, IT, LU, MC, NL, PT, SE, TR), OA (BF, BJ, CF, CG, CI, CM, GA, GN, GW, ML) , MR, NE, SN, TD, TG), AP (GH, GM, KE, LS, MW, MZ, SD, SL, SZ, TZ, UG, ZW), EA (AM, AZ, BY, KG, KZ, MD, RU, TJ, TM), AE, AL, AM, AT, AU, AZ, BA, BB, BG, BR, BY, CA, CH, CN, CR, CU, CZ, E, DK, DM, EE, ES, FI, GB, GD, GE, GH, GM, HR, HU, ID, IL, IN, IS, JP, KE, KG, KP, KR, KZ, LC, LK , LR, LS, LT, LU, LV, MA, MD, MG, MK, MN, MW, MX, NO, NZ, PL, PT, RO, RU, SD, SE, SG, SI, SK, SL, TJ, TM, TR, TT, TZ, UA, UG, UZ, VN, YU, ZA, ZWF F-term (reference) 5G066 AA03 AA05 AE09 HA17 HB02

Claims (60)

[Claims] 1. A method of planning a device that consumes a short-lived indistinguishable product based on a knowledge interval set including at least one knowledge interval of the short-lived indistinguishable product in a time interval, including cost. Therefore, the step of determining the necessity of the indistinguishable product with the short life span over the planning time interval and the step of determining the product with the short life span over the planning time interval in order to create the device operation schedule. Examining the set of knowledge intervals based on need. 2. The method further comprising: in the knowledge interval set, creating a first knowledge interval of the short-lived indistinguishable product at a first time interval that includes a first cost. The method described in 1. 3. The step of creating the first knowledge interval includes receiving a knowledge interval creation message to create a received knowledge interval creation message, and based on the received knowledge interval creation message. Creating said first knowledge interval of said short-lived indistinguishable goods at said first time interval, including said first cost, in said knowledge interval set. the method of. 4. The step of creating the first knowledge interval creates a processed knowledge interval for the short-lived indistinguishable product at the first time interval, including the first cost. The step of processing the received knowledge interval creation message, and the processed knowledge interval of the short-lived indistinguishable merchandise at the first time interval, including the first cost. 4. The method of claim 3, including as a first knowledge interval of the short-lived indistinguishable merchandise at the first time interval, including the cost of: in the knowledge interval set. 5. The knowledge interval set includes the second knowledge interval of the short-lived indistinguishable product at the first time interval, including the second cost, and the first knowledge. The method of claim 3, wherein creating an interval comprises replacing the second knowledge interval with the first knowledge interval in the knowledge interval set. 6. The first of the knowledge intervals of the short-lived indistinguishable product in the time interval set, wherein the knowledge interval set further comprises at least one time interval and includes costs. The method of claim 3 including. 7. The first of the knowledge intervals of the short-lived indistinguishable product in the time interval set, wherein the knowledge interval set further comprises at least two time intervals and includes costs. 7. The method of claim 6 including. 8. The knowledge interval set is the first of the knowledge intervals of the short-lived indistinguishable merchandise at the second of the time intervals that includes the second of the costs. The second time interval includes more than the first time interval, and the step of creating the first knowledge interval includes the remaining time intervals collectively. Determining the remaining time interval set of at least one of the remaining time intervals so as to accurately include the second time interval that is not included in the first time interval; Replacing the second time interval of the knowledge interval with the remaining time interval set in the knowledge interval set And inserting the first knowledge interval of the short-lived indistinguishable product at the first time interval, including the first cost. . 9. The knowledge interval set is the first of the knowledge intervals of the short-lived indistinguishable merchandise at the second of the time intervals that includes the second of the costs. Two, the first time interval includes more than the second time interval, and the step of creating the first knowledge interval includes converting the second knowledge interval to the second knowledge interval. 7. The method of claim 6, including the step of removing from a knowledge interval. 10. The method further comprises removing the first knowledge interval of the short life indistinguishable product at the first time interval, including the first cost, from the knowledge interval set. The method of claim 2. 11. The step of removing the first knowledge interval includes receiving a remove knowledge interval message to create a received knowledge interval removal message, and based on the received knowledge interval removal message, Removing the first knowledge interval of the short life indistinguishable product at the first time interval, including a first cost, from the knowledge interval set. Method. 12. A method comprising the step of constructing real time, and the step of removing the first knowledge interval is preceded by the real time of the first time interval of the first knowledge interval. And the step of determining. And whenever the first time interval of the first knowledge interval precedes the real time, including the first cost, the short life indistinguishable product at the first time interval. 11. The method of claim 10, further comprising: removing the first knowledge interval of the from the set of knowledge intervals. 13. A knowledge containing create_knowledge_interval and remove_knowledge_interval in a step of receiving a first knowledge message and a step of processing the first received knowledge message to create a first received knowledge message. In order to create a message type that belongs to the message type set, the step of examining the first received knowledge message and the message type of the first received knowledge message are create_knowl
Whenever edge_interval, based on the first received knowledge message, within the knowledge interval set, the first of the short life indistinguishable merchandise at the first time interval that includes the first cost. The step of creating one knowledge interval and the message type of the first received knowledge message is remove_knowl
Whenever edge_interval, based on the first received knowledge message, within the knowledge interval set, the corresponding short-lived indistinguishable merchandise at the first time interval, including the first cost. 11. The method of claim 10, further comprising: removing a first knowledge interval. 14. The step of examining the first received knowledge message further comprises: processing the first received knowledge message to create a message type that includes at least one element of the knowledge message type set. The step of creating a first knowledge interval, further comprising the step of examining, and further, the message type of the first received knowledge message is create_knowl
Whenever edge_interval is included, based on the first received knowledge message, within the knowledge interval set, including the first cost, the first of the short-lived indistinguishable products at the first time interval. Creating a knowledge interval, and removing the first knowledge interval, further comprising: removing_knowl the message type of the first received knowledge message.
Whenever the edge_interval is included, the relevant short-lived indistinguishable product at the first time interval, including the first cost, within the knowledge interval set based on the first received knowledge message. 14. The method of claim 13 including removing the first knowledge interval. 15. The method of claim 2, further comprising maintaining a bid interval set of bid intervals for the short-lived indistinguishable items, each of which includes a bid price, a bid quantity, and a bid time interval. the method of. 16. Maintaining the set of bid intervals further comprises the bid quantity as the first bid quantity, the bid price as the first bid price, and the bid time interval as the first bid quantity. Placing a first bid of a first bid quantity at a first bid price for the first time interval to create a first bid of the set of bid intervals including a time interval; The committed bid of the set of bid intervals including the first bid quantity as the bid quantity, the first bid price as the bid price, the first time interval as the bid time interval, and the committed flag. Committing the first bid interval to create the first bid interval, including: Each of the knowledge intervals of the knowledge interval set further includes a quantity of the short-lived indistinguishable product, and the step of creating the first knowledge interval is the first committed bid interval of the bid interval set. 16. The method of claim 15 including the step of creating the first knowledge interval of the knowledge interval set based thereon. 17. The step of creating the first knowledge interval further comprises setting the amount of the first knowledge interval according to the first bid amount of the first committed bid interval. , Setting the first time interval of the first knowledge interval with the first bid time interval of the first committed bid interval, and the relevant first bid interval of the first committed bid interval. 18. The method of claim 16, comprising setting the first cost of the first knowledge interval with a first bid price. 18. The step of determining the need for the short-lived indistinguishable product further comprises the step of creating a need for the short-lived indistinguishable product over the planning time interval including a quantity. 17. The method of claim 16 including the step of examining a facility usage set that includes facility usage entries, each of which includes a delivery date and a need schedule for a short-lived indistinguishable product. 19. The need for the short life indistinguishable product over the planning time interval further includes a cost limit, and the first bidding step further comprises the short life indistinguishable product. At the first bid price for the first time interval to create the first bid for the first bid quantity at the first bid price for the first time interval of 19. The method of claim 18, comprising placing the first bid of the first bid quantity of. 20. In order to create the device operation schedule, the planning time,
Based on the need for the short-lived indistinguishable merchandise over intervals, the step of investigating the knowledge interval includes equipment that includes start-up time and actions that belong to a set of actions that include start actions, stop actions, and throttle actions. 20. The method of claim 19, including the step of determining an equipment usage plan that includes usage items. 21. Consuming the short-life indistinguishable product based on the knowledge interval including at least one of the knowledge intervals of the short-life indistinguishable product in the time interval, including the cost. A method for controlling the device, the method for planning the device consuming the short-life indistinguishable goods according to claim 20 for creating the device operation schedule, and the method for controlling the device based on the device operation schedule. A step of operating the device, the method comprising: 22. Based on the device operation schedule, the step of operating the device starts the device based on the device operation schedule, the step of stopping the device based on the device operation schedule, and the step of operating the device based on the device operation schedule. 22. The method of claim 21, including the step of throttling the device, and at least one step in the set comprising. 23. A step of operating the device, based on the device operation schedule, a step of starting the device, a step of stopping the device based on the device operation schedule, and a step of operating the device based on the device operation schedule. 23. The method of claim 22, comprising throttling the device. 24. The step of starting the device includes the step of starting the device based on the at least one of the equipment usage items of the equipment usage plan including a start action, and stopping the device. The step includes the step of stopping the device based on at least one of the equipment use items of the equipment use plan including the stop action, and the step of throttling the device includes the facility use plan including the throttle action. 24. The method of claim 23, including the step of throttling the device based on at least one of the equipment usage items of. 25. The facility use item including the throttle action further includes a throttle setting, and the step of throttling the device further includes the facility use item of the facility use plan including the throttle action and the throttle setting. 25. The method of claim 24, including the step of throttling the device based on at least one of: 26. The facility use item including the start action further includes throttle setting, and the step of starting the device further includes the facility use item of the facility use plan including the start action and the throttle setting. 25. The method of claim 24, including the step of throttling the device based on at least one of: 27. The device distinguishes the short life based on the knowledge interval set including at least one of the knowledge intervals of the short life indistinguishable product at the time interval including the cost. At least one of the short-lived indistinguishable products at the time interval that includes a device set that includes at least two devices that consume non-available items, and that further includes the cost to create the device set operation schedule. A method of planning the device that consumes the short-life indistinguishable merchandise based on the knowledge interval set of one relevant knowledge interval; and a step of operating the device set based on the device set operation schedule. 23. The method of claim 22, comprising: 28. The step of operating the device set further comprises starting at least one of the devices of the device set based on the device operation schedule, and the device based on the device operation schedule. 28. The method of claim 27, comprising: stopping at least one of the devices in the set; and throttling at least one of the devices in the device set based on the device operation schedule. 29. The method of claim 21, further comprising measuring consumption by the device of the short-lived indistinguishable merchandise. 30. The method of measuring consumption by the device further comprises measuring the consumption rate by the device of the indistinguishable goods of the short life within the measurement time interval; Determining the cost of the short life indistinguishable product within the measurement time interval based on the knowledge time interval set to create a measured cost coefficient for the short life indistinguishable product; , The consumption rate of the device for the short-life indistinguishable product at the measurement time interval to create a consumption cost for the device consuming the short-life indistinguishable product over the measurement time interval. Based on, and during the measurement time interval 30. The method of claim 29, comprising calculating a cost of consumption of the device based on the measured cost factor of the short-lived indistinguishable goods based on Tabal. 31. The step of measuring consumption by the device further comprises maintaining a cumulative cost for the device of the short life indistinguishable product and the short life indistinguishable product over the measurement time interval. 31. Updating the cumulative cost for the device of the short-lived indistinguishable merchandise based on the cost of consumption for the device consuming. 32. The device consumes a second short-lived indistinguishable product, and the method of planning the device further comprises the cost of the short-lived indistinct merchandise. To a second knowledge interval set that includes at least one knowledge interval of the second short-lived indistinguishable product at a time interval that includes at least one knowledge interval and that includes a cost. A step of determining the need for the short life indistinguishable product, including the method of planning the device consuming the short life indistinguishable product and the second short life indistinguishable product, Furthermore, the second short life product that cannot be distinguished over the planning time interval. Wherein the step of determining the need, and in order to create the device operation schedule, the step of investigating the knowledge interval set further in order to create the device operation schedule, the planning time
Claiming the step of examining the knowledge interval set based on the need for the short life indistinguishable product over an interval and the need for the second short life indistinguishable product over the planning time interval. The method according to item 1. 33. The device generates a second short-lived indistinguishable product and the method of planning the device further comprises the cost of the short-lived indistinguishable product in a time interval. Based on said knowledge interval set containing at least one knowledge interval, and based on a second knowledge interval set containing at least one knowledge interval of said second short-lived indistinguishable product at a time interval containing prices. Determining the need for the short life indistinguishable product, including the method of consuming the short life indistinguishable product and planning the device to generate the second short life indistinguishable product. In addition, the second short life span over the planning time interval is indistinguishable. The step of examining the set of knowledge intervals to create the device operation schedule, and the step of examining the knowledge interval set over the planning time interval to create the device operation schedule. The method of claim 1, comprising examining the knowledge interval set based on a short-lived indistinguishable product need and the second short-lived indistinguishable product need. 34. The method wherein the device carries a second short-lived indistinguishable product and the method for planning the device further comprises the cost of the short-lived indistinguishable product at a time interval. Based on said knowledge interval set containing at least one knowledge interval, and based on a second knowledge interval set containing at least one knowledge interval of said second short-lived indistinguishable product at a time interval containing prices. Determining the need for the short life indistinguishable product, including the method of consuming the short life indistinguishable product and planning the device to generate the second short life indistinguishable product. In addition, the second short life span over the planning time interval is indistinguishable. The step of examining the set of knowledge intervals to create the device operation schedule, and the step of examining the knowledge interval set over the planning time interval to create the device operation schedule. The method of claim 1, comprising examining the knowledge interval set based on a short-lived indistinguishable product need and the second short-lived indistinguishable product need. 35.   The method of claim 1, wherein the short-lived indistinguishable item is electricity. 36. The method of claim 35, wherein the short-lived indistinguishable item belongs to a set that includes DC electricity and AC electricity. 37. A program operating system supporting the method of claim 1, wherein the program steps reside in coupled accessible computer memory coupled to at least one computer of a computing system, Indistinguishable of the short life span across the planning time interval and program steps that support the step of determining the need for the product and the indistinct life span of the planning time interval to create the device operation schedule. A program operating system comprising program steps that support the step of exploring the knowledge interval set based on product needs. 38. A program operating system comprising at least one computer having accessible coupled computer memory, the program operating system comprising program steps residing in the accessible coupled computer memory of the computer spanning a planning time interval. Based on the program steps supporting the steps of determining the need for short life indistinguishable products and the need for the short life indistinguishable products over the planning time interval to create the device operation schedule. A computing system supporting the method of claim 1, comprising: a program step supporting the step of exploring the knowledge interval set. 39. Consume a short life indistinguishable product based on a knowledge interval set comprising at least one of the knowledge intervals of the short life indistinguishable product at the time interval, including the cost. A control system for controlling a device, comprising a computing system further comprising at least one computer having accessible coupled memory comprising program steps of a program operating system, the program operating system comprising a planning time interval. Program steps to determine the need for such a short life indistinguishable product and the short life indistinguishable quotient over the planning time interval to create the device operation schedule. Control system based on the needs of the comprises a program steps to investigate the knowledge interval set, and the program steps for operating the device based on the device operation schedule, the. 40. The program operating system further creates, in the knowledge interval set, a first knowledge interval of the short-lived indistinguishable product at a first time interval, including a first cost. A program step that receives a knowledge interval creation message to create a received knowledge interval creation message containing the short life indistinguishable product at the first cost at the first time interval A program for creating the first knowledge interval of the short-life indistinguishable product at the first time interval, including the first cost, based on the step and the received knowledge interval creation message. . And a program step having No 39. Control system according. 41. The program operating system further comprises programming a bid interval set of bid intervals for the short-lived indistinguishable items, each of which includes a bid price, a bid quantity, and a bid time interval. The control system according to claim 40. 42. Program steps supporting the step of maintaining the set of bid intervals further include: the first bid quantity as the bid quantity, the first bid price as the bid price, and the bid time. A first bid of a first bid quantity at a first bid price for a first time interval to create a first bid of the bid interval set that includes the first time interval as an interval. Including the program step for performing the bid quantity, the first bid quantity as the bid quantity, the first bid price as the bid price, the first time interval as the bid time interval, and the committed flag. To create a committed first bid interval for the bid interval set, the first bid event is created. A program step for committing a tabal, each of the knowledge intervals in the set of knowledge intervals further including the quantity of the indistinguishable merchandise, and a program step for creating the first knowledge interval. , Further creating a first knowledge interval of the knowledge interval set based on the first committed bid interval of the bid interval set.
42. The control system of claim 41 including steps. 43. A program step supporting the step of determining the need for the short-lived indistinguishable product further creates a need for the short-lived indistinct product over the time interval including quantity. 43. The control system of claim 42, further comprising: a program step for investigating an equipment usage set that includes equipment usage entries each including a delivery date and a need schedule for the short-lived indistinguishable product. 44. The need for the short life indistinguishable merchandise over the time interval further comprises a cost limit, and a program step supporting the step of placing the first bid further comprises: Based on the need for indistinguishable merchandise with the short life span over the time interval, including the cost limit, the bid volume is the first bid quantity, the bid price is the first bid price, and the bid is The first bid at the first bid price for the first time interval to create the first bid for the bid interval set that includes the first time interval as a time interval. 44. The control system of claim 43, including program steps for placing the first bid of a quantity. 45. A facility use plan, wherein the program step for investigating the knowledge interval set further includes a facility use item including a start time and an action belonging to an action set including a start action, a stop action, and a throttle action. 45. The control system of claim 44 including program steps for determining. 46. A program step of operating the device, a program step of starting the device based on the device operation schedule, a program step of stopping the device based on the device operation schedule, 40. The control system of claim 39, comprising at least one of the set comprising: a program step of throttling the device based on a device operation schedule. 47. A program step for operating the device, further comprising: a program step for starting the device based on the device operation schedule; and a program step for stopping the device based on the device operation schedule. 47. The control system of claim 46, comprising: a program step of throttling the device based on the device operation schedule. 48. The device distinguishes the short life based on the knowledge interval set including at least one of the knowledge intervals of the short life indistinguishable product at the time interval, including the cost. A program step that includes a device set that includes at least two devices that consume non-commodity goods, and further develops a device set operation schedule to create a device set operation schedule.
The program operating system further comprises a program step for investigating the knowledge interval set based on the need for the short life indistinguishable merchandise over an interval, and the program operating system further based on the device set operating schedule. 47. The control system of claim 46, including program steps for operating the set. 49. The control system of claim 39, wherein the program operating system further comprises program steps for measuring consumption by the device of the short-lived indistinguishable goods. 50. A program step supporting the step of measuring consumption further comprises: a program step for measuring a consumption rate by the device of the short-lived indistinguishable product within a measurement time interval; The cost of the short-life indistinguishable product within the measurement time interval, based on the knowledge time interval set, in order to create the measured cost coefficient of the short-life indistinguishable product during the time interval. To determine the consumption of the device that consumes the short-life indistinguishable product over the measurement time interval in order to create a consumption cost for the device. Based on the device's consumption rate of the device and 50. The control according to claim 49, further comprising a program step of calculating a consumption cost of the device based on the measurement cost coefficient of the short-life indistinguishable product based on the measurement time interval during a constant time interval. system. 51. A program step supporting the step of measuring consumption further comprises a program step of maintaining a cumulative cost for the device of the short-lived indistinguishable product and the program step over the measurement time interval. 51. The control system according to claim 50, further comprising: a program step of updating a cumulative cost of the device of the short life indistinguishable commodity based on the consumption cost of the device consuming the life indistinguishable commodity. 52. The device consumes a second short-lived indistinguishable product and the knowledge interval set includes at least one knowledge interval of the short-lived indistinguishable product at a time interval including costs. And a at least one knowledge interval of the second short-life indistinguishable product at the time interval, including a second cost, and a program for determining the necessity of the short-life indistinguishable product.・ Step
In addition, a program step is included to determine the need for the short life indistinguishable product over the planning time interval and the second short life indistinguishable product need, and to create a device operation schedule. A program step supporting the step of exploring the knowledge interval set based on the need for the short life indistinguishable product over the planning time interval, and further to create the device operation schedule. , The planning time
Claims including program steps including program steps for examining the knowledge interval set based on the need for the short life indistinguishable product and the need for the second short life indistinguishable product across intervals Item 39. The control system according to Item 39. 53. The device generates a second short-lived indistinguishable product, the knowledge interval set including costs of the short-lived indistinguishable product at a time interval. And a second one of said knowledge intervals of said second short-lived indistinguishable merchandise at overlapping time intervals including prices, which further comprises A program operating system for planning the device consuming the short-life indistinguishable merchandise, further based on the first knowledge interval and the second knowledge interval. The device that consumes the second indistinguishable product and produces the second short-lived indistinguishable product. A program step that includes the program operating system to support the step of determining the need for the short-lived indistinguishable merchandise over the planning time interval, and further the second step over the planning time interval. Program steps that determine the need for short-lived indistinguishable merchandise and that support the step of exploring the knowledge interval set are further configured to generate the device operation schedule. 40. The computing of claim 39, including the step of examining the knowledge interval set based on the need for the short-lived indistinct merchandise over time and the need for the second short-lived indistinct merchandise. system. 54. The device carries a second short-lived indistinguishable product and the knowledge interval set includes costs of the short-lived indistinguishable product at a first overlapping time interval. Further comprising at least one knowledge interval and a second knowledge interval of said second short-lived indistinguishable product at a second overlapping time interval including price, said first overlapping time interval And the second overlapping time interval overlaps with the planning time interval, and the program step of determining the need for the short life indistinguishable product over the planning time interval further comprises: A professional who determines the need for the second short life indistinguishable product over the time interval. A program step that includes a ram step and investigates the knowledge interval set further includes the need for the short-lived indistinguishable product over the planning time and the second step to create a device operation schedule. 40. The computing system of claim 39, including program steps for examining the knowledge interval set based on the short-lived indistinguishable merchandise need. 55. The computing system of claim 39, wherein the short-lived indistinguishable item is electricity. 56. The computing system of claim 55, wherein the short-lived indistinguishable item is a member of a set that includes DC electricity and AC electricity. 57. A method of planning a device for generating a short life indistinguishable product based on a knowledge interval set including at least one knowledge interval of a short life indistinguishable product in a time interval including a price. There is a step of determining the necessity of the indistinguishable product with the short life span over the planning time interval, and the need for the indistinguishable product with the short life span over the planning time interval in order to create the device operation schedule. A step of examining the knowledge interval set based on gender, and wherein the short-lived indistinguishable item is a member of the set including DC electricity and AC electricity. 58. Planning a device that produces a short life indistinguishable product based on a knowledge interval set including at least one knowledge interval of the short life indistinguishable product in a time interval including a price. A supporting computing system comprising at least one computer having associated accessible computer memory, the program residing in the accessible associated computer memory coupled to at least one computer of the computing system. A program operating system that includes steps determines the program steps that determine the need for such short-lived indistinguishable products over a planning time interval, and a device operation schedule. In order to achieve this, the short-life indistinguishable product comprises a program step of investigating the knowledge interval set based on the need for the short-life indistinguishable product over the planning time interval. , A computing system that is a member of a collection that includes DC electricity and AC electricity. 59. A method of planning a device carrying a short life indistinguishable product based on a knowledge interval set including at least one knowledge interval of a short life indistinguishable product in a time interval including a price. There is a step of determining the necessity of the indistinguishable product with the short life span over the planning time interval, and the need for the indistinguishable product with the short life span over the planning time interval in order to create the device operation schedule. A step of examining the knowledge interval set based on gender, wherein the short-lived indistinguishable product is a member of the set including DC electricity and AC electricity. 60. Planning a device for carrying said short life indistinguishable goods based on a knowledge interval set comprising at least one knowledge interval of the short life indistinguishable goods in a time interval including price. A supporting computing system comprising at least one computer having associated accessible computer memory, the program residing in the accessible associated computer memory coupled to at least one computer of the computing system. A program operating system that includes steps determines the program steps that determine the need for such short-lived indistinguishable products over a planning time interval, and a device operation schedule. A computing system including: a program step for investigating the knowledge interval set based on the need for the short-lived indistinguishable product over the planning time interval; and A computing system in which the short-lived indistinguishable item is a member of a set that includes DC electricity and AC electricity.