Optimal scheduling of progressive processing tasks

DOI10.1016/S0888-613X(00)00049-9MaRDI QIDQ1594849zbMATH OpenOpenAlexFDO

Authors Shlomo Zilberstein, Abdel-Illah Mouaddib

Publication date 29 January 2001

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0888-613x(00)00049-9

zbMATH Keywords

approximate reasoningMarkov decision problemsprogressive processingreal-time controlresource-bounded reasoningscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Markov and semi-Markov decision processes (90C40)

Recommendations

• Optimal Scheduling of Tasks on Identical Parallel Processors
• scientific article; zbMATH DE number 3970495
• Scheduling tasks with sequence-dependent processing times
• Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs
• Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors
• scientific article; zbMATH DE number 2219117
• scientific article; zbMATH DE number 1206104
• Optimal rate-based scheduling on multiprocessors
• Computing optimal preemptive schedules for parallel tasks: linear programming approaches

Cites work

• Automatically generating abstractions for planning

This page was built for publication: Optimal scheduling of progressive processing tasks

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