Capacity competition of make-to-order firms

Two make-to-order firms, each modelled as a single-server queue, compete for a common stream of (potential) customers by setting their service capacities (rates) and service prices. Each customer maximizes her expected return by getting service from a firm or by balking. We completely characterize the Nash equilibrium of the competition.     

Decision support for the career field selection process at the US Air Force Academy

Each year, the US Air Force Academy graduates nearly 1000 young men and women. To support the decision of which cadets will be classified into which career fields, we describe a linear programming formulation with appealing computational properties that enable it as the core of a decision support tool. We explore methods for measuring and balancing cadets' class standing, Air Force career field requirements, and cadets' career field preferences in the context of this model. Our computational experiments demonstrate the improvement of this method over previous classification approaches, yielding more than 10% increase in the number of cadets assigned to their top career field choice and yielding nearly a 100% reduction in the number of cadets not receiving any of their career field choices. We also explore alternative methods for measuring cadets' career field preferences and demonstrate the positive effect of the new measurement scheme on the overall classification. Because of the short running time of this model, it will serve as a flexible, real-time component of the Academy's classification process.     

An optimization model for the aggregate production planning of a Brazilian sugar and ethanol milling company

This work presents an optimization model to support decisions in the aggregate production planning of sugar and ethanol milling companies. The mixed integer programming formulation proposed is based on industrial process selection and production lot-sizing models. The aim is to help the decision makers in selecting the industrial processes used to produce sugar, ethanol and molasses, as well as in determining the quantities of sugarcane crushed, the selection of sugarcane suppliers and sugarcane transport suppliers, and the final product inventory strategy. The planning horizon is the whole sugarcane harvesting season and decisions are taken on a discrete fraction of time. A case study was developed in a Brazilian mill and the results highlight the applicability of the proposed approach.     

A genetic approach for strategic resource allocation planning

Enterprises often implement a measurement system to monitor their march towards their strategic goals. Although this way it is possible to assess the progress of each goal, there is no structured way to reconsider resource allocation to those goals and to plan an optimal (or near optimal) allocation scheme. In this study we propose a genetic approach to match each goal with an autonomous entity (agent) with a specific resource sharing behavior. The overall performance is evaluated through a set of functions and genetic algorithms are used to eventuate in approximate optimal behavior’s schemes. To outline the strategic goals of the enterprise we used the balanced scorecard method. Letting agents deploy their sharing behavior over simulation time, we measure the scorecard’s performance and detect distinguished behaviors, namely recommendations for resource allocation.     

A Crop Planning Problem with Fuzzy Random Profit Coefficients

The main purpose of this paper is to present a crop planning problem for agricultural management under uncertainty. It is significant that agricultural managers assign their limited farmlands to cultivation of which crops in a season. This planning is called the crop planning problem and influences their incomes for the season. Usually, the crop planning problem is formulated as a linear programming problem. But there are many uncertain factors in agricultural problems, so future profits for crops are not certain values. A linear programming model with constant profit coefficients may not reflect the environment of decision making properly. Therefore, we propose a model of crop planning with fuzzy profit coefficients, and an effective solution procedure for the model. Furthermore, we extend this fuzzy model, setting the profit coefficients as discrete randomized fuzzy numbers. We show concrete optimal solutions for each models.     

Optimal corrective maintenance contract planning for aging multi‐state system

This paper considers an aging multi‐state system, where the system failure rate varies with time. After any failure, maintenance is performed by an external repair team. Repair rate and cost of each repair are determined by a corresponding corrective maintenance contract with a repair team. The service market can provide different kinds of maintenance contracts to the system owner, which also can be changed after each specified time period. The owner of the system would like to determine a series of repair contracts during the system life cycle in order to minimize the total expected cost while satisfying the system availability. Operating cost, repair cost and penalty cost for system failures should be taken into account. The paper proposes a method for determining such optimal series of maintenance contracts. The method is based on the piecewise constant approximation for an increasing failure rate function in order to assess lower and upper bounds of the total expected cost and system availability by using Markov models. The genetic algorithm is used as the optimization technique. Numerical example is presented to illustrate the approach. Copyright © 2009 John Wiley & Sons, Ltd.     

Capacity decisions for high-tech products with obsolescence

Modern high-tech products experience rapid obsolescence. Capacity investments must be recouped during the brief product lifecycle, during which prices fall continuously. We employ a multiplicative demand model that incorporates price declines due to both market heterogeneity and product obsolescence, and study a monopolistic firm’s capacity decision. We investigate profit concavity, and characterize the structure of the optimal capacity solution. Moreover, for products with negligible variable costs, we identify two distinct strategies for capacity choice demarcated by an obsolescence rate threshold that relates both to market factors and capacity costs. Finally, we empirically test the demand model by analyzing shipping and pricing data from the PC microprocessor market.     

Warmstarting for interior point methods applied to the long-term power planning problem

The long-term planning of electricity generation in a liberalised market using the Bloom and Gallant model can be posed as a quadratic programming (QP) problem with an exponential number of linear inequality constraints called load-matching constraints (LMCs) and several other linear non-LMCs. Direct solution methods are inefficient at handling such problems and a heuristic procedure has been devised to generate only those LMCs that are likely to be active at the optimiser. The problem is then solved as a finite succession of QP problems with an increasing, though still limited, number of LMCs, which can be solved efficiently using a direct method, as would be the case with a QP interior-point algorithm. Warm starting between successive QP solutions helps then in reducing the number of iterations necessary to reach the optimiser.     

Optimal policy for a dynamic,non-stationary,stochastic inventory problem with capacity commitment

This paper studies a single-product, dynamic, non-stationary, stochastic inventory problem with capacity commitment, in which a buyer purchases a fixed capacity from a supplier at the beginning of a planning horizon and the buyer’s total cumulative order quantity over the planning horizon is constrained with the capacity. The objective of the buyer is to choose the capacity at the beginning of the planning horizon and the order quantity in each period to minimize the expected total cost over the planning horizon. We characterize the structure of the minimum sum of the expected ordering, storage and shortage costs in a period and thereafter and the optimal ordering policy for a given capacity. Based on the structure, we identify conditions under which a myopic ordering policy is optimal and derive an equation for the optimal capacity commitment. We then use the optimal capacity and the myopic ordering policy to evaluate the effect of the various parameters on the minimum expected total cost over the planning horizon.     

Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning

In this paper, we propose a modification of Benson’s algorithm for solving multiobjective linear programmes in objective space in order to approximate the true nondominated set. We first summarize Benson’s original algorithm and propose some small changes to improve computational performance. We then introduce our approximation version of the algorithm, which computes an inner and an outer approximation of the nondominated set. We prove that the inner approximation provides a set of -nondominated points. This work is motivated by an application, the beam intensity optimization problem of radiotherapy treatment planning. This problem can be formulated as a multiobjective linear programme with three objectives. The constraint matrix of the problem relies on the calculation of dose deposited in tissue. Since this calculation is always imprecise solving the MOLP exactly is not necessary in practice. With our algorithm we solve the problem approximately within a specified accuracy in objective space. We present results on four clinical cancer cases that clearly illustrate the advantages of our method.