No article text was recorded for this version.
commitment timing constraints
Version 2 of 212 papers35 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A general framework for handling commitment in online throughput maximization
- Blog: Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
- Blog: A general framework for handling commitment in online throughput maximization
- Blog: Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
- Blog: A note on on-line broadcast scheduling with deadlines
- Blog: O(1/ε) is the answer in online weighted throughput maximization
- Blog: Truthful Online Scheduling with Commitments
- Blog: The Power of Migration for Online Slack Scheduling
- Blog: Resource cost aware scheduling
- Blog: List Update with Delays or Time Windows
- Blog: Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction
- Blog: Select and permute: An improved online framework for scheduling to minimize weighted completion time
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_commitment_timing_constraints_a5bdc911,
title = {commitment timing constraints},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/commitment-timing-constraints/rdr_a5bdc9112c0944cda39c7cbdcb74b43f},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_commitment_timing_constraints_a5bdc911_v2,
title = {commitment timing constraints},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/commitment-timing-constraints/rdr_a5bdc9112c0944cda39c7cbdcb74b43f/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}