Optimal scheduling with strict deadlines

DOI10.1109/9.29398MaRDI QIDQ3468872zbMATH OpenOpenAlexFDO

Authors Partha Pratim Bhattacharya, Anthony Ephremides

Publication date 1989

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1903/4860

zbMATH Keywords

communicationdynamic schedulingstrict deadlinestransmission of messages

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Communication theory (94A05)

Recommendations

• Optimal scheduling with deadline constraints in tree networks
• Scheduling with deadlines and loss functions
• Optimal Stochastic Allocation of Machines under Waiting-Time Constraints
• Scheduling time-constrained communication in linear networks
• Opportunistic scheduling with deadline constraints in wireless networks

Cited in

(11)

• Convex comparison of service disciplines in real time queues
• On optimal lateness and tardiness scheduling in real-time systems
• Rejection rules in the \(M/G/1\) queue
• Optimal scheduling of contract algorithms with soft deadlines
• Optimization of discrete broadcast under uncertainty using conditional value-at-risk
• Comparisons of service disciplines in a tandem queueing network with real time constraints
• Scheduling with deadlines and loss functions
• Heuristic algorithms for the optimization of total weighted completion time for asynchronous transmission in a packet data transmission system
• Opportunistic scheduling with deadline constraints in wireless networks
• SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
• Optimal scheduling with deadline constraints in tree networks

This page was built for publication: Optimal scheduling with strict deadlines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3468872)