Incremental computation of resource-envelopes in producer-consumer models

DOI10.1007/B13743MaRDI QIDQ5897221zbMATH OpenOpenAlexFDO

Authors T. K. Satish Kumar

Publication date 2 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13743

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Economic growth models (91B62)

Recommendations

• Supporting dispatchability in schedules with consumable resources
• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
• Time-optimal resource allocation under stepwise consumption constraints
• scientific article; zbMATH DE number 3928700
• Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption.

Cited in

(2)

• A min-flow algorithm for minimal critical set detection in resource constrained project scheduling
• Supporting dispatchability in schedules with consumable resources

This page was built for publication: Incremental computation of resource-envelopes in producer-consumer models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897221)