A one-off is not a schedule with a count of one
The requests people actually want to send once are specific: publish this at nine on Tuesday, expire this trial at the end of the month, trigger this migration during the maintenance window, call this webhook after the embargo lifts, kick off a job once the DNS change has propagated.
Expressing that in a recurring scheduler means creating a schedule that will match once, then remembering to remove it before it matches again next month - and the second half is the part that gets forgotten, because by then the thing it was for is done and nobody is thinking about it. A one-shot primitive has no cleanup step, which is most of its value.
The infrastructure this replaces is absurdly large
Sending one HTTP request at a future moment is, conceptually, nothing. Obtaining the ability to do it usually means a server that stays running, or a queue with a delayed message, or a scheduled function and the deployment pipeline around it, or a third-party service with an account and a dashboard - all so that a single request can be made at a time you already know.
For a side project, a static site, or a one-time coordination between two systems that have no other reason to know about each other, that is a large amount of machinery for a small amount of behaviour. Setting the time and the destination and walking away is the right size for the problem.
What to assume about delivery
The request goes out at the scheduled moment. If the destination is down or slow at that instant, that is a real risk, and a one-shot request with minimal retrying is the wrong tool for anything where the consequence of a miss is serious. Financial operations, anything with a compliance deadline, anything that must happen exactly once and be proven to have happened - those need a system with retries, an audit trail and someone to page.
Design the receiving end to be idempotent regardless. Any scheduled call can arrive twice or arrive late, whatever sends it, and an endpoint that handles a repeat safely turns a whole class of scheduling problem into a non-event.