Setup Cost Reduction in the Lumpy Demand Production Quantity Model with Discounting

[[notice]]補正完

Setup Cost Reduction and Supply Chain Coordination in Case of Asymmetric Information

Screening contracts are a common approach to solve supply chain coordination problems under asymmetric information. Previous research in this area shows that asymmetric information leads to supply chain coordination deficits. We extend the standard framework of lotsizing decisions under asymmetric information by allowing investments in setup cost reduction. We find that asymmetric information leads to an overinvestment in setup cost reduction. Yet, the overall effect on supply chain performance is ambiguous. We show that these results holds for a wide variety of investment functions.

Optimal continuous review policies for two product inventory systems with joint setup costs

Minimum average cost ordering policies for two product inventory systems with joint setup cost

Cost-efficient modeling of antenna structures using Gradient Enhanced Kriging

Reliable yet fast surrogate models are indispensable in the design of contemporary antenna structures. Data-driven models, e.g., based on Gaussian Processes or support-vector regression, offer sufficient flexibility and speed, however, their setup cost is large and grows very quickly with the dimensionality of the design space. In this paper, we propose cost-efficient modeling of antenna structures using Gradient-Enhanced Kriging. In our approach, the training data set contains, apart from the EM-simulation responses of the structure at hand, also derivative data at the respective training locations obtained at little extra cost using adjoint sensitivity techniques. We demonstrate that introduction of the derivative information into the model allows for considerable reduction of the model setup cost (in terms of the number of training points required) without compromising its predictive power. The Gradient-Enhanced Kriging technique is illustrated using a dielectric resonator antenna structure. Comparison with conventional Kriging interpolation is also provided

Enumerating Cyclic Orientations of a Graph

Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set; it is cyclic otherwise. As far as we know, only the enumeration of acyclic orientations has been addressed in the literature. In this paper, we pose the problem of efficiently enumerating all the \emph{cyclic} orientations of an undirected connected graph with $n$ vertices and $m$ edges, observing that it cannot be solved using algorithmic techniques previously employed for enumerating acyclic orientations.We show that the problem is of independent interest from both combinatorial and algorithmic points of view, and that each cyclic orientation can be listed with $\tilde{O}(m)$ delay time. Space usage is $O(m)$ with an additional setup cost of $O(n^2)$ time before the enumeration begins, or $O(mn)$ with a setup cost of $\tilde{O}(m)$ time

Minimizing setup cost for multipart production lines

http://www.usc.edu/dept/ise/caie/Checked%20Papers%20%5Bruhi%2012th%20sept%5D/word%20format%20papers/REGISTRATION%20PAID%20PAPERS%20FOR%20PROCEEDINGS/pdf/170%2014%20MINIMIZING%20SETUP%20COST%20FOR%20MULTI-PART%20PRODUCTION%20LINES.pdfInternational audienceAn industrial engineering problem is under study. It consists in optimal configuration of a multi-part production line. A line is a sequence of workstations, at which the manufacturing operations at each workstation are executed in parallel. Parallel execution of operations is inherent for multi-spindle heads in mechanical industry, for example. Each machine part of a specific type f requires a specific set of operations. Different sets can contain common operations. The total number of operations per workstation cannot exceed a given upper bound. Parts move along the stations in the same direction. If there is at least one operation attributed to the part type arriving at a station, this station is set up. Setup costs are part type dependent and they appear due to additional resources required for processing of a part at stations. There are two criteria: minimization of the number of stations, and minimization of the total setup cost. A solution of the problem implies the number of stations and the assignment of operations to these stations. Properties of an optimal solution were established. Basing on these properties, optimal algorithms were developed for the cases f = 2, f = 3, and an arbitrary f. The algorithms employ combinatorial optimization and linear algebra techniques. They run in a constant time if f is a constant

A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters

In this paper we derive a new structural property for an optimal solution of the economic lot-sizing problem with time-invariant cost parameters. We show that the total holding cost in an order interval of an optimal solution is bounded from above by a quantity proportional to the setup cost and the logarithm of the number of periods in the interval. Since we can also show that this bound is tight, this is in contrast to the optimality property of the economic order quantity (EOQ) model, where setup cost and holding cost are perfectly balanced. Furthermore, we show that this property can be used for the design of a new heuristic and that the result may be useful in worst case analysis.

Integrated Optimization Model of Production Planning and Scheduling for Batch Production

An integrated optimization model of production plan and scheduling is introduced. Function objective is to minimize sum of total setup cost (initial setup cost and related setup cost), stock cost, production cost and overtime cost. Restraint functions include equilibrium stock, production capacity, as while as scheduling restraints (procedure restriction and machine capacity restriction). Feasible plan can be set down with considering scheduling restraints