A multi‐objective model for bank ATM networks

In this paper we present an application of the core solution concepts for multi‐objective games to a bank ATM network model. In these games, the worth of a coalition is given by a subset of vectors of the k‐dimensional space rather than by a scalar. The paper investigates how an ATM network model based on multi‐objective cooperative game theory could be used as an alternative way of setting interchange fees paid by the customer's bank to the one that owns the ATM. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

On‐line algorithms for minimizing makespan on batch processing machines

We consider problem of scheduling jobs on‐line on batch processing machines with dynamic job arrivals to minimize makespan. A batch machine can handle up to B jobs simultaneously. The jobs that are processed together from a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. Each job becomes available at its arrival time, which is unknown in advance, and its processing time becomes known upon its arrival. In the first part of this paper, we address the single batch processing machine scheduling problem. First we deal with two variants: the unbounded model where B is sufficiently large and the bounded model where jobs have two distinct arrival times. For both variants, we provide on‐line algorithms with worst‐case ratio (the inverse of the Golden ratio) and prove that these results are the best possible. Furthermore, we generalize our algorithms to the general case and show a worst‐case ratio of 2. We then consider the unbounded case for parallel batch processing machine scheduling. Lower bound are given, and two on‐line algorithms are presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 241–258, 2001     

Party preferences and institutional transformation: revisiting France’s relationship with NATO (and the common wisdom on Gaullism)

ABSTRACT

France’s so-called exceptionalism in multilateral security policy is often explained with its Gaullist political culture. However, a closer look shows that Gaullism cannot easily capture different French policies, particularly toward NATO. To unearth what can explain policy variance, this paper asks the question of whether French political parties value NATO differently and, if so, to what effect? Looking at French governments from 1991 to 2014, I argue that political parties in France carry different values, which lead them to interpret NATO’s role for France’s security policy differently. As a result, French parties in power encouraged, delayed, or halted NATO institutional transformation at specific junctures. This argument builds on the insights of the study of ideational factors in IR and the study of party politics in Comparative Politics. Through an analysis of French governments’ policy preferences toward NATO, this paper stresses that institutional transformation can be understood through the study of veto points in conjunction with national preference formation.     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

Makespan minimization in the two‐machine flowshop batch scheduling problem

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part‐types are to be produced in a flexible manufacturing cell organized into a two‐stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP‐hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 128–144, 2000     

A genetic algorithm methodology for complex scheduling problems

This paper considers the scheduling problem to minimize total tardiness given multiple machines, ready times, sequence dependent setups, machine downtime and scarce tools. We develop a genetic algorithm based on random keys representation, elitist reproduction, Bernoulli crossover and immigration type mutation. Convergence of the algorithm is proved. We present computational results on data sets from the auto industry. To demonstrate robustness of the approach, problems from the literature of different structure are solved by essentially the same algorithm. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 199–211, 1999     

Interchange fees for bank ATM networks

Banks have found it advantageous to connect their Automated Teller Machines (ATMs) in networks so that customers of one bank may use the ATMs of any bank in the network. When this occurs, an interchange fee is paid by the customer's bank to the one that owns the ATM. These have been set by historic interbank negotiation. The paper investigates how a model based on n-player game theory concepts of Shapley value and nucleolus could be used as an alternative way of setting such fees. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 407–417, 1998     

A robust regression technique using compound estimation

Least squares fitting of regression models is a widely used technique. The presence of outliers in the data can have an adverse effect on the method of least squares, resulting in a model that does not adequately fit to the bulk of the data. For this situation, robust regression techniques have been proposed as an improvement to the method of least squares. We propose a robust regression procedure that performs well relative to the current robust methods against a variety of dataset types. Evaluations are performed using datasets without outliers (testing efficiency), with a large percentage of outliers (testing breakdown), and with high leverage outliers (testing bounded influence). The datasets are based on 2-level factorial designs that include axial points to evaluate leverage effects. A Monte Carlo simulation approach is used to evaluate the estimating capability of the proposed procedure relative to several competing methods. We also provide an application to estimating costs for government satellites. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 125–139, 1998     

Meeting seasonal demand for products with limited shelf lives

This article addresses a common misconception concerning production lead time and the use of inventory to meet seasonal demand for products with limited shelf lives. Two fundamental questions are answered: 1) Under what conditions will an increase in product life lead to increased ability to meet demand? 2) Under what conditions will increased levels of starting inventory be beneficial? The results of this analysis assisted a plastics manufacturing firm in making product pricing and inventory decisions. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44 : 473–483, 1997