Robust production planning with budgeted cumulative demand uncertainty

09/12/2020
by   Romain Guillaume, et al.
0

This paper deals with a problem of production planning, which is a version of the capacitated single-item lot sizing problem with backordering under demand uncertainty, modeled by uncertain cumulative demands. The well-known interval budgeted uncertainty representation is assumed. Two of its variants are considered. The first one is the discrete budgeted uncertainty, in which at most a specified number of cumulative demands can deviate from their nominal values at the same time.The second variant is the continuous budgeted uncertainty, in which the sum of the deviations of cumulative demands from their nominal values, at the same time, is at most a bound on the total deviation provided. For both cases, in order to choose a production plan that hedges against the cumulative demand uncertainty, the robust minmax criterion is used. Polynomial algorithms for evaluating the impact of uncertainty in the demand on a given production plan in terms of its cost, called the adversarial problem, and for finding robust production plans under the discrete budgeted uncertainty are constructed. Hence, in this case, the problems under consideration are not much computationally harder than their deterministic counterparts. For the continuous budgeted uncertainty, it is shown that the adversarial problem and the problem of computing a robust production plan along with its worst-case cost are NP-hard. In the case, when uncertainty intervals are non-overlapping, they can be solved in pseudopolynomial time and admit fully polynomial timeapproximation schemes. In the general case, a decomposition algorithm for finding a robust plan is proposed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2019

The robust bilevel continuous knapsack problem

We consider a bilevel continuous knapsack problem where the leader contr...
research
05/18/2021

On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective

We investigate the complexity of bilevel combinatorial optimization with...
research
05/16/2022

A Two-Phase Method for Production Planning and Machine Speed Optimization Problem

Textile industry is becoming a highly competitive area with the increase...
research
08/28/2020

Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty

Recoverable robust optimization is a multi-stage approach, where it is p...
research
07/20/2021

Robust unrelated parallel machine scheduling problem with interval release dates

This paper presents a profound analysis of the robust job scheduling pro...
research
08/27/2017

Capital flow constrained lot sizing problem with loss of goodwill and loan

We introduce capital flow constraints, loss of good will and loan to the...
research
01/10/2013

Robust Combination of Local Controllers

Planning problems are hard, motion planning, for example, isPSPACE-hard....

Please sign up or login with your details

Forgot password? Click here to reset