Cost-constrained planning for concurrency satisfaction

DOI10.1080/00207729708929365zbMATH Open0872.90053OpenAlexW2077327173MaRDI QIDQ3124689

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)

Cites Work

• Deduction graphs: an algorithm and applications
• Title not available (Why is that?)

Related Items (1)

Planning with Concurrency under Resources and Time Uncertainty

Recommendations

• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism 👍 👎
• Managing concurrency in temporal planning using planner-scheduler interaction 👍 👎
• Managing temporal cycles in planning problems requiring concurrency 👍 👎
• Planning with Concurrency under Resources and Time Uncertainty 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)