Sas Institute Inc.

Tugrul Sanli

Xiaodong Yao

Kevin L Scott

Matthew Scott Maxwell

Feng Chen, Ii

Bingfeng Ding

Metin Balikcioglu

Feng (Jason) Chen

Shengkuei Lin

Exemplary embodiments relate to the problem of allocating a finite number of units of a resource among requestors willing to offer different amounts of value for the resource. When different classes of requestors are permitted to cancel the request or fail to show up to collect the unit of the resource with different probabilities (collectively referred to as 'wash'), the problem becomes difficult to solve efficiently. According to the procedures described herein, the capacity is artificially inflated to offset the impact of wash, and then protection levels are computed using the inflated capacity as if there was no wash. The capacity is then artificially inflated again based on the new protection levels, and the process is repeated until, e.g., the results converge. Using this procedure, overallocation limits and protection levels can be computed in real-time, and accordingly the resource can be allocated efficiently as new requests are received.

Two-part job scheduling with capacity constraints and preferences

In one example, a system can receive configuration data indicating how resources can be combined, identify availability data indicating the total number of various resources that are available, and determine maximum-capacity data using the availability data and the configuration data. The system can also receive distribution data having probability distributions for jobs to be implemented using the resources, determine capacity valuations using the distribution data and the availability data, and determine a configuration of resources using the capacity valuations and the maximum-capacity data. Thereafter, the system can receive a job and determine that a valuation for the job exceeds a predefined threshold associated with using the configuration of resources. In response to determining that the valuation exceeds the predefined threshold, the system can assign the resources to the job in the configuration. The system can then cause the job to be performed using the configuration of resources assigned to the job.

Managing resources in a configurable computing environment

Exemplary embodiments are generally directed to methods, mediums, and systems for accounting for extensions or reductions of the period for which a resource (e.g., computer processor time, scientific apparatus, storage units, devices, etc.) is allocated. According to exemplary embodiments, allocation-based aggregated effects of extension and relinquishment are modeled. The modeled effects are used to offset allocation forecasts based on historical data. As a result, the dimensionality of the problem of incorporating in-house data is greatly reduced as compared to other techniques, and allocation forecasts can be made more accurately and efficiently.

Computer-implemented system for modeling an allocated resource

Exemplary embodiments are generally directed to methods, mediums, and systems for correcting censored or constrained historical data with various possible types of computing devices, including cloud-based devices, personal computing devices, and edge-based devices. The corrected data may be used in forecasting, for example to forecast demand for a limited resource. In some embodiments, the data is modeled at a higher level of granularity than an individual record. The aggregated demand may then be pro-rated over a group of categories or users where a given category of users that might be small or nonexistent over a certain time frame may be better accommodated. Moreover, it may be easier or more efficient to make assumptions and employ computing resources at the aggregate level.

Computer-implemented system for hierarchical unconstraining in data processes

Computer-implemented systems and methods generate a near-optimum product markdown plan for a plurality of uniform pricing levels having a required inventory sell-through target over all of the plurality of uniform pricing levels. A plurality of feasible markdown schedules are generated for the uniform pricing level, where each of the plurality of feasible markdown schedules meets all individual constraints for the uniform pricing level. All dominated feasible markdown schedules are removed for the uniform pricing level to generate one or more candidate markdown schedules for the uniform pricing level. A near-optimum product markdown plan is generated, where generating the near-optimum product markdown plans includes executing a limited exact algorithm solver for a plurality of iterations, and executing a dynamic programming solver if no product markdown plan generated by the limited exact algorithm solver is within the threshold percentage of the revenue upper bound.

Systems and methods for markdown optimization when inventory pooling level is above pricing level

Computer-implemented systems and methods for identifying markdown prices for items. As an example, a system and method can include identifying for each item an optimal markdown plan containing a markdown price for the item. Also, the method and system can be configured to identify for each item an optimal delay plan. For each item, a delay cost and a markdown spend are calculated, and a comparison is performed of the item's delay cost with respect to the item's markdown spend. The comparison is used to determine whether to mark down an item based upon the item's determined markdown price.

Growing community of inventors

Cary, NC, United States of America

Tugrul Sanli