Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14454
For citation please use:
Main Title: 1D Vehicle Scheduling with Conflicts
Author(s): Gellert, Torsten J.
König, Felix G.
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15681
http://dx.doi.org/10.14279/depositonce-14454
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Systems of rail-mounted vehicles play a key role in many logistics applications, and the efficiency of their operation frequently has a significant impact on the overall performance of the surrounding production environment. In theory, assigning transport requests to the vehicles of such systems and scheduling their execution amounts to finding k tours on a common line, where tours may never cross each other in time--dynamic collision constraints need to be respected. The goal is to minimize the makespan for a given set of transport requests.
Subject(s): vehicle scheduling
makespan
conflicts
heuristics
computational
Issue Date: 2010
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2010, 22
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-022-2010.pdf
Format: Adobe PDF | Size: 148.41 kB
DownloadShow Preview
Thumbnail
Report-022-2010.ps
Format: Postscript | Size: 2.65 MB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.