Analysis of computer job control under uncertainty

DOI10.1134/S1064230711060062zbMath1307.93265OpenAlexW2050402346MaRDI QIDQ2263387

M. V. Kozlov, P. E. Golosov, A. F. Ronzhin, Yu. E. Malashenko, Irina A. Nazarova

Publication date: 18 March 2015

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230711060062

Mathematics Subject Classification ID

Control/observation systems involving computers (process control, etc.) (93C83) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

Control model for heterogeneous computational tasks based on guaranteed estimates of execution times ⋮ Controlling computationally intensive heterogeneous computational tasks with directive deadlines ⋮ Normative dynamic analysis of extreme operational modes of a heterogeneous computing system ⋮ Task scheduling in distributed real-time systems ⋮ Data aggregation for scheduling of resource-intensive computations under uncertainty ⋮ Control of resource-intensive computations under uncertainty. I. multiparametric model ⋮ Control of resource-intensive computations under uncertainty. II. Scheduling complex ⋮ Control of resource-intensive computations under uncertainty. III. Dynamic concurrent resource allocation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Job control in heterogeneous computing systems
• Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
• Single-machine scheduling to stochastically minimize maximum lateness
• Approximation results in parallel machines stochastic scheduling
• Job scheduling to minimize expected weighted flowtime on uniform processors
• The stochastic single machine scheduling problem with earliness and tardiness costs
• Minimizing the expected number of tardy jobs when processing times are normally distributed
• Safe scheduling: Setting due dates in single-machine problems
• Setting due dates in a stochastic single machine environment
• Lower Bounds for Smith’s Rule in Stochastic Machine Scheduling
• Scheduling tasks with exponential service times on parallel processors
• A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
• STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS
• Minimizing expected makespans on uniform processor systems
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
• Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
• Models and Algorithms for Stochastic Online Scheduling
• Approximation in Preemptive Stochastic Online Scheduling
• Scheduling with Random Service Times

This page was built for publication: Analysis of computer job control under uncertainty