A quadratic edge-finding filtering algorithm for cumulative resource constraints

DOI10.1007/s10601-013-9157-zzbMath1314.90038OpenAlexW2086693061MaRDI QIDQ2342594

Yanyan Li

Publication date: 29 April 2015

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-013-9157-z

zbMATH Keywords

global constraintsconstraint-based schedulingedge-findingcumulative resourcetask intervals

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\) ⋮ A MinCumulative resource constraint ⋮ Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited ⋮ Synchronized sweep algorithms for scalable scheduling constraints

Uses Software

• PSPLIB
• CHIP
• Gecode
• BL data set

Cites Work

• Unnamed Item
• PSPLIB -- a project scheduling problem library
• Adjustment of heads and tails for the job-shop problem
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
• 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
• Max Energy Filtering Algorithm for Discrete Cumulative Resources

This page was built for publication: A quadratic edge-finding filtering algorithm for cumulative resource constraints