An algorithm for constructing single processor static-dynamic schedules

DOI10.3103/S0278641918010053MaRDI QIDQ1789208zbMATH OpenOpenAlexFDO

Authors V. A. Kostenko, A. S. Smirnov

Publication date 10 October 2018

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s0278641918010053

zbMATH Keywords

real time systemsintegrated module avionicsmaximum flow in a transport networkschedule for performing work

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Transportation, logistics and supply chain management (90B06)

Recommendations

• scientific article; zbMATH DE number 1381924
• Algorithms for dynamic scheduling of unit execution time tasks
• A dynamic programming algorithm for single machine scheduling with ready times
• A note on single processor scheduling with time restrictions
• A dynamic programming method for single machine scheduling
• A note on single-processor scheduling with time-dependent execution times
• scientific article; zbMATH DE number 3991267

Cites work

• Computation scheduling in multiprocessor real-time automatic control systems with constrained processor memory
• Introduction to algorithms.
• Making schedules in multiprocessing systems with several additional resources
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Preemptive Scheduling of Uniform Processor Systems
• Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
• Some algorithms for resource allocation in multiprocessor systems

Cited in

(4)

• Algorithms for dynamic scheduling of unit execution time tasks
• An algorithm for scheduling exchanges over a bus with centralized control and an analysis of its efficiency
• A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times
• An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs

This page was built for publication: An algorithm for constructing single processor static-dynamic schedules

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