Coordinated Logistics: Joint Replenishment with Capacitated Transportation for a Supply Chain

In this study, we consider the integrated inventory replenishment and transportation operations in a supply chain where the orders placed by the downstream retailer are dispatched by the upstream warehouse via an in‐house fleet of limited size. We first consider the single‐item single‐echelon case where the retailer operates with a quantity based replenishment policy, (r,Q), and the warehouse is an ample supplier. We model the transportation operations as a queueing system and derive the operating characteristics of the system in exact terms. We extend this basic model to a two‐echelon supply chain where the warehouse employs a base‐stock policy. The departure process of the warehouse is characterized in distribution, which is then approximated by an Erlang arrival process by matching the first two moments for the analysis of the transportation queueing system. The operating characteristics and the expected cost rate are derived. An extension of this system to multiple retailers is also discussed. Numerical results are presented to illustrate the performance and the sensitivity of the models and the value of coordinating inventory and transportation operations.     

DECENTRALIZED MULTIECHELON INVENTORY CONTROL

This paper considers a model for decentralized control of an inventory system consisting of 1 central warehouse and a number of retailers. The cost structure includes holding costs at both echelons and shortage costs proportional to the time until delivery at the retailers. We analyze a procedure for coordinated but still decentralized control of the system. The procedure is based on a simple approximation, in which the stochastic lead times perceived by the retailers are replaced by their correct averages. The approximation enables us to decompose the considered multiechelon inventory problem into a number of single echelon problems, 1 for each installation. The information about how a certain decision at the warehouse affects the retailers is conveyed through the marginal cost increase with respect to a change of the expected lead time. This information about the retailer costs is used as a shortage cost at the warehouse. We show that a coordination procedure based on this information can be used for finding near-optimal reorder points for the system and provide bounds for the approximation errors.     

The Effects of Sharing Upstream Information on Product Rollover

The process of introducing new and phasing out old products is called product rollover. This paper considers a periodic‐review inventory system consisting of a manufacturer and a retailer, where the manufacturer introduces new and improved products over an infinite planning horizon using the solo‐roll strategy. We consider two scenarios: (1) the manufacturer does not share the upstream information about new‐product introduction with the retailer and (2) the manufacturer shares the information. For each scenario, we first derive the decentralized ordering policy and the system‐optimal ordering policy with given cost parameters. We then devise an optimal supply chain contract that coordinates the inventory system. We demonstrate that when the inventory system is coordinated, information sharing improves the performance of both supply chain entities. However, this may not be true if the inventory system is not coordinated. We also show that under the optimal contract, the manufacturer has no incentive to mislead the retailer about new‐product information in the information‐sharing model. When demand variability increases, information sharing adds more benefits to the coordinated supply chain. Our research provides insights about coordinating product, financial, and information flows in supply chains with product rollover.     

POWER APPROXIMATIONS FOR A TWO-ECHELON INVENTORY SYSTEM USING SERVICE LEVELS

We consider a two-echelon inventory system with one warehouse and several stores. The warehouse as well as the stores are controlled by periodic review (s, S) inventory policies. We study the interrelationship between the safety stocks at the warehouse and the stores. Stockouts at the warehouse will result in supply delays to the stores and cause the lead time to be stochastic. The stores may react by increasing their safety stock. However, there is a trade-off between the safety stock at the warehouse and the safety stock at the stores. We use a service level at the warehouse to quantify the effect of warehouse stockouts on the lead time to the stores. The service level at the warehouse is considered a decision variable to find the best compromise between the various safety stocks by minimizing the overall costs. Using power approximations for the (s, S) policies, we provide an iterative procedure for adjusting the lead time distribution to the stores; this can result in substantial savings, but it doesn't guarantee the overall optimality. Numerical studies are provided to test the accuracy of approximations. The effects of the different system parameters on the inventory policy give general guidelines for use of the policies.     

The Impact of E‐Replenishment Strategy on Make‐to‐Order Supply Chain Performance

