Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance

The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a tool change is caused most frequently by tool wear. That is why we consider here the problem of scheduling a set of jobs on a single CNC machine where the cutting tool is subject to wear; our objective is to minimize the total completion time. We first describe the problem and discuss its peculiarities. After briefly reviewing available theoretical results, we then go on to provide a mixed 0–1 linear programming model for the exact solution of the problem; this is useful in solving problem instances with up to 20 jobs and has been used in our computational study. As our main contribution, we next propose a number of heuristic algorithms based on simple dispatch rules and generic search. We then discuss the results of a computational study where the performance of the various heuristics is tested; we note that the well‐known SPT rule remains good when the tool change time is small but deteriorates as this time increases and further that the proposed algorithms promise significant improvement over the SPT rule. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Algorithmic insights and a convergence analysis for a Karmarkar-type of algorithm for linear programming problems

This paper is concerned with a modification of a recently proposed variant of Karmarkar's algorithm for solving linear programming problems. In analyzing this variant, we exhibit interesting and useful relationships of these types of algorithms with barrier function methods, and subgradient optimization procedures involving space dilation techniques, which subsume the well-known ellipsoidal type of algorithms. Convergence of this variant is established under certain regularity conditions. We also provide remarks on how to obtain dual variables or Lagrange multipliers at optimality.     

Analysis and optimal design of discrete order picking technologies along a line

Order picking accounts for most of the operating expense of a typical distribution center, and thus is often considered the most critical function of a supply chain. In discrete order picking a single worker walks to pick all the items necessary to fulfill a single customer order. Discrete order picking is common not only because of its simplicity and reliability, but also because of its ability to pick orders quickly upon receipt, and thus is commonly used by e‐commerce operations. There are two primary ways to reduce the cost (walking distance required) of the order picking system. First is through the use of technology—conveyor systems and/or the ability to transmit order information to pickers via mobile units. Second is through the design—where best to locate depots (where workers receive pick lists and deposit completed orders) and how best to lay out the product. We build a stochastic model to compare three configurations of different technology requirements: single‐depot, dual‐depot, and no‐depot. For each configuration we explore the optimal design. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Replacing nonidentical vital components to extend system life

We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

紧凑型Tesla变压器的参数测量

对设计加工研制的Tesla变压器,根据Smith建议的测量方法,解决了对紧凑Teala变压器耦合系数进行比较准确地测量的问题,实测耦合系数高达0.9,并对耦合系数稍低于理论设计值的原因进行了探讨,同时分析给出了物理原因.此外,根据Teala变压器电路在初次级初、次级短路和低电压充电情形下的实测电压波形,估算出Tesla变压器电路各参数数值.这些数值与理论计算值吻合,并能满足实际高压充电的要求.     

Minimization of expected variance of completion times on single machine for stochastic jobs

This article deals with the problem of scheduling jobs with random processing times on single machine in order to minimize the expected variance of job completion times. Sufficient conditions for the existence of V-shaped optimal sequences are derived separately for general and ordered job processing times. It is shown that when coefficient of variation of random processing times are bounded by a certain value, an optimal sequence is V-shaped. © 1997 John Wiley & Sons, Inc.     

A branch‐and‐price approach for the stochastic generalized assignment problem

In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014     

The Political Economy of Legislation on Terrorism

^{1 1}This research was funded in part by a grant from the Lowe Institute of Political Economy. The corresponding author is S. Brock Blomerg. We thank Chris Blomberg and Brianna Loyosa for their excellent research assistance on the project. This paper presents an empirical analysis of what drives congressional legislation on terrorism during the period 1995 to 2010. We utilize and augment current methodology to compile and analyze data on sponsorship and cosponsorship of terrorism related data. Our results on the sources of legislation on terrorism are largely in line with past examinations of the importance of committee membership and leadership, party majority-ship, and other political factors. Further, we find that the most significant and robust drive for legislation on terrorism is the September 11^th attacks. And while the impact of 9/11 affected legislative productivity everywhere, we find that it most significantly affected states surrounding New York and Washington D.C. Our results indicate that the economy may be one factor motivating politicians to legislate on terrorism; however, these results are not robust.     

The BWC protocol mandate for failure

The stage may be set for what could be a historic turning point in America's reliance on nuclear weapons to meet its fundamental national security interests. Proponents of a refurbished nuclear stockpile and infrastructure are convinced that nuclear weapons will remain central to U.S. security interests, yet they admit that there is no national consensus on the need for and role of nuclear weapons. Nuclear opponents are gravely concerned that to the extent nuclear refurbishment creates a global perception that nuclear weapons remain essential instruments, it will eviscerate nuclear nonproliferation measures precisely at a time when nuclear ambitions are growing. Moreover, opponents see deterrence through advanced conventional weapons as decisively more credible than any nuclear alternative. With hopes of elevating discourse to the national level, this article examines the key current arguments pro and con within the specialist community and forecasts changes in the U.S. nuclear arsenal over the next decade. It concludes with a brief prognosis on prospects for complete nuclear disarmament.