O (n log n) filtering algorithms for unary resource constraint

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F04%3A00005578" target="_blank" >RIV/00216208:11320/04:00005578 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

O (n log n) filtering algorithms for unary resource constraint

Original language description

So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another two filtering algorithms: not-first/not-last and propagation of detectable precedences. These two algorithms can be used together with the edge-finding to further improve the filtering. This paper also propose new O (n log n) implementation of fail detection (overload checking).

Czech name

O (n log n) filtrovací algorithmy pro unární omezení zdrojů

Czech description

Článek popisuje O(n log n) verze dvou filtrovacích algoritmů pro unární omezení zdrojů: ne-první/ne-poslední a propagace detekovatelných precedencí.

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F04%2F1102" target="_blank" >GA201/04/1102: Constraint-based planning and scheduling</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2004

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Lecture Notes In Computer Science

ISSN

0302-9743

e-ISSN

—

Volume of the periodical

3011

Issue of the periodical within the volume

1

Country of publishing house

DE - GERMANY

Number of pages

13

Pages from-to

335-347

UT code for WoS article

—

EID of the result in the Scopus database

—