Multiproduct lot-size scheduling with proportional product demands

In this paper we consider the multiproduct, multiperiod production-scheduling model of Manne under the assumption that, across products, demands are interrelated over time. When demand requirements are proportional we show that the solution has a specific structure determined by the ratio of setup to production-run time of each product. This structure holds for any length horizon and may permit a substantial (time) savings for column generation solution procedures.     

The rationalisation of warship building in the United Kingdom, 1945–2000

After the Second World War the Admiralty and shipbuilding industry agreed that the largest possible capacity for warship building should be maintained. This proved impossible as the Royal Navy struggled to evoke a strategy in the nuclear era and the price of increasingly complex vessels rose remorselessly. As the shipbuilding industry wilted in the 1960s in the face of international competition a process of natural selection was followed by increasing political intervention in the industry. Nationalisation in the 1970s aimed to preserve capacity and employment, policy aims which were reversed by privatisation in the 1980s and which, ultimately resulted in an oligopoly in the warship building sector.     

Designing safety space in a supply chain to handle system‐wide disruptions

In some supply chains serious disruptions are system wide. This happens during periods of severe weather, as when storms cause shuttle tankers serving oil platforms in the North Sea to stop movements of crude oil, barges are frozen in the Mississippi, or all airplanes are grounded after a blizzard. Other notable instances of system‐wide disruption happened after the attack on the World Trade Center when all aircraft were grounded and the natural gas and crude‐oil pipelines were tangled by hurricanes in 2005. We model a situation where shutting down supply facilities is very difficult and expensive because of excessive inventory buildup from an inability to move out the production. We present a planning model that balances the cost of spare capacity versus shutting down production when planning for disruptions. The model uses an assignment model embedded in a simulation. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

End effects in capacity expansion models with finite horizons

Capacity expansion models are typically formulated in the context of some finite horizon. Because the firm lasts longer than the horizon, a bias can enter into the optimal solution from the model horizon chosen. Recently, Grinold [8] has proposed a “dual-equilibrium method” for ameliorating possible distortions. Although the dual-equilibrium method has superior analytical properties to other methods, it is conceptually more complex. In this paper it is shown that there are situations where the “primal-equilibrium” approach of Manne [15] provides equivalent results and that the use of annualized capital costs in the objective function, although somewhat less efficient, results in a similar model.     

Satellite constellation design for forest fire monitoring via a stochastic programing approach

There is significant value in the data collected by satellites during and after a natural disaster. The current operating paradigm in practice is for satellites to passively collect data when they happen to fly over a disaster location. Conversely, this article considers the alternative approach of actively maneuvering satellites to fly directly overhead of the disaster site on a routine basis. Toward this end, we seek to compute a satellite constellation design that minimizes the expected maneuver costs for monitoring an unknown forest fire. In this article, we present a 2‐stage stochastic programing model for this problem as well as a accelerated L‐shaped decomposition approach. A comparison between our approach and the current operating paradigm indicates that our solution provides longer duration data collections and a greater number of data collections. Analysis also shows that our proposed solution is robust over a wide array of scenarios.     

Is human trafficking the dark side of economic freedom?

Economic freedom has increased living standards worldwide. Concurrent with such gains are rising concerns about potential human costs associated with free markets. This paper uses data on human trafficking and anti-trafficking policies, in conjunction with a measure of economic freedom, to examine whether free markets exacerbate or attenuate the incidence of human trafficking and policies designed to combat it. We do not find evidence suggesting that economic freedom is associated with human trafficking. In addition, our results suggest that economically free countries are more likely to enact and enforce policies to fight human trafficking.     

Improved convergence rate results for a class of exponential penalty functions

An improved theoretical rate of convergence is shown for a member of the class of exponential penalty function algorithms. We show that the algorithm has a superlinear convergence rate.     

A mathematical programming approach to the scheduling of sorting operations

In this paper we describe an approach to the scheduling and/or real-time control of sorting operations in the presence of deadlines. The problem arises in the postal service where mail has to be sorted by zip codes, and in the banking system where checks have to be sorted according to the bank on which they are drawn. In both applications losses are incurred if items miss their clearing deadlines. For example, in check-sorting an extremely important objective of the control system is to reduce the “float” i.e., the total dollar value of the checks which miss their deadlines. The proposed real-time control system utilizes a linear program which chooses between alternative sort-patterns and assigns the various processing steps to the time periods between deadlines.     

Optimal shift scheduling: A branch‐and‐price approach

We present a branch‐and‐price technique for optimal staff scheduling with multiple rest breaks, meal break, and break windows. We devise and implement specialized branching rules suitable for solving the set covering type formulation implicitly, using column generation. Our methodology is more widely applicable and computationally superior to the alternative methods in the literature. We tested our methodology on 365 test problems involving between 1728 and 86400 shift variations, and 20 demand patterns. In a direct comparison with an alternative method, our approach yields significant improvements both in cpu time and in the number of problem instances solved to optimality. The improvements were particularly marked for problems involving larger numbers of feasible shifts. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 185–200, 2000