Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14300
For citation please use:
Main Title: Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
Author(s): Skutella, Martin
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15527
http://dx.doi.org/10.14279/depositonce-14300
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Due to its obvious practical relevance, the Time-Cost Tradeoff Problem has achieved the attention of many researchers over the last thirty years. Within this context, we consider projects given by a set of single activities and precedence constraints on these activities. The duration of each activity is variable. However, the shorter the chosen duration is, the higher is the cost caused by executing the activity. This defines the proper time-cost tradeoff}: short project durations correspond to high cost and vice versa.
Subject(s): time-cost tradeoff
approximation algorithm
scheduling
bicriteria optimization
budget
Issue Date: 1996
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: 1996, 514
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-514-1996.pdf
Format: Adobe PDF | Size: 260.82 kB
DownloadShow Preview
Thumbnail
Report-514-1996.ps.gz
Format: Unknown | Size: 164.86 kB
Download

Item Export Bar

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