Cost-constrained planning for concurrency satisfaction

DOI10.1080/00207729708929365MaRDI QIDQ3124689zbMATH OpenOpenAlexFDO

Authors Edward Szczerbicki

Publication date 13 March 1997

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207729708929365

zbMATH Keywords

product designconcurrent engineeringdeduction graphsconcurrency satisfactionlife-cycle attributes

Mathematics Subject Classification ID

Theory of organizations, manpower planning in operations research (90B70)

Recommendations

• Planning with Concurrency under Resources and Time Uncertainty
• Managing concurrency in temporal planning using planner-scheduler interaction
• scientific article; zbMATH DE number 1080096
• Solving sequential planning problems via constraint satisfaction
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• scientific article; zbMATH DE number 1696711
• Managing temporal cycles in planning problems requiring concurrency

Cites work

• scientific article; zbMATH DE number 1125117 (Why is no real title available?)
• Deduction graphs: an algorithm and applications

Cited in

(3)

• Planning with Concurrency under Resources and Time Uncertainty
• scientific article; zbMATH DE number 814415 (Why is no real title available?)
• Concurrent engineering: a competitive strategy for process industries

This page was built for publication: Cost-constrained planning for concurrency satisfaction

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