Production and shipment lot sizing in a vendor–buyer supply chain with transportation cost

Previous research on the joint vendor–buyer problem focused on the production shipment schedule in terms of the number and size of batches transferred between the two parties. It is a fact that transportation cost is a major part of the total operational cost. However, in most joint vendor–buyer models, the transportation cost is only considered implicitly as a part of fixed setup or ordering cost and thus is assumed to be independent of the size of the shipment. As such, the effect of the transportation cost is not adequately reflected in final planning decisions. There is a need for models involving transportation cost explicitly for better decision-making. In this study we analyze the vendor–buyer lot-sizing problem under equal-size shipment policy. We introduce the complete solution of the problem in an explicit and extended manner that has not existed in the literature. We incorporate transportation cost explicitly into the model and develop optimal solution procedures for solving the integrated models. All-unit-discount transportation cost structures with and without over declaration have been considered. Numerical examples are presented for illustrative purpose.     

AaaS:Agent云平台研究与实现

云计算是一种通过互联网将各种资源按照一定的方法整合在一起,以服务的形式向外提供的商业模式,有着良好的发展前景.Agent技术拥有其他技术无法比拟的智能性,并在各个领域都得到了广泛的应用.但Agent软件的系统开发、部署、运行以及维护仍采用传统的技术方案,无论在硬件还是软件设施上都存在着严重的浪费,因此将云计算与Agent技术结合起来,建立基于云计算的Agent平台(AaaS),来解决上述存在的问题,利用虚拟化技术解决硬件资源的浪费,设计开发Agent开发工具箱(ADT)以统一的标准来开发和部署Agent,提供云控制器来实时监测Agent的运行状态,进而动态的解决Agent运行时存在的问题.     

Multiscale agent‐based consumer market modeling

Consumer markets have been studied in great depth, and many techniques have been used to represent them. These have included regression‐based models, logit models, and theoretical market‐level models, such as the NBD‐Dirichlet approach. Although many important contributions and insights have resulted from studies that relied on these models, there is still a need for a model that could more holistically represent the interdependencies of the decisions made by consumers, retailers, and manufacturers. When the need is for a model that could be used repeatedly over time to support decisions in an industrial setting, it is particularly critical. Although some existing methods can, in principle, represent such complex interdependencies, their capabilities might be outstripped if they had to be used for industrial applications, because of the details this type of modeling requires. However, a complementary method—agent‐based modeling—shows promise for addressing these issues. Agent‐based models use business‐driven rules for individuals (e.g., individual consumer rules for buying items, individual retailer rules for stocking items, or individual firm rules for advertizing items) to determine holistic, system‐level outcomes (e.g., to determine if brand X's market share is increasing). We applied agent‐based modeling to develop a multi‐scale consumer market model. We then conducted calibration, verification, and validation tests of this model. The model was successfully applied by Procter & Gamble to several challenging business problems. In these situations, it directly influenced managerial decision making and produced substantial cost savings. © 2010 Wiley Periodicals, Inc. Complexity, 2010     

Practical extensions to a minimum cost flow model for level of repair analysis

The level of repair analysis (LORA) gives answers to three questions that are posed when deciding on how to maintain capital goods: (1) which components to repair upon failure and which to discard, (2) at which locations in the repair network to perform each type of repairs, and (3) at which locations in the network to deploy resources, such as test equipment. The goal is to achieve the lowest possible life cycle costs. Various models exist for the LORA problem. However, they tend to be restrictive in that specific business situations cannot be incorporated, such as having repair equipment with finite capacity or the occurrence of unsuccessful repairs or no-fault-founds. We discuss and model such practically relevant extensions to an existing minimum cost flow formulation for the LORA problem. In an extensive numerical experiment, we show that incorporating the model refinements leads to a substantial change in the costs in general. The repair strategy changes substantially only when incorporating finite resource capacities or a probability of unsuccessful repair that is decreasing with an increasing echelon level.     

Maximizing business value by optimal assignment of jobs to resources in grid computing

An important problem that arises in the area of grid computing is one of optimally assigning jobs to resources to achieve a business objective. In the grid computing area, however, such scheduling has mostly been done from the perspective of maximizing the utilization of resources. As this form of computing proliferates, the business aspects will become crucial for the overall success of the technology. Hence, we discuss the grid scheduling problem from a business perspective. We show that this problem is not only strongly NP-hard, but it is also non-approximable. Therefore, we propose heuristics for different variants of the problem and show that these heuristics provide near-optimal solution for a wide variety of problem instances. We show that the execution times of proposed heuristics are very low, and hence, they are suitable for solving problems in real-time. We also present several managerial implications and compare the performance of two widely used models in the real-time scheduling of grid computing.     

Multiattribute electronic procurement using goal programming

One of the key challenges of current day electronic procurement systems is to enable procurement decisions transcend beyond a single attribute such as cost. Consequently, multiattribute procurement have emerged as an important research direction. In this paper, we develop a multiattribute e-procurement system for procuring large volume of a single item. Our system is motivated by an industrial procurement scenario for procuring raw material. The procurement scenario demands multiattribute bids, volume discount cost functions, inclusion of business constraints, and consideration of multiple criteria in bid evaluation. We develop a generic framework for an e-procurement system that meets the above requirements. The bid evaluation problem is formulated as a mixed linear integer multiple criteria optimization problem and goal programming is used as the solution technique. We present a case study for which we illustrate the proposed approach and a heuristic is proposed to handle the computational complexity arising out of the cost functions used in the bids.     

Technology selection and capacity investment under uncertainty

We analyze the problem of technology selection and capacity investment for electricity generation in a competitive environment under uncertainty. Adopting a Nash-Cournot competition model, we consider the marginal cost as the uncertain parameter, although the results can be easily generalized to other sources of uncertainty such as a load curve. In the model, firms make three different decisions: (i) the portfolio of technologies, (ii) each technology’s capacity and (iii) the technology’s production level for every scenario. The decisions related to the portfolio and capacity are ex-ante and the production level is ex-post to the realization of uncertainty. We discuss open and closed-loop models, with the aim to understand the relationship between different technologies’ cost structures and the portfolio of generation technologies adopted by firms in equilibrium. For a competitive setting, to the best of our knowledge, this paper is the first not only to explicitly discuss the relation between costs and generation portfolio but also to allow firms to choose a portfolio of technologies. We show that portfolio diversification arises even with risk-neutral firms and technologies with different cost expectations. We also investigate conditions on the probability and cost under which different equilibria of the game arise.     

Achieving sharp deliveries in supply chains through variance pool allocation

Variability reduction and business process synchronization are acknowledged as key to achieving sharp and timely deliveries in supply chain networks. In this paper, we develop an approach that facilitates variability reduction and business process synchronization for supply chains in a cost effective way. The approach developed is founded on an analogy between mechanical design tolerancing and supply chain lead time compression. We first present a motivating example to describe this analogy. Next, we define, using process capability indices, a new index of delivery performance called delivery sharpness which, when used with the classical performance index delivery probability, measures the accuracy as well as the precision with which products are delivered to the customers. Following this, we solve the following specific problem: how do we compute the allowable variability in lead time for individual stages of the supply chain so that specified levels of delivery sharpness and delivery probability are achieved in a cost-effective way? We call this the variance pool allocation (VPA) problem. We suggest an efficient heuristic approach for solving the VPA problem and also show that a variety of important supply chain design problems can be posed as instances of the VPA problem. One such problem, which is addressed in this paper, is the supply chain partner selection problem. We formulate and solve the VPA problem for a plastics industry supply chain and demonstrate how the solution can be used to choose the best mix of supply chain partners.     

The Army Training Mix Model

We describe a model for making decisions concerning the proper mix of TADSS (training aids, devices, simulators and simulations) and conventional training resources, and the best modes of using them to maintain soldier and unit proficiency. Given the proficiency standards, the model determines the resources needed, the training methods for using them, and the frequency with which each method needs to be repeated, in order to maintain the standards at minimum cost (sum of equipment procurement costs and operational costs). The model is illustrated with an example problem dealing with the analysis of training systems in a battalion training strategy. Our model has much wider applicability: it can be used for evaluating and determining minimum cost training strategies for other combined arms elements, higher level units and other training scenarios under a variety of circumstances.     

Routing and scheduling in a liquefied natural gas shipping problem with inventory and berth constraints

Liquefied natural gas (LNG) is natural gas that has been transformed to liquid form for the purpose of transportation, which is mainly done by specially built LNG vessels travelling from the production site to the consumers. We describe a real-life ship routing and scheduling problem from the LNG business, with both inventory and berth capacity constraints at the liquefaction port. We propose a solution method where the routing and scheduling decisions are decomposed. The routing decisions consist of deciding which vessels should service which cargoes and in what sequence. The scheduling decisions are then to decide when to start servicing the cargoes while satisfying inventory and berth capacity constraints. The proposed solution method has been tested on several problem instances based on the real-life problem. The results show that the proposed solution method is well suited to solve this LNG shipping problem.     

Dynamic pricing and inventory control: robust vs. stochastic uncertainty models—a computational study

In this paper, we consider a variety of models for dealing with demand uncertainty for a joint dynamic pricing and inventory control problem in a make-to-stock manufacturing system. We consider a multi-product capacitated, dynamic setting, where demand depends linearly on the price. Our goal is to address demand uncertainty using various robust and stochastic optimization approaches. For each of these approaches, we first introduce closed-loop formulations (adjustable robust and dynamic programming), where decisions for a given time period are made at the beginning of the time period, and uncertainty unfolds as time evolves. We then describe models in an open-loop setting, where decisions for the entire time horizon must be made at time zero. We conclude that the affine adjustable robust approach performs well (when compared to the other approaches such as dynamic programming, stochastic programming and robust open loop approaches) in terms of realized profits and protection against constraint violation while at the same time it is computationally tractable. Furthermore, we compare the complexity of these models and discuss some insights on a numerical example.     

Capturing incomplete information in resource allocation problems through numerical patterns

We look at the problem of optimizing complex operations with incomplete information where the missing information is revealed indirectly and imperfectly through historical decisions. Incomplete information is characterized by missing data elements governing operational behavior and unknown cost parameters. We assume some of this information may be indirectly captured in historical databases through flows characterizing resource movements. We can use these flows or other quantities derived from these flows as “numerical patterns” in our optimization model to reflect some of the incomplete information. We develop our methodology for representing information in resource allocation models using the concept of pattern regression. We use a popular goodness-of-fit measure known as the Cramer–Von Mises metric as the foundation of our approach. We then use a hybrid approach of solving a cost model with a term known as the “pattern metric” that minimizes the deviations of model decisions from observed quantities in a historical database. We present a novel iterative method to solve this problem. Results with real-world data from a large freight railroad are presented.     

Batching in single operation manufacturing systems

We introduce a new decision problem important to the efficient operation of resources in manufacturing systems. This problem of ‘batching’ is considered for single machine activities. It is shown that even for these simple models, lot splitting may occur and that these batching decisions may have a dramatic impact on the manufacturing lead time of items to be processed.     

Real R&D options and optimal activation of two-dimensional random controls

We value investments under uncertainty with embedded optional costly controls (impulse-type with uncertain outcome) that capture managerial intervention for value enhancement and/or information acquisition (exploration, R&D, advertising, marketing research, etc). Implementing real option models but neglecting such embedded managerial actions can severely underestimate investment opportunities and lead to erroneous investment decisions. Optimal decisions are solutions to a maximization problem where the trade-off between the control's cost and the value added by such actions is explicitly taken into consideration. In this paper, we generalize such a methodology from one dealing with the special case of actions affecting only one state-variable, to one with actions that affect several. Asset values follow geometric Brownian motion or jump-diffusion processes with multiple generating sources of jumps. The Markov-chain numerical methodology we provide can handle sequential controls. Although we report the results with open-loop policies, the approach can be readily extended to accommodate dependency among the controls.     

Joint optimization of level of repair analysis and spare parts stocks

In the field of after sales service logistics for capital goods, generally, METRIC type methods are used to decide where to stock spare parts in a multi-echelon repair network such that a target availability of the capital goods is achieved. These methods generate a trade-off curve of spares investment costs versus backorders. Backorders of spare parts lead to unavailability of the capital goods. Inputs in the spare parts stocking problem are decisions on (1) which components to repair upon failure and which to discard, and (2) at which locations in the repair network to perform the repairs and discards. The level of repair analysis (LORA) can be used to make such decisions in conjunction with the decisions (3) at which locations to deploy resources, such as test equipment that are required to repair, discard, or move components. Since these decisions significantly impact the spare parts investment costs, we propose to solve the LORA and spare parts stocking problems jointly. We design an algorithm that finds efficient solutions. In order for the algorithm to be exact and because of its computational complexity, we restrict ourselves to two-echelon, single-indenture problems. In a computational experiment, we show that solving the joint problem is worthwhile, since we achieve a cost reduction of over 43% at maximum (5.1% on average) compared with using a sequential approach of first solving a LORA and then the spare parts stocking problem.     

A review of multi-product pricing models

The importance of good pricing strategies in business theory is clearly recognized, as can be seen from the huge volume of pricing research done over the years. What we attempt to do is to provide a general review of multi-product pricing models, focusing primarily on those where demands are explicitly dependent on prices. As the pricing decision may be made jointly with other economic parameters, we will not only review models that focus solely on pricing; we will also discuss models where pricing choices are made jointly with other decisions like production or distribution of resources.     

Reformulation versus cutting-planes for robust optimization

Robust optimization (RO) is a tractable method to address uncertainty in optimization problems where uncertain parameters are modeled as belonging to uncertainty sets that are commonly polyhedral or ellipsoidal. The two most frequently described methods in the literature for solving RO problems are reformulation to a deterministic optimization problem or an iterative cutting-plane method. There has been limited comparison of the two methods in the literature, and there is no guidance for when one method should be selected over the other. In this paper we perform a comprehensive computational study on a variety of problem instances for both robust linear optimization (RLO) and robust mixed-integer optimization (RMIO) problems using both methods and both polyhedral and ellipsoidal uncertainty sets. We consider multiple variants of the methods and characterize the various implementation decisions that must be made. We measure performance with multiple metrics and use statistical techniques to quantify certainty in the results. We find for polyhedral uncertainty sets that neither method dominates the other, in contrast to previous results in the literature. For ellipsoidal uncertainty sets we find that the reformulation is better for RLO problems, but there is no dominant method for RMIO problems. Given that there is no clearly dominant method, we describe a hybrid method that solves, in parallel, an instance with both the reformulation method and the cutting-plane method. We find that this hybrid approach can reduce runtimes to 50–75 % of the runtime for any one method and suggest ways that this result can be achieved and further improved on.     

Branch and bound based solution algorithms for the budget constrained discrete time/cost trade-off problem

The time/cost trade-off models in project management aim to reduce the project completion time by putting extra resources on activity durations. The budget problem in discrete time/cost trade-off scheduling selects a time/cost mode for each activity so as to minimize the project completion time without exceeding the available budget. There may be alternative modes that solve the budget problem optimally and each solution may have a different total cost value. In this study we consider the budget problem and aim to find the minimum cost solution among the minimum project completion time solutions. We analyse the structure of the problem together with its linear programming relaxation and derive some mechanisms for reducing the problem size. We solve the reduced problem by branch and bound based optimization and heuristic algorithms. We find that our branch and bound algorithm finds optimal solutions for medium-sized problem instances in reasonable times and the heuristic algorithms produce high quality solutions very quickly.     

Profit maximization in simultaneous lot-sizing and scheduling problem

This paper extends the simultaneous lot-sizing and scheduling problem, to include demand choice flexibility. The basic assumption in most research about lot-sizing and scheduling problems is that all the demands should be satisfied. However, in a business with a goal of maximizing profit, meeting all demands may not be an optimum decision. In the profit maximization simultaneous lot-sizing and scheduling problem with demand choice flexibility, the accepted demand in each period, lot-sizing and scheduling are three problems which are considered simultaneously. In other words the decisions pertaining to mid-term planning and short-term planning are considered as one problem and not hierarchically. According to this assumption, the objective function of traditional models changes from minimizing costs to maximizing profits.