On the aggregation of preferences

The article attempts to show how network theory may be applied to gain new and better insights into basic economic problems. Starting with a precise definition of what is meant by acting and, in particular, by economic acting, we direct the line of argumentation toward solving the problem of how to aggregate economic decisions. Results indicate that network theory might well prove itself to be a powerful instrument in developing a theory of human behavior much more comprehensive than currently used models.     

A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness

This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tradiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of this problem for which the Smith-heuristic is guaranteed to lead to optimal solutions. We also provide a worst-case analysis of the Smith-heuristic; the analysis shows that the fractional increase in the objective function value for the Smith-heuristic from the optimal solution is unbounded in the worst case.     

Parallel machine scheduling with job assignment restrictions

In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Influences on threat assessment in a military context

The anchoring effect is a well-studied subject. This article connects the effect with the rules-in-use within a military intelligence institution. Particularly the rules-in-use that dictate that an analyst takes his or hers starting point from recently conducted assessments of the specific area or threat. The threat assessment as well as the written assessment were affected. The results show that officers have an aversion to lower a previous given threat assessment. This gives that to understand risk assessment we not only need to understand the methods used, we also need to understand the institutions in which they are used. This is especially relevant for military intelligence as the assessments are conducted in an environment of high uncertainty.     

Competing with channel partners: Supply chain conflict when retailers introduce store brands

Private‐label products are of increasing importance in many retail categories. While national‐brand products are designed by the manufacturer and sold by the retailer, the positioning of store‐brand products is under the complete control of the retailer. We consider a scenario where products differ on a performance quality dimension and we analyze how retailer–manufacturer interactions in product positioning are affected by the introduction of a private‐label product. Specifically, we consider a national‐brand manufacturer who determines the quality of its product as well the product's wholesale price charged to the retailer. Given the national‐brand quality and wholesale price, the retailer then decides the quality level of its store brand and sets the retail prices for both products. We find that a manufacturer can derive substantial benefits from considering a retailer's store‐brand introduction when determining the national brand's quality and wholesale price. If the retailer has a significant cost disadvantage in producing high‐quality products, the manufacturer does not need to adjust the quality of the national‐brand product, but he should offer a wholesale price discount to ensure its distribution through the retailer. If the retailer is competitive in providing products of high‐quality, the manufacturer should reduce this wholesale price discount and increase the national‐brand quality to mitigate competition. Interestingly, we find the retailer has incentive to announce a store‐brand introduction to induce the manufacturer's consideration of these plans in determining the national‐brand product quality and wholesale price. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Approximation schemes for ordered vector packing problems

In this paper we deal with the d‐dimensional vector packing problem, which is a generalization of the classical bin packing problem in which each item has d distinct weights and each bin has d corresponding capacities. We address the case in which the vectors of weights associated with the items are totally ordered, i.e., given any two weight vectors a_i, a_j, either a_i is componentwise not smaller than a_j or a_j is componentwise not smaller than a_i. An asymptotic polynomial‐time approximation scheme is constructed for this case. As a corollary, we also obtain such a scheme for the bin packing problem with cardinality constraint, whose existence was an open question to the best of our knowledge. We also extend the result to instances with constant Dilworth number, i.e., instances where the set of items can be partitioned into a constant number of totally ordered subsets. We use ideas from classical and recent approximation schemes for related problems, as well as a nontrivial procedure to round an LP solution associated with the packing of the small items. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Risk communication within military decision-making: pedagogic considerations

Risk management is a decision-support process and a vital tool for military planning and decision-making. Today, several nations utilize risk-based approaches to analyze the level of security in military operations. There are both strengths and challenges in applying risk-based approaches to support military decisions. In this article, the challenges related to risk communication are investigated with the aim of describing how a military organization should train to create a good environment for effective risk communication. The analysis finds that it is important for the organization to define and consistently use a shared risk understanding. Such a shared risk understanding will need a systematic development process that focuses on the future decision makers’ and analysts’ education and training. To reach understanding, all involved parties must have the chance to identify the problem, reflect on its implications, test different solutions and develop a solution.     

Game theoretic analysis of maximum cooperative purchasing situations

This article introduces maximum cooperative purchasing (MCP)‐situations, a new class of cooperative purchasing situations. Next, an explicit alternative mathematical characterization of the nucleolus of cooperative games is provided. The allocation of possible cost savings in MCP‐situations, in which the unit price depends on the largest order quantity within a group of players, is analyzed by defining corresponding cooperative MCP‐games. We show that a decreasing unit price is a sufficient condition for a nonempty core: there is a set of marginal vectors that belong to the core. The nucleolus of an MCP‐game can be derived in polynomial time from one of these marginal vectors. To show this result, we use the new mathematical characterization for the nucleolus for cooperative games. Using the decomposition of an MCP‐game into unanimity games, we find an explicit expression for the Shapley value. Finally, the behavior of the solution concepts is compared numerically. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 607–624, 2013