<?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>Scheduling Parallel Batching Machines problem and Lockmaster's problem</dc:title><dc:creator>Ivanišević,	Stefan	(Avtor)
	</dc:creator><dc:creator>Robič,	Borut	(Mentor)
	</dc:creator><dc:subject>Algorithms</dc:subject><dc:subject>Complexity</dc:subject><dc:subject>Scheduling Problems</dc:subject><dc:subject>Batching Problems</dc:subject><dc:subject>Flow shop</dc:subject><dc:subject>Scheduling Parallel Batching Machines problem</dc:subject><dc:subject>Locmkaster's problem</dc:subject><dc:description>Waterway transport plays an important role in the transport of goods in the world. Ships and different vessels travelling through the inland waterways can shorten their trip and have faster and safer delivery of their goods and services. Inland waterways also connect major cities and industrial zones and compared to other modes of transport, which are often confronted with congestion and capacity problems, inland waterway transport is characterized by its reliability, energy efficiency and major capacity for increased exploitation. Our work consists of creating the optimal schedule that allows ships to have faster and easier pass through waterways. We address two problems, the Scheduling Parallel Batching Machines problem and Lockmaster's problem, both scheduling problems and both on the subject of creating an optimal schedule for the ships passing through the waterways. We created currently the only open-source implementation of those problems, with the interactive visualisation of the results.</dc:description><dc:date>2021</dc:date><dc:date>2021-07-08 12:10:00</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>128318</dc:identifier><dc:identifier>VisID: 28764</dc:identifier><dc:identifier>COBISS_ID: 72241155</dc:identifier><dc:language>sl</dc:language></metadata>
