Abstract: Evaluating node fulfillment capacity in node order assignment by receiving a current order for node order assignment, retrieving data of each node, the retrieved data of each node including current capacity utilization, determining a probability of backlog on an expected ship date of each node, the probability of backlog being based on the retrieved current capacity utilization, determining a capacity utilization cost of each node based on the probability of backlog on the expected ship date, automatically calculating a fulfillment cost of each node of the current order based on the capacity utilization cost, identifying one or more nodes for the current order with the lowest fulfillment cost and automatically generating a node order assignment assigning the current order to one of the one or more nodes with the lowest fulfillment cost.

Abstract: Embodiments herein describe a return network simulation system that can simulate changes in a retailer's return network to determine the impact of those changes. Advantageously, being able to accurately simulate the retailer's return network means changes can be evaluated without first making those adjustments in the physical return network. Doing so avoids the cost of implementing the changes on the return network without first being able to predict whether the changes will have a net positive result (e.g., a positive result that offsets any negative results). A retailer can first simulate the change on the return network, review how the change affects one or more KPIs, and then decide whether to implement the change in the actual return network. As a result, the retailer has a reliable indicator whether the changes will result in a desired effect.

Abstract: The embodiments herein provide techniques for selecting an optimal return location from a plurality of candidate return locations for returning an item based on an expected recovery associated with each location. As discussed above, using predesignated return location(s) ignores many factors that can increase costs that affect returning items such as shipping costs, inventory, handling costs, operational transfer costs, as well as several predicted costs. Further, these techniques do not consider expected future revenue (which can offset these costs). In one embodiment, a net expected recovery is determined for each location using the costs and future revenues discussed above. By comparing the net expected recovery associated with each candidate return location, the optimal return location can be identified.

Abstract: An example operation may include one or more of collecting, by a first node, a plurality of permissioned data inputs from a plurality of second nodes of a supply-chain, performing, by the first node, a granular simulation based on the permissioned data inputs to generate a plurality of key performance indicators (KPIs), and executing a smart contract to adjust order processes of the supply-chain based on the KPIs.

Abstract: An example operation may include one or more of collecting, by a first node, a subset of data inputs from a plurality of second nodes over a blockchain underlying a supply-chain, executing, by the first node, a smart contract to simulate a state of the supply-chain based on the subset of the data inputs, and generating, by the first node, at least one policy decision based on the simulated state of the supply-chain.

Abstract: An example operation may include one or more of receiving, by a retailer node, an encrypted inventory of goods data from a plurality of supplier nodes over a blockchain network, computing, by the retailer node, an ordering proportion based on the encrypted inventory of goods data, generating, by the retailer node, an ordering policy based on the ordering proportion, and executing a smart contract to order goods from the plurality of the supplier nodes based on the ordering policy.

Abstract: An example operation may include one or more of receiving, by a first node, a freshness of goods data from a second node over a blockchain, and executing, by the first node, a smart contract to: calculate an initial order quantity based on a pre-set critical order number and a non-expiring goods order quantity and alter a final order quantity based on the initial order quantity and the freshness of the goods data.

Abstract: An example operation may include one or more of acquiring, by a retailer node, an inventory data from a supplier node over a blockchain network, receiving, by the retailer node, outstanding orders data of the supplier node, generating, by the retailer node, an order distribution policy based on the inventory data and the outstanding orders data, and executing a smart contract to order goods from the supplier node based on the ordering policy.

Abstract: Staffing is allocated by expressing a risk of violating a service level agreement for a given service line as a function of a number of full-time equivalents allocated to the given service line and a number of service tickets received at the given service line per unit of time per ticket severity level. The number of service tickets are processed by the number of full-time equivalents allocated to the given service line. Risks are summed across a plurality of distinct service lines to generate a total risk. Total risk is minimized by adjusting the number of full time equivalents allocated to each given service line across all services lines subject to a pre-determined reduction in total cost to process all service tickets by the number of full-time equivalents across all service lines and a pre-determined range of a permissible number of full-time equivalents for each service line.

Abstract: A method for continuously tracking business performance impact of order sourcing systems and algorithms that decide how ecommerce orders should be fulfilled by assigning the items of the order to nodes in a fulfillment network such as stores, distribution centers, and third party logistics—to provide automatic root cause analysis and solution recommendations to pre-defined business problems arising from KPI monitoring. A Business Intelligence (BI) dashboard architecture operates with: 1) a monitoring module that continuously monitors business KPIs and creates abnormality alerts; and 2) a root cause analysis module that is designed specifically for each business problem to give real time diagnosis and solution recommendation. The root cause analysis module receives the created alert, and triggers conducting a root cause analysis at an analytics engine. The BI dashboard and user interface enables visualization of the KPI performance and root cause analysis results.

Abstract: Techniques for facilitating estimation of node processing capacity values for order fulfillment are provided. In one example, a computer-implemented method can comprise: generating, by a system operatively coupled to a processor, a current processing capacity value for an entity; and determining, by the system, a future processing capacity value for the entity based on the current processing capacity value and by using a future capacity model that has been explicitly trained to infer respective processing capacity values for the entity. The computer-implemented method can also comprise fulfilling an order of an item, by the system, based on the future processing capacity value.

Abstract: A method and system for considering customized capacity utilization cost in node order fulfillment. The method includes receiving by a customized capacity utilization cost module an electronic record of a current order. The method includes retrieving data of a plurality of nodes and calculating an actual capacity utilization. The method includes automatically converting the actual capacity utilization of each node of the plurality of nodes and a predetermined maximum amount of cost to balance capacity utilization across the plurality of nodes into a customized capacity utilization cost, and transmitting the customized capacity utilization cost to an order fulfillment engine. The method includes receiving by the order fulfillment engine the current order, the processing cost data, and the customized capacity utilization cost. The method includes automatically calculating a fulfillment cost and identifying a node-order assignment with the lowest fulfillment cost.

Abstract: The present disclosure relates generally to the field of retail supply networks. In one specific example, mechanisms are provided to model markdown-avoidance savings for omni-channel fulfillment in retail supply networks. In various embodiments, systems, methods and computer program products are provided.

Abstract: A predictive engine on a computer environment comprising a shared pool of configurable computing resources is executed to perform a predictive analysis on data pipelined into the computer environment, the data received from a plurality of sources and in a plurality of different formats, the predictive engine generating a network level cost information based on the predictive analysis on a dynamic and continuous basis. Asynchronous communication comprising the network level cost information from the predictive engine is received and a set of candidate nodes for order fulfillment is generated based on the network level cost information and a defined distance between the set of candidate nodes and a target destination. An optimization engine on the computer environment is invoked that filters the set of candidate nodes. A number of fulfillment nodes that meet one or more of a constraint and preconfigured rule is output.

Abstract: A method and system determining node order fulfillment performance considering cancelation costs. The method includes receiving a current order for fulfillment node assignment and calculating a cancelation ratio of a node of a plurality of nodes by dividing orders canceled due to back order from the node by orders scheduled from the node collected from a pre-assigned time period. The method also includes determining a cancelation cost of the node based on the cancelation ratio of said node. The method then includes automatically generating a node order assignment based on the determined cancelation cost for fulfillment of a current order.

Abstract: A method and system determining an inventory threshold for offering for online sale or an inventory threshold for sourcing in node order assignment. The method includes receiving by a computer processor of a probabilistic cancellation module an electronic record of a current order or item. The program instructions executed by the processor of the probabilistic cancellation module allows the module to retrieve historical and current data of each node from a plurality of nodes. The method then includes automatically converting the retrieved historical data into a probability of cancellation of an item comprising the one or more items from the plurality of items. Further, the method includes identifying an inventory threshold for offering of an item or an inventory threshold for sourcing of one or more items of the current order, where the probability of item cancellation is lower than a predetermined order cancelation rate of the one or more items from the plurality of items.

Abstract: A method and system for evaluating node fulfillment capacity in node order assignment. The method includes receiving by a network average capacity utilization cost module an electronic record of a current order. The method includes retrieving data of a plurality of nodes, calculating an actual capacity utilization on an expected date, and determining a probability of backlog on the expected date. The method includes generating a network average capacity utilization cost model, automatically converting a regular labor cost or a overtime labor cost into a capacity utilization cost, and transmitting the capacity utilization cost of each node to an order fulfillment engine. The method includes receiving by the engine the current order, the processing cost data, and the capacity utilization cost. The method includes automatically calculating a fulfillment cost and identifying a node with the lowest fulfillment cost for assignment.

Abstract: A method and system for evaluating node fulfillment capacity in node order assignment. The method includes receiving by a network average capacity utilization cost module an electronic record of a current order. The method includes retrieving data of a plurality of nodes, calculating an actual capacity utilization on an expected date, and determining a probability of backlog on the expected date. The method includes generating a network average capacity utilization cost model, automatically converting one or more of a plurality of costs and capacity utilization into a capacity utilization cost, and transmitting the capacity utilization cost of each node to an order fulfillment engine. The method includes receiving by the engine the current order, the processing cost data, and the capacity utilization cost. The method includes automatically calculating a fulfillment cost and identifying a node with the lowest fulfillment cost for assignment.

Abstract: A historical scenario and historical decisions made in the historical scenario are received. The historical decisions represent a set of decision variables of an objective function. A random set of decision variables having different values than the set of decision variables are generated. To determine a weight setting associated with multiple objectives of the objective function, a number of inequalities are built and solved with an assumption that, for an optimization that minimizes the objective function, the objective function having the set of random decision variables has a larger value than the objective function having the set of decision variables. The receiving, the generating and the building steps may be repeated to determine multiple sets of weight settings. The multiple sets of weight settings are searched to select a target weight setting for each of the multiple objectives. The target weight setting may be automatically and continuously learned.

Abstract: An example operation may include one or more of receiving supply chain states of a plurality of nodes of a supply chain, respectively, where the supply chain states have restricted visibility among the plurality of nodes, determining a modification to a supply chain state of a target node in the supply chain based on a supply chain state of at least one other node in the supply chain, transmitting the determined modification of the supply chain state to the target node, and storing a reason for modifying the supply chain state of the target node via a block included among a hash-linked chain of blocks.