A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\)

DOI10.1007/s13226-013-0005-zzbMath1282.90070OpenAlexW1990265760MaRDI QIDQ2393571

Roger Kameugne, Laure Pauline Fotso

Publication date: 8 August 2013

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-013-0005-z

zbMATH Keywords

global constraintsconstraint-based schedulingcumulative resourcescumulative \(\theta\)-treeenergy envelopenot-first/not-last

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last ⋮ A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\) ⋮ Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited ⋮ Constraint propagation on GPU: a case study for the cumulative constraint ⋮ A quadratic edge-finding filtering algorithm for cumulative resource constraints

Uses Software

• PSPLIB
• Gecode
• BL data set

Cites Work

• Unnamed Item
• PSPLIB -- a project scheduling problem library
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• On not-first/not-last conditions in disjunctive scheduling
• Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
• A quadratic edge-finding filtering algorithm for cumulative resource constraints
• A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\)
• Edge Finding for Cumulative Scheduling
• Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources

This page was built for publication: A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\)