<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Dynamic optimization in supply chains</dc:title><dc:creator>Pupavac,	Drago	(Avtor)
	</dc:creator><dc:creator>Pašagić Škrinjar,	Jasmina	(Avtor)
	</dc:creator><dc:creator>Zelenika,	Ratko	(Avtor)
	</dc:creator><dc:subject>transportation</dc:subject><dc:subject>logistics</dc:subject><dc:subject>transportation networks</dc:subject><dc:subject>supply chains</dc:subject><dc:subject>optimization</dc:subject><dc:subject>dynamic programming</dc:subject><dc:subject>traffic</dc:subject><dc:description>Production and stock optimization in supply chains is a complex problem because it determines the optimum quantity production in time. Due to their multileveld nature, those problems are mostly solved by different methods and models of dynamic programming. The problem discussed in this paper refers to the determination of optimum quantity of production and stocks within the supply chain in a certain period of time, as well as in each sub-interval of a period, but with the condition that the production and stock expenditure remains minimal and that the predetermined demand in every sub-interval and throughout the entire observation period remains satisfied.</dc:description><dc:date>2007</dc:date><dc:date>2017-06-02 10:14:03</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>65980</dc:identifier><dc:identifier>ISSN: 0353-5320</dc:identifier><dc:identifier>UDK: 656:658.286:519.8</dc:identifier><dc:identifier>OceCobissID: 1416196</dc:identifier><dc:identifier>COBISS_ID: 11184918</dc:identifier><dc:identifier>DOI: 10.7307/ptt.v19i1.929</dc:identifier><dc:identifier>ISSN pri članku: 0353-5320</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:IPOPXYOC</dc:identifier><dc:language>sl</dc:language></metadata>
