Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14327
For citation please use:
Main Title: The Online Target Date Assignment Problem
Author(s): Heinz, Stefan
Krumke, Sven O.
Megow, Nicole
Rambau, Jörg
Tuchscherer, Andreas
Vredeveld, Tjark
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15554
http://dx.doi.org/10.14279/depositonce-14327
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Many online problems encountered in real-life involve a two-stage decision process: upon arrival of a new request, an irrevocable first-stage decision (the assignment of a specific resource to the request) must be made immediately, while in a second stage process, certain "subinstances" (that is, the instances of all requests assigned to a particular resource) can be solved to optimality (offline) later.
Subject(s): problem
OnlineTDAP
decisions
online problems
dates
Issue Date: 2005
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: 2005, 28
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-028-2005.pdf
Format: Adobe PDF | Size: 173.89 kB
DownloadShow Preview
Thumbnail
Report-028-2005.ps.gz
Format: Unknown | Size: 65.93 kB
Download

Item Export Bar

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