Optimal retail assortments for substitutable items purchased in sets

We consider the problem of optimizing assortments in a multi‐item retail inventory system. In addition to the usual holding and stockout costs, there is a fixed cost for including any item in the assortment. Customers' preferences for items include both probabilistic substitution patterns and the desire to purchase sets of complementary items. We develop a demand model to capture this behavior, and derive tractable approximations that allow us to formulate the optimization problem as a 0–1 mixed integer linear program. Numerical examples are solved to illustrate key insights into how both complementary and substitute items affect the optimal assortment and the expected profit. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 793–822, 2003.     

Rising bipolarity in the South China Sea: the American rebalance to Asia and China's expansion

This article synthesizes three elements of power and balancing in the South China Sea (SCS): analytical perspectives on China's behaviour and intentions, the American rebalance to Asia and the dispositions of American allies and partners. Based on extensive interviews and theoretical analysis, it concludes that ‘soft balancing’ backed by American military power provides the optimum chance for resolving the growing dispute. Short to medium-term weakness of Malaysia, Philippines and Vietnam, as well as Japan, means the United States must provide much of the military power while working to build their forces. The most promising alternative is multilateral diplomacy through the Association of Southeast Asian Nations’ Regional Forum, a vehicle for negotiating a Code of Conduct and implementation of the UN Convention on the Law of the Sea. If China remains motivated mainly by defense of realist interests, the costs imposed against expansion will eventually cause recalculation of Beijing's strategy, and soft balancing by the United States and its partners has a chance of working. The constructivist perspective, stressing self-conceptualization of Chinese strategic culture, supports Chinese confidence that patience will eventually bring dominance. If China tries offensively to change the status quo, soft balancing is less likely to influence Beijing. President Xi Jin Ping appears to be offensively asserting power, seeking regional dominance before he is due to step down in 2023. This supports the finding of enhanced risks of unintended escalation in the SCS and the East China Sea.     

The ambivalent coalition: doing the least one can do against the Islamic state

The effort to degrade and defeat the Islamic State is like many other multilateral military efforts – characterized by widely varying contributions to the effort. This article seeks to understand the patterns of contributions. Three sets of explanations are applied: the lessons of Afghanistan and Libya, variations in how potential contributors feel the threat posed by the Islamic State, and domestic political dynamics. While there may be some political processes that overlap with the big lessons and with the threat of the Islamic State, the patterns of contributions thus far suggest that the key drivers of reactions to the Islamic State are the desire not to repeat Afghanistan combined with some impetus provided by Islamic State attacks in the various homelands. The conclusion suggests some policy implications as well as some ideas for future research.     

Tipping the scales: short-term interventions and counterinsurgency

Particularly in African operations, United Nations (UN) peacekeeping forces have faced significant problems in restoring stability. In at least a few situations, unilateral national military interventions have been launched in the same countries. In the cases of Sierra Leone and Côte d’Ivoire, the British and French interventions respectively played a significant role in re-establishing stability. Lessons from these operations suggest that if effective coordination and liaison channels are established, such hybrid unilateral-UN missions can in fact be more successful than “pure” peace operations.     

Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs.     

A proof for the longest-job-first policy in one-machine scheduling

We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functions.     

Scheduling workers in a constricted area

A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc.     

Discount pricing policies for inventories subject to declining demand

Until only recently, the mechanism behind determining item price has been ignored and the discount price taken as a given in quantity-discount inventory decision problems. Inventory subject to declining demand further complicates both pricing and replenishment decisions. This article provides the vendor with the means for optimally determining both the discount price and replenishment order frequency for all buyers in the system in an environment of declining demand. In the multiple-buyer case, we provide an efficient algorithm for classifying buyers into homogeneous subgroups to further enhance joint cost savings among all system participants.