Abstract: A method is described that involves providing a persisted quantity for a time series time interval to a first transaction, then, providing the same persisted quantity to a second transaction that operates in parallel with the first transaction. The second transaction is not permitted to change the persisted quantity. The method also involves replacing the persisted quantity with a second persisted quantity within the time series. The second persisted quantity is determined by the first transaction. The method also involves writing a persisted quantity change for the time series time interval. The persisted quantity change is determined by the second transaction.

Abstract: A method is described that involves providing a persisted quantity for a time series time interval to a first transaction, then, providing the same persisted quantity to a second transaction that operates in parallel with the first transaction. The second transaction is not permitted to change the persisted quantity. The method also involves replacing the persisted quantity with a second persisted quantity within the time series. The second persisted quantity is determined by the first transaction. The method also involves writing a persisted quantity change for the time series time interval. The persisted quantity change is determined by the second transaction.

Abstract: A method is described that involves providing a persisted quantity for a time series time interval to a first transaction, then, providing the same persisted quantity to a second transaction that operates in parallel with the first transaction. The second transaction is not permitted to change the persisted quantity. The method also involves replacing the persisted quantity with a second persisted quantity within the time series. The second persisted quantity is determined by the first transaction. The method also involves writing a persisted quantity change for the time series time interval. The persisted quantity change is determined by the second transaction.

Abstract: Baseline data may be generated, including copying selected data from a planning database. Modifying requests associated with changes to a derived simulation may be received, and affected entries within the baseline data that are affected by the modifying requests may be determined. Simulation entries may be stored within a derived simulation dataset, the simulation entries corresponding to the affected entries within the baseline data. A mapping may be provided between the simulation entries within the derived simulation dataset and the affected entries within the baseline data. The derived simulation may be provided in response to the modifying requests and based on the mapping.

Abstract: Baseline data may be generated, including copying selected data from a planning database. Modifying requests associated with changes to a derived simulation may be received, and affected entries within the baseline data that are affected by the modifying requests may be determined. Simulation entries may be stored within a derived simulation dataset, the simulation entries corresponding to the affected entries within the baseline data. A mapping may be provided between the simulation entries within the derived simulation dataset and the affected entries within the baseline data. The derived simulation may be provided in response to the modifying requests and based on the mapping.

Abstract: A method is described that involves locking a capacity demand profile of a resource for the use of a transaction. The method also involves obtaining a portion of the locked capacity demand profile. The portion describes the capacity demand profile over a time interval in which a locked out transaction desired to implement a change to the capacity demand profile prior to the locking. The method involves implementing the change to the portion to form a changed portion. The method also involves, after the implementing, implementing a second change to the changed portion. The second change is desired by the transaction.

Abstract: After a transaction modifying a planning area in a planning system is initiated, it is determined whether there are any change objects in a consistent view of the transaction that are associated with the planning area. If there is a single change object associated with the planning area, then, the logical state of such change object is read. Alternatively, if there is more than one change object for the planning area, it is determined that the planning area must be replanned. Related apparatus, systems, methods, and articles are also described.

Abstract: A data model for a supply chain is provided whereby individual working steps in a production process are defined as activities, and organized groups of such activities are defined as orders. Activities are allocated to no more than one resource and contain information concerning the start and finish time for the activity, any resource on which the activity is currently scheduled, and a list of alternative resources, if any. Activities are linked to each other via auxiliary objects, which contain information concerning the minimum and maximum time between activities. Orders may contain input and/or output interface nodes, representing the materials consumed and produced by the order. Each output interface node representing a quantity of material created from one order is linked via an auxiliary object to respective input interface node or nodes from other orders that are scheduled to receive that material.

Abstract: Updating metadata for a set of time series quantity data, and re-creating the set of time series quantity data in response to updating the metadata while reading at least one of the set of time series quantity data.

Abstract: After a transaction modifying a planning area in a planning system is initiated, it is determined whether there are any change objects in a consistent view of the transaction that are associated with the planning area. If there is a single change object associated with the planning area, then, the logical state of such change object is read. Alternatively, if there is more than one change object for the planning area, it is determined that the planning area must be replanned. Related apparatus, systems, methods, and articles are also described.

Abstract: A method is described that involves providing a persisted quantity for a time series time interval to a first transaction, then, providing the same persisted quantity to a second transaction that operates in parallel with the first transaction. The second transaction is not permitted to change the persisted quantity. The method also involves replacing the persisted quantity with a second persisted quantity within the time series. The second persisted quantity is determined by the first transaction. The method also involves writing a persisted quantity change for the time series time interval. The persisted quantity change is determined by the second transaction.

Abstract: A system and method are described for performing bucket-oriented capacity checks on resources to determine whether activities can be processed prior to a desired delivery date.

Abstract: A method is described that involves locking a capacity demand profile of a resource for the use of a transaction. The method also involves obtaining a portion of the locked capacity demand profile. The portion describes the capacity demand profile over a time interval in which a locked out transaction desired to implement a change to the capacity demand profile prior to the locking. The method involves implementing the change to the portion to form a changed portion. The method also involves, after the implementing, implementing a second change to the changed portion. The second change is desired by the transaction.

Abstract: A data model for a supply chain is provided whereby individual working steps in a production process are defined as activities, and organized groups of such activities are defined as orders. Activities are allocated to no more than one resource and contain information concerning the start and finish time for the activity, any resource on which the activity is currently scheduled, and a list of alternative resources, if any. Activities are linked to each other via auxiliary objects, which contain information concerning the minimum and maximum time between activities. Orders may contain input and/or output interface nodes, representing the materials consumed and produced by the order. Each output interface node representing a quantity of material created from one order is linked via an auxiliary object to respective input interface node or nodes from other orders that are scheduled to receive that material.