<?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>Solution of the problem of critical path’s finding in Excel on the basis of reducing it to ordinary transportation task</dc:title><dc:creator>Drašković,	Mimo	(Avtor)
	</dc:creator><dc:creator>Malyaretz,	Ludmila	(Avtor)
	</dc:creator><dc:creator>Dorokhov,	Oleksandr	(Avtor)
	</dc:creator><dc:subject>task scheduling</dc:subject><dc:subject>transportation tasks</dc:subject><dc:subject>calculations</dc:subject><dc:subject>critical path</dc:subject><dc:subject>Excel</dc:subject><dc:subject>Solver</dc:subject><dc:subject>software tools</dc:subject><dc:description>The problem of determining the critical path for the scheduling tasks has been considered. An original technique for practical calculations using the available Solver add-on in Excel has been described. The proposed approach is based on reducing the task to solving the ordinary transportation problem, in particular to the problem of finding the longest path. Examples of solutions with the test input data and corresponding screenshots are given. The practical steps of the user’s action in the process of direct solution in Excel are consistently described. The analysis of the results of the proposed method has been performed and presented. It is established that presented method for calculating the critical path requires minimal efforts from the users, regardless of the dimension of the tasks.</dc:description><dc:date>2016</dc:date><dc:date>2018-05-09 10:20:18</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>70390</dc:identifier><dc:identifier>OceCobissID: 284206080</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:LDAUP5WA</dc:identifier><dc:language>sl</dc:language></metadata>
