AI Paper Atlas

Research map / Reinforcement learning / Visual and representation RL

Deadline-Constrained Dynamic Workflow Scheduling Can be Cast as a Representation Learning Problem

Ya Shen, Gang Chen, Hui Ma, Mengjie Zhang

NeurIPS 2026 · Reinforcement learning › Visual and representation RL · approach: RL with tree search for discovery

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Casts deadline-constrained cost-aware dynamic workflow scheduling as a representation learning problem to minimize VM rental cost while meeting workflow deadlines.

Problem

Deadline-Constrained Cost-Aware Dynamic Workflow Scheduling (D-CADWS): minimizing VM rental cost while keeping high workflow deadline satisfaction in dynamic cloud environments, where the deadline impact of task-to-VM assignments is not directly observable at decision time.

Approach

Reframes D-CADWS as a representation learning problem so that long-horizon deadline effects (downstream dependencies, VM dynamics) are captured in learned representations used for scheduling decisions. Full method details are not available from the abstract.

Experimental setup

Metrics: VM rental cost workflow deadline satisfaction rate

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy