An Approximative Criterion for the Potential of Energetic Reasoning

dc.contributor.author	Berthold, Timo
dc.contributor.author	Heinz, Stefan
dc.contributor.author	Schulz, Jens
dc.date.accessioned	2021-12-17T10:08:54Z
dc.date.available	2021-12-17T10:08:54Z
dc.date.issued	2010
dc.description.abstract	Energetic reasoning is one of the most powerful propagation algorithms in cumulative scheduling. In practice, however, it is commonly not used because it has a high running time and its success highly depends on the tightness of the variable bounds. In order to speed up energetic reasoning, we provide a necessary condition to detect infeasibilities, which can be tested efficiently.	en
dc.identifier.issn	2197-8085
dc.identifier.uri	https://depositonce.tu-berlin.de/handle/11303/15685
dc.identifier.uri	http://dx.doi.org/10.14279/depositonce-14458
dc.language.iso	en	en
dc.rights.uri	http://rightsstatements.org/vocab/InC/1.0/	en
dc.subject.ddc	510 Mathematik	en
dc.subject.other	scheduling	en
dc.subject.other	energetic reasoning	en
dc.title	An Approximative Criterion for the Potential of Energetic Reasoning	en
dc.type	Research Paper	en
dc.type.version	submittedVersion	en
tub.accessrights.dnb	free	en
tub.affiliation	Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik	de
tub.affiliation.faculty	Fak. 2 Mathematik und Naturwissenschaften	de
tub.affiliation.institute	Inst. Mathematik	de
tub.publisher.universityorinstitution	Technische Universität Berlin	en
tub.series.issuenumber	2010, 19	en
tub.series.name	Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin	en

Files

Now showing 1 - 1 of 1