Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14732
For citation please use:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMöhring, Rolf H.
dc.contributor.authorSchulz, Andreas S.
dc.contributor.authorStork, Frederik
dc.contributor.authorUetz, Marc
dc.date.accessioned2021-12-17T10:17:50Z-
dc.date.available2021-12-17T10:17:50Z-
dc.date.issued2000
dc.identifier.issn2197-8085
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/15959-
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-14732-
dc.description.abstractIn project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable problems in operations research, and has therefore become a popular playground for the latest optimization techniques, including virtually all local search paradigms. We show that a somewhat more classical mathematical programming approach leads to both competitive feasible solutions and strong lower bounds, within quite reasonable computation times. The basic ingredients of our approach are the Lagrangian relaxation of a time-indexed integer programming formulation and relaxation-based list scheduling, enriched with a useful idea from recent approximation algorithms for machine scheduling problems. The efficiency of the algorithm results from the insight that the relaxed problem can be solved by computing a minimum cut in an appropriately defined directed graph. Our computational study covers different types of resource-constrained project scheduling problems, based on several, notoriously hard test sets, including practical problem instances from chemical production planning.en
dc.language.isoenen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.ddc510 Mathematiken
dc.subject.otherproject schedulingen
dc.subject.otherLagrangian relaxationen
dc.subject.otherlower boundsen
dc.subject.otherminimum cutsen
dc.subject.otherordering heuristicsen
dc.titleSolving Project Scheduling Problems by Minimum Cut Computationsen
dc.typeResearch Paperen
tub.accessrights.dnbfreeen
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber2000, 680en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen
dc.type.versionsubmittedVersionen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften » Inst. Mathematikde
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-680-2000.pdf
Format: Adobe PDF | Size: 211.51 kB
DownloadShow Preview
Thumbnail
Report-680-2000.ps.gz
Format: Unknown | Size: 94.83 kB
Download
Report-680-2000.ps
Format: Postscript | Size: 311.01 kB
Download

Item Export Bar

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