This research investigates the impact of electronic replenishment strategy on the operational activities and performance of a two‐stage make‐to‐order supply chain. We develop simulation‐based rolling schedule procedures that link the replenishment processes of the channel members and apply them in an experimental analysis to study manual, semi‐automated, and fully automated e‐replenishment strategies in decentralized and coordinated decision‐making supply chain structures. The average operational cost reductions for moving from a manual‐based system to a fully automated system are 19.6, 29.5, and 12.5%, respectively, for traditional decentralized, decentralized with information sharing, and coordinated supply chain structures. The savings are neither equally distributed among participants, nor consistent across supply chain structures. As expected, for the fully coordinated system, total costs monotonically decrease with higher levels of automation. However, for the two decentralized structures, under which most firms operate today, counter‐intuitive findings reveal that the unilateral application of e‐procurement technology by the buyer may lower his purchasing costs, but increase the seller's and system's costs. The exact nature of the relationship is determined by the channel's operational flexibility. Broader results indicate that while the potential economic benefit of e‐replenishment in a decentralized system is substantial, greater operational improvements maybe possible through supply chain coordination.     

Ownership and Control in Closely‐held Family‐owned Firms: An Exploration of Strategic and Operational Control

Much of the existing research into the divorce of ownership and control either focuses on the propensity for the separation of decision functions or upon scrutinizing conceptions, gauges or the practicalities of organizational control in large corporations. Although far from equivocal, such research appears broadly to concur that where ownership is dispersed, de facto control is likely to be exerted by management and that where ownership is closely‐held, de facto as well as legal control is exerted by owners. This study examines this assumption through exploring the nature of control in a closely‐held family firm. In this regard, the focus of this study is not on consequences of divorced ownership and control but rather on exploring the contingencies where ownership and control diverge. This research reveals a case wherein a closely‐held family firm is strategically and operationally controlled by its managers. Case research leads to the development of a range of insights regarding the owner/family and the management characteristics that contribute to this scenario. The paper concludes with a series of implications and conclusions.     

Integrality in Stochastic Inventory Models

We study several finite‐horizon, discrete‐time, dynamic, stochastic inventory control models with integer demands: the newsvendor model, its multi‐period extension, and a single‐product, multi‐echelon assembly model. Equivalent linear programs are formulated for the corresponding stochastic dynamic programs, and integrality results are derived based on the total unimodularity of the constraint matrices. Specifically, for all these models, starting with integer inventory levels, we show that there exist optimal policies that are integral. For the most general single‐product, multi‐echelon assembly system model, integrality results are also derived for a practical alternative to stochastic dynamic programming, namely, rolling‐horizon optimization by a similar argument. We also present a different approach to prove integrality results for stochastic inventory models. This new approach is based on a generalization we propose for the one‐dimensional notion of piecewise linearity with integer breakpoints to higher dimensions. The usefulness of this new approach is illustrated by establishing the integrality of both the dynamic programming and rolling‐horizon optimization models of a two‐product capacitated stochastic inventory control system.     

Impact of Value‐Added Service Features in e‐Retailing Processes: An Econometric Analysis of Web Site Functions

We examine the impact of three classes of Web site functions (foundational, customer‐centered, and value‐added) upon e‐retailer performance. Using secondary panel data for 2007–2009 on operating characteristics of over 600 e‐retailers, our econometric analysis finds that only the value‐added service functions are positively associated with changes in e‐retail sales revenues across time. We also observe a decreasing marginal impact of deploying additional value‐added service features. To account for possible alternate explanations, we control for firm‐ and time‐specific fixed effects, merchant types, merchandise categories, and order fulfillment strategies. By further decomposing e‐retail sales revenues into Web site traffic, conversion rate, and average order value, we find that Web site functions affect e‐retail sales revenues mainly through their impact on Web site traffic. Our investigation demonstrates the empirical research usefulness of the Voss conceptual e‐service sand cone model. Our results identify for managers where to focus ongoing e‐retailing system development efforts, yet suggest that focusing too many retailing capabilities on exploratory and experimental value‐added service features may backfire, potentially leading to worsening e‐retailer performance.     

Retailer Transshipment versus Central Depot Allocation for Supply Network Design

We consider a supply chain structure with shipments from an external warehouse directly to retailers and compare two enhancement options: costly transshipment among retailers after demand has been realized vs. cost‐free allocation to the retailers from the development of a centralized depot. Stochastic programming models are developed for both the transshipment and allocation structures. We study the impact of cost parameters and demand coefficient of variation on both system structures. Our results show an increasing convex relationship between average costs and demand coefficient of variation, and furthermore that this increase is more pronounced for the allocation structure. We employ simulation and nonlinear search techniques to computationally compare the cost performance of allocation and transshipment structures under a wide range of system parameters such as demand uncertainty and correlation; lead times from the external warehouse to retailers, from warehouse to central depot, and from depot to retailers; and transshipment, holding, and penalty costs. The transshipment approach is found to outperform allocation for a broad range of parameter inputs including many situations for which transshipment is not an economically sound decision for a single period. The insights provided enable the manager to choose whether to invest in reducing lead times or demand uncertainty and assist in the selection of investments across identical and nonidentical retailers.     

An Ecological Model for Quantitative Risk Assessment for Schistosomiasis: The Case of a Patchy Environment in the Coastal Tropical Area of Northeastern Brazil

We developed a stochastic model for quantitative risk assessment for the Schistosoma mansoni (SM) parasite, which causes an endemic disease of public concern. The model provides answers in a useful format for public health decisions, uses data and expert opinion, and can be applied to any landscape where the snail Biomphalaria glabrata is the main intermediate host (South and Central America, the Caribbean, and Africa). It incorporates several realistic and case‐specific features: stage‐structured parasite populations, periodic praziquantel (PZQ) drug treatment for humans, density dependence, extreme events (prolonged rainfall), site‐specific sanitation quality, environmental stochasticity, monthly rainfall variation, uncertainty in parameters, and spatial dynamics. We parameterize the model through a real‐world application in the district of Porto de Galinhas (PG), one of the main touristic destinations in Brazil, where previous studies identified four parasite populations within the metapopulation. The results provide a good approximation of the dynamics of the system and are in agreement with our field observations, i.e., the lack of basic infrastructure (sanitation level and health programs) makes PG a suitable habitat for the persistence and growth of a parasite metapopulation. We quantify the risk of SM metapopulation explosion and quasi‐extinction and the time to metapopulation explosion and quasi‐extinction. We evaluate the sensitivity of the results under varying scenarios of future periodic PZQ treatment (based on the Brazilian Ministry of Health's plan) and sanitation quality. We conclude that the plan might be useful to slow SM metapopulation growth but not to control it. Additional investments in better sanitation are necessary.     

A Mobile Platform's In‐App Advertising Contract Under Agency Pricing for App Sales

Unlike advertising in traditional media, a mobile platform's in‐app advertising market exhibits two unique features—split structure of the mobile platform with a platform owner and an app developer jointly provisioning in‐app advertising, and agency pricing for app sales. We develop a two‐sided market model to analyze the role of these two unique features in determining the platform owner's optimal advertising revenue‐sharing contract. Our results reveal an interesting N‐shaped dynamic regarding the platform owner's optimal choice of her ad revenue share with respect to the overall advertisers’ valuation of in‐app ads. We identify a between‐agent subsidization strategy for the platform owner, where she finds it optimal to subsidize the developer via the advertising channel, leading to greater profits for both of them. We find that the advertising revenue‐sharing contract under agency pricing for app sales leads to a higher app price than would be offered by the integrated platform found in traditional advertising. However, the ad price is coordinated under the platform owner's optimal choice of ad revenue share when she obtains revenue from both the advertising and app sales channels, leading to an alignment of her interest with the app developer's on ad level.     

Equilibrium Joining Strategies and Optimal Control of a Make‐to‐Stock Queue

We consider a make‐to‐stock, finite‐capacity production system with setup cost and delay‐sensitive customers. To balance the setup and inventory related costs, the production manager adopts a two‐critical‐number control policy, where the production starts when the number of waiting customers reaches a certain level and shuts down when a certain quantity of inventory has accumulated. Once the production is set up, the unit production time follows an exponential distribution. Potential customers arrive according to a Poisson process. Customers are strategic, i.e., they make decisions on whether to stay for the product or to leave without purchase based on their utility values, which depend on the production manager's control decisions. We formulate the problem as a Stackelberg game between the production manager and the customers, where the former is the game leader. We first derive the equilibrium customer purchasing strategy and system performance. We then formulate the expected cost rate function for the production system and present a search algorithm for obtaining the optimal values of the two control variables. We further analyze the characteristics of the optimal solution numerically and compare them with the situation where the customers are non‐strategic.     

Class‐Based Storage with a Finite Number of Items: Using More Classes is not Always Better

Class‐based storage is widely studied in the literature and applied in practice. It divides all stored items into a number of classes according to their turnover. A class of items with higher turnover is allocated to a region closer to the warehouse depot. In the literature, it has been shown that the use of more storage classes leads to a shorter travel time for storing and retrieving items. A basic assumption in this literature is that the required storage space for all items equals their average inventory level, which is valid only if an infinite number of items can be stored in each storage region. This study revisits class‐based storage by considering each storage space to contain only a finite number of items. We develop a travel time model and an algorithm that can be used for determining the optimal number and boundaries of storage classes in warehouses. Different from the conventional research, our findings illustrate that commonly a small number of classes is optimal. In addition, we find the travel time is fairly insensitive to the number of storage classes in a wide range around the optimum. This suggests that a manager can select a near‐optimal number of storage classes in an easy way and need not be worried about the impact of storage‐class reconfigurations. We validate our findings for various cases, including different ABC‐demand curves, space‐sharing factors, number of items, storage rack shapes, discrete storage locations, and stochastic item demand.     

Optimal Coordination in Distributed Software Development

The construction of a software system requires not only individual coding effort from team members to realize the various functionalities, but also adequate team coordination to integrate the developed code into a consistent, efficient, and bug‐free system. On the one hand, continuous coding without adequate coordination can cause serious system inconsistencies and faults that may subsequently require significant corrective effort. On the other hand, frequent integrations can be disruptive to the team and delay development progress. This tradeoff motivates the need for a good coordination policy. Both the complexity and the importance of coordination is accentuated in distributed software development (DSD), where a software project is developed by multiple, geographically‐distributed sub‐teams. The need for coordination in DSD exists both within one sub‐team and across different sub‐teams. The latter type of coordination involves communication across spatial boundaries (different locations) and possibly temporal boundaries (different time zones), and is a major challenge that DSD faces. In this study, we model both inter‐ and intra‐sub‐team coordination in DSD based on the characteristics of the systems being developed by the sub‐teams, the deadline for completion, and the nature of division adopted by the sub‐teams with respect to development and integration activities. Our analysis of optimal coordination policies in DSD shows that integration activities by one sub‐team not only benefit that sub‐team (as is the case in co‐located development) but can also help the other sub‐teams by providing greater visibility, thereby resulting in a higher integration frequency relative to co‐located development. Analytical results are presented to demonstrate how the characteristics of the projects and the sub‐teams, and the efficiency of communication across the sub‐teams, affect coordination and productivity. We also investigate the pros and cons of using specialized integration sub‐teams and find that their advantage decreases as the project schedule becomes tighter. Decentralized decisions and asymmetric subsystems are also discussed.     

Strategic Preparedness for Recovery from Catastrophic Risks to Communities and Infrastructure Systems of Systems

Natural and human‐induced disasters affect organizations in myriad ways because of the inherent interconnectedness and interdependencies among human, cyber, and physical infrastructures, but more importantly, because organizations depend on the effectiveness of people and on the leadership they provide to the organizations they serve and represent. These human–organizational–cyber–physical infrastructure entities are termed systems of systems. Given the multiple perspectives that characterize them, they cannot be modeled effectively with a single model. The focus of this article is: (i) the centrality of the states of a system in modeling; (ii) the efficacious role of shared states in modeling systems of systems, in identification, and in the meta‐modeling of systems of systems; and (iii) the contributions of the above to strategic preparedness, response to, and recovery from catastrophic risk to such systems. Strategic preparedness connotes a decision‐making process and its associated actions. These must be: implemented in advance of a natural or human‐induced disaster, aimed at reducing consequences (e.g., recovery time, community suffering, and cost), and/or controlling their likelihood to a level considered acceptable (through the decisionmakers’ implicit and explicit acceptance of various risks and tradeoffs). The inoperability input‐output model (IIM), which is grounded on Leontief's input/output model, has enabled the modeling of interdependent subsystems. Two separate modeling structures are introduced. These are: phantom system models (PSM), where shared states constitute the essence of modeling coupled systems; and the IIM, where interdependencies among sectors of the economy are manifested by the Leontief matrix of technological coefficients. This article demonstrates the potential contributions of these two models to each other, and thus to more informative modeling of systems of systems schema. The contributions of shared states to this modeling and to systems identification are presented with case studies.     

Information Acquisition and Voluntary Disclosure in an Export‐Processing System

We study a strategic information management problem in the export‐processing trade, where the buyer controls the raw material input and sales and the producer is responsible for production. The production is vulnerable to random yield risk. The producer can exert a costly effort to acquire the private yield rate information and discretionarily share it with the buyer. We develop a sequential Bayesian game model that captures three key features of the system—endogenous information endowment, voluntary disclosure, and ex post information sharing—a significant departure from the literature. The optimal disclosure strategy is driven by the trade‐off between the gains from Pareto efficiency improvement and self‐interested overproduction. It is specified by two thresholds on yield rate: only the middle‐yield producers (with yield rate between these two thresholds) share private information to improve supply‐demand match; the low‐ and high‐yield producers withhold information to extract excess input from the buyer. The buyer in response penalizes nondisclosure with reduced input and rewards information sharing with a larger order. This strategic interaction is further exacerbated by the double marginalization effect from decentralization, resulting in severe efficiency loss. We examine the effectiveness of three corrective mechanisms—vertical integration, mandatory disclosure, and production restriction—and reveal the costs of information suppressive effect and overinvestment incentive and the benefit from concessions on the processing fee. Our study endogenizes the asymmetric supply risk and provides the first attempt to rationalize the strategic interactions of informational and operational incentives in the export‐processing system.     

COMMON DUE-WINDOW SCHEDULING

In this paper, we solve common due-window scheduling problems within the just-in-time window concept, i.e., scheduling problems including both earliness and tardiness penalties. We assume that jobs share the same due window and incur no penalty as long as they are completed within the due window. We further assume that the earliness and tardiness penalty factors are constant and that the size of the window is a given parameter. For cases where the location of the due window is a decision variable, we provide a polynomial algorithm with complexity O(n * log (n)) to solve the problem. For cases where the location of the due window is a given parameter, we use dynamic programming with pseudopolynomial complexity to solve the problem.     

Contracting Under Vendor Managed Inventory Systems Using Holding Cost Subsidies

Vendor managed inventory systems are becoming increasingly popular. An important issue in implementing a vendor managed inventory scheme is the contracting terms that dictate the ownership of the inventory and the responsibility of inventory replenishment decisions. Thus the performance of a vendor managed system crucially depends on these terms and on how inventory‐related costs are shared in a supply chain. We consider a system where a manufacturer supplies a single product to a retailer who faces random demand in a competitive market. The retailer incurs a fixed cost per order, inventory holding cost, and a penalty cost for a stockout (unsatisfied demand is back‐ordered). Further, the manufacturer incurs a penalty cost when there is a stockout at the retailer and a fixed replenishment cost. We assume that the players are rational and act noncooperatively. We compare the performance of retailer managed inventory systems, where the retailer places orders and makes replenishment decisions, with vendor managed inventory systems, wherein the vendor or manufacturer makes inventory and replenishment decisions. Specifically, in the vendor managed inventory system, we propose and evaluate holding cost subsidy‐type contracts on inventories offered by the retailer to improve system performance. We evaluate this contract in the context of three widely used inventory systems—deterministic economic order quantity, continuous review (Q, r) policies, and periodic review policies—and show when such contracts may improve channel performance.     

Staffing Call Centers with Uncertain Arrival Rates and Co‐sourcing

In a call center, staffing decisions must be made before the call arrival rate is known with certainty. Once the arrival rate becomes known, the call center may be over‐staffed, in which case staff are being paid to be idle, or under‐staffed, in which case many callers hang‐up in the face of long wait times. Firms that have chosen to keep their call center operations in‐house can mitigate this problem by co‐sourcing; that is, by sometimes outsourcing calls. Then, the required staffing N depends on how the firm chooses which calls to outsource in real time, after the arrival rate realizes and the call center operates as a M/M/N + M queue with an outsourcing option. Our objective is to find a joint policy for staffing and call outsourcing that minimizes the long‐run average cost of this two‐stage stochastic program when there is a linear staffing cost per unit time and linear costs associated with abandonments and outsourcing. We propose a policy that uses a square‐root safety staffing rule, and outsources calls in accordance with a threshold rule that characterizes when the system is “too crowded.” Analytically, we establish that our proposed policy is asymptotically optimal, as the mean arrival rate becomes large, when the level of uncertainty in the arrival rate is of the same order as the inherent system fluctuations in the number of waiting customers for a known arrival rate. Through an extensive numerical study, we establish that our policy is extremely robust. In particular, our policy performs remarkably well over a wide range of parameters, and far beyond where it is proved to be asymptotically optimal.     

Joint Inventory and Pricing Coordination with Incomplete Demand Information

In retailing operations, retailers face the challenge of incomplete demand information. We develop a new concept named K‐approximate convexity, which is shown to be a generalization of K‐convexity, to address this challenge. This idea is applied to obtain a base‐stock list‐price policy for the joint inventory and pricing control problem with incomplete demand information and even non‐concave revenue function. A worst‐case performance bound of the policy is established. In a numerical study where demand is driven from real sales data, we find that the average gap between the profits of our proposed policy and the optimal policy is 0.27%, and the maximum gap is 4.6%.