2010
DOI: 10.1016/j.ejor.2009.05.028
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of order policies in supply networks

Abstract: The purpose of this paper is to develop a model which allows for the study and optimization of arbitrarily complex supply networks, including order policies and money flows. We propose a mathematical description that captures the dynamic behavior of the system by a coupled system of ordinary differential delay equations. The underlying optimization problem is solved using discretization techniques yielding a mixed-integer programming problem.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 21 publications
(12 citation statements)
references
References 14 publications
0
12
0
Order By: Relevance
“…From a modeling point of view it may be desirable to rewrite the derived model in semi-discretized form. For scalar models this interpretation has been given in [21]. Due to the non-negative eigenvalues of the flux we apply an Upwind semi-discretization by the method of lines of equation 5…”
Section: 4mentioning
confidence: 99%
“…From a modeling point of view it may be desirable to rewrite the derived model in semi-discretized form. For scalar models this interpretation has been given in [21]. Due to the non-negative eigenvalues of the flux we apply an Upwind semi-discretization by the method of lines of equation 5…”
Section: 4mentioning
confidence: 99%
“…Flows on structured media have been studied widely in the literature in the past years and appear in an almost infinite variety. 8,9,16,26,29,31 Here, we will use a similar description of the underlying process as in Refs. 34 Kinetic part-feeding models for assembly lines 3 general graph structure has been studied and a kinetic partial differential equation for high-volume part flows is derived.…”
Section: Introductionmentioning
confidence: 97%
“…Additionally, we can also optimize the flow distribution at branching nodes in order to increase the throughput inside the network and thus the outflow, cf. routing problems in [8,10,11,14]. This leads to a so-called maximum flow problem, a well known problem in graph theory, see [5,12,20] for an overview.…”
Section: Steady State Analysismentioning
confidence: 99%
“…the min-function) into a dynamic mixed-integer framework. This alternative has been originally introduced in [8] and has been successfully applied to a wide variety of production problems in the meanwhile, see [11,14]. First of all, we choose a uniform discrete time grid T = {t : t = 0, .…”
Section: Mixed Integer Approachmentioning
confidence: 99%
See 1 more Smart Citation