Robust Wagner–Whitin algorithm with uncertain costs
Authors
Abstract:
In real-world applications, costs for products are not deterministic: neither static nor dynamic. They actually tend to be non-stationary and cross-correlated. To overcome this drawback, there have been some efforts by researchers to extend the Wagner–Whitin algorithm to consider stochastic costs. However, they assume that the information of probability density function of random costs exists. This paper applied a robust approach in reformulating the uncertain lot-sizing problem and used the Wagner–Whitin algorithm to find an optimal solution of its robust counterpart. The solution of the proposed algorithm in an example from the literature is compared with the classical one.
similar resources
Robust shortest path problems with uncertain costs
Data coming from real-world applications are very often affected by uncertainty. On the other hand, it is difficult to translate uncertainty in terms of combinatorial optimization. In this paper we study a combinatorial optimization model to deal with uncertainty in arc costs in shortest path problems. We consider a model where feasible arc cost scenarios are described via a convex polytope. We...
full textRobust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
full textRobust Algorithm for the Uncertain Scheduling Problem with Moving Executors
In the paper the combined routing-scheduling problem which consists in scheduling of tasks on moving executors is considered. The case with non-preemptive and independent tasks, unrelated executors as well as interval processing times to minimize the maximum lateness is investigated. The robust scheduling problem based on the modified relative regret function is formulated. The solution algorit...
full textStandby Redundancy Optimization Problems with Uncertain Lifetimes and Uncertain Costs
Redundancy optimization problem with cost constraints is a typical problem in reliability engineering. This study investigates standby redundancy optimization problem with uncertain lifetimes and uncertain costs. Three models for optimizing different performances of a standby system are formulated. In these models, maximizing the reliability measure, maximizing the system lifetime and minimizin...
full textDynamic Disclosure with Uncertain Disclosure Costs∗
This paper extends the canonical single-period model of voluntary costly disclosure to a dynamic setting with asymmetric information over disclosure costs. I show that dynamic incentives have an ambiguous effect on firms’ disclosure decision and that the cost of disclosure no longer prevents full disclosure by all firms. My main results show that (1) there is a positive inter-temporal connectio...
full textrobust simultaneous lot-sizing & scheduling model with uncertain demand
optimization models have been used to support decision making in production planning for a long time. however, several of those models are deterministic and do not address the variability that is present in some of the data. robust optimization is a methodology which can deal with the uncertainty or variability in optimization problems by computing a solution which is feasible for all possible ...
full textMy Resources
Journal title
volume 15 issue 3
pages -
publication date 2019-09-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023