arXiv (All)
open access
Parameterized Complexity of Scheduling Problems in Robotic Process Automation
This paper studies the growing domain of Robotic Process Automation (RPA) problems. Motivated by scheduling problems arising in RPA, we study the parameterized complexity of the single-machine problem with precedence constraints, release times, and deadlines (i.e., the problem known as $1|\operatorn
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Abstraction and Hierarchy Emerge from Control Feasibility Constraints#223255
- Ensuring Data Freshness in Multi-Rate Task Chains Scheduling#2727
- Execution-bound advisory automation for agentic AI: a reproducible AIBOM-driven CSAF-VEX framework.#239950
- The Reasonable Robot Standard: Bringing Artificial Intelligence Law into the 21st Century#964347
- ROSA: A Robotics Foundation Model Serving System for Robot Factories#329052
Record · ID 984966
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive