On the public citation graph

A scheduling algorithm for tasks described by Time Value Function

0 signed · 102 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4613-4383-7openalex-snapshot
Machine Scheduling Problems
inferredcites →https://doi.org/10.1007/bf00364958openalex-snapshot
A study on the timeliness property in real-time systems
inferredcites →https://doi.org/10.1057/jors.1978.228openalex-snapshot
Machine Scheduling Problems
inferredcites →https://doi.org/10.1109/2.7053openalex-snapshot
Misconceptions about real-time computing: a serious problem for next-generation systems
inferredcites →https://doi.org/10.1109/5.259423openalex-snapshot
Real-time computing: a new discipline of computer science and engineering
inferredcites →https://doi.org/10.1109/5.259426openalex-snapshot
Scheduling algorithms and operating systems support for real-time systems
inferredcites →https://doi.org/10.1109/5.259427openalex-snapshot
Generalized rate-monotonic scheduling theory: a framework for developing real-time systems
inferredcites →https://doi.org/10.1109/ftdcs.1990.138302openalex-snapshot
Critical issues for the development of distributed real-time computing systems
inferredcites →https://doi.org/10.1109/real.1988.51113openalex-snapshot
Implementation and evaluation of a time-driven scheduling processor
inferredcites →https://doi.org/10.1137/0110015openalex-snapshot
A Dynamic Programming Approach to Sequencing Problems
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1145/321921.321934openalex-snapshot
Algorithms for Scheduling Independent Tasks
inferredcites →https://doi.org/10.1287/mnsc.16.1.77openalex-snapshot
A Functional Equation and its Application to Resource Allocation and Sequencing Problems
inferredcites →https://doi.org/10.1287/mnsc.24.5.530openalex-snapshot
The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
inferredcites →https://doi.org/10.1287/mnsc.26.6.633openalex-snapshot
Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem
inferredcites →https://doi.org/10.1287/mnsc.27.10.1209openalex-snapshot
A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints
inferredcites →https://doi.org/10.1287/mnsc.30.5.644openalex-snapshot
Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure
inferredcites →https://doi.org/10.1287/moor.13.2.330openalex-snapshot
One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
inferredcites →https://doi.org/10.1287/opre.38.1.22openalex-snapshot
Sequencing with Earliness and Tardiness Penalties: A Review
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470455432.ch23openalex-snapshot
Two Auction‐Based Resource Allocation Environments: Design and Experience
inferred← citeshttps://doi.org/10.1002/spe.2373openalex-snapshot
Design and analysis of target-sensitive real-time systems
inferred← citeshttps://doi.org/10.1007/978-3-319-16086-3_16openalex-snapshot
Utility-Based Scheduling of $$(m,k)$$-Firm Real-Time Task Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-19746-3_11openalex-snapshot
A Survey on SON for Enhanced ICIC
inferred← citeshttps://doi.org/10.1007/978-3-540-31967-2_4openalex-snapshot
Adaptivity for Quality and Timeliness Flexible Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-14412-7_2openalex-snapshot
Improving Architecture-Based Self-adaptation Using Preemption
inferred← citeshttps://doi.org/10.1007/978-3-642-19186-2_8openalex-snapshot
Opportunistic Packet Scheduling in Body Area Networks
inferred← citeshttps://doi.org/10.1007/s10586-018-1744-8openalex-snapshot
FCC: Fast congestion control scheme for wireless sensor networks using hybrid optimal routing algorithm
inferred← citeshttps://doi.org/10.1007/s11241-006-6738-6openalex-snapshot
Applying pinwheel scheduling and compiler profiling for power-aware real-time scheduling
inferred← citeshttps://doi.org/10.1007/s11241-009-9074-9openalex-snapshot
A gravitational task model with arbitrary anchor points for target sensitive real-time applications
inferred← citeshttps://doi.org/10.1016/j.parco.2020.102686openalex-snapshot
Dynamic power management for value-oriented schedulers in power-constrained HPC system
inferred← citeshttps://doi.org/10.1016/s1383-7621(99)00008-9openalex-snapshot
The meaning and role of value in scheduling flexible real-time systems
inferred← citeshttps://doi.org/10.1023/a:1013433504150openalex-snapshot
Flexible Soft Real-Time Processing in Middleware
inferred← citeshttps://doi.org/10.1109/cmpsac.2004.1342655openalex-snapshot
Adaptive time-critical resource management using time/utility functions: past, present, and future
inferred← citeshttps://doi.org/10.1109/date.2004.1269051openalex-snapshot
Quasi-static scheduling for real-time systems with hard and soft tasks
inferred← citeshttps://doi.org/10.1109/date.2012.6176536openalex-snapshot
On-line scheduling of target sensitive periodic tasks with the gravitational task model
inferred← citeshttps://doi.org/10.1109/ecrts.2008.25openalex-snapshot
A Gravitational Task Model for Target Sensitive Real-Time Applications
inferred← citeshttps://doi.org/10.1109/ecrts.2009.11openalex-snapshot
On-Line Scheduling Algorithm for the Gravitational Task Model
inferred← citeshttps://doi.org/10.1109/ecrts.2011.30openalex-snapshot
Scalable Utility Aware Scheduling Heuristics for Real-time Tasks with Stochastic Non-preemptive Execution Intervals
inferred← citeshttps://doi.org/10.1109/efta.2007.4416760openalex-snapshot
Uniprocessor scheduling under time-interval constraints
inferred← citeshttps://doi.org/10.1109/emrts.2001.933990openalex-snapshot
Three obstacles to flexible scheduling
inferred← citeshttps://doi.org/10.1109/hpcsim.2015.7237070openalex-snapshot
Market-inspired dynamic resource allocation in many-core high performance computing systems
inferred← citeshttps://doi.org/10.1109/hpdc.2004.1323519openalex-snapshot
Balancing risk and reward in a market-based task service
inferred← citeshttps://doi.org/10.1109/hpdc.2004.5openalex-snapshot
Balancing risk and reward in a market-based task service
inferred← citeshttps://doi.org/10.1109/hpdc.2006.1652143openalex-snapshot
Service contracts and aggregate utility functions
inferred← citeshttps://doi.org/10.1109/icme.2013.6607525openalex-snapshot
Time utility function based packet scheduling algorithm for streaming scalable media
inferred← citeshttps://doi.org/10.1109/icpads.2004.79openalex-snapshot
Scheduling distributable real-time threads in Tempus middleware
inferred← citeshttps://doi.org/10.1109/icpp.2002.1040870openalex-snapshot
BPA: a fast packet scheduling algorithm for real-time switched Ethernet networks
inferred← citeshttps://doi.org/10.1109/icpp.2002.1040909openalex-snapshot
A best-effort communication protocol for real-time broadcast networks
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925051openalex-snapshot
Toward a realization of the value of benefit in real-time systems
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303085openalex-snapshot
Time-utility scheduling and provably correct critical computer-based systems
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303086openalex-snapshot
On the joint utility accrual model
inferred← citeshttps://doi.org/10.1109/ipdps.2011.123openalex-snapshot
Time Utility Functions for Modeling and Evaluating Resource Allocations in a Heterogeneous Computing System
inferred← citeshttps://doi.org/10.1109/isorc.2003.1199242openalex-snapshot
A systems engineering approach for constructing certifiable real-time distributed systems
inferred← citeshttps://doi.org/10.1109/isorc.2004.1300389openalex-snapshot
On utility accrual real-time channel establishment in multi-hop networks
inferred← citeshttps://doi.org/10.1109/isorc.2004.1300393openalex-snapshot
Utility accrual scheduling under joint utility and resource constraints
inferred← citeshttps://doi.org/10.1109/isorc.2005.39openalex-snapshot
On Recent Advances in Time/Utility Function Real-Time Scheduling and Resource Management
inferred← citeshttps://doi.org/10.1109/isorc.2005.52openalex-snapshot
Stochastic, Utility Accrual Real-Time Scheduling with Task-Level and System-Level Timeliness Assurances
inferred← citeshttps://doi.org/10.1109/isorc.2016.34openalex-snapshot
Value and Energy Aware Adaptive Resource Allocation of Soft Real-Time Jobs on Many-Core HPC Data Centers
inferred← citeshttps://doi.org/10.1109/milcom.2000.904078openalex-snapshot
Communications architectures and capability improvement evaluation methodology
inferred← citeshttps://doi.org/10.1109/pdcat46702.2019.00035openalex-snapshot
Adaptive Power Reallocation for Value-Oriented Schedulers in Power-Constrained HPC
inferred← citeshttps://doi.org/10.1109/rtcsa.2005.102openalex-snapshot
Utility Accrual Real-Time Scheduling under Variable Cost Functions
inferred← citeshttps://doi.org/10.1109/rtcsa.2005.69openalex-snapshot
Power-Aware Real-Time Scheduling Using Pinwheel Model and Profiling Technique
inferred← citeshttps://doi.org/10.1109/rtcsa.2005.72openalex-snapshot
Quasi-Static Scheduling for Multiprocessor Real-Time Systems with Hard and Soft Tasks
inferred← citeshttps://doi.org/10.1109/rtcsa.2009.61openalex-snapshot
A Scheduling Algorithm for Execution-Instant Sensitive Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtss.2010.28openalex-snapshot
Optimizing Expected Time Utility in Cyber-Physical Systems Schedulers
inferred← citeshttps://doi.org/10.1109/sc.2005.58openalex-snapshot
Profitable services in an uncertain world
inferred← citeshttps://doi.org/10.1109/tc.2004.61openalex-snapshot
Fast, best-effort real-time scheduling algorithms
inferred← citeshttps://doi.org/10.1109/tc.2005.153openalex-snapshot
Time/Utility Function Decomposition Techniques for Utility Accrual Scheduling Algorithms in Real-Time Distributed Systems
inferred← citeshttps://doi.org/10.1109/tc.2006.47openalex-snapshot
A utility accrual scheduling algorithm for real-time activities with mutual exclusion resource constraints
inferred← citeshttps://doi.org/10.1109/tc.2006.62openalex-snapshot
Utility accrual channel establishment in multihop networks
inferred← citeshttps://doi.org/10.1109/tc.2010.151openalex-snapshot
Performance Optimization Based on Analytical Modeling in a Real-Time System with Constrained Time/Utility Functions
inferred← citeshttps://doi.org/10.1109/tc.2014.2360513openalex-snapshot
Utility Functions and Resource Management in an Oversubscribed Heterogeneous Computing Environment
inferred← citeshttps://doi.org/10.1109/tii.2011.2172447openalex-snapshot
Profit and Penalty Aware Scheduling for Real-Time Online Services
inferred← citeshttps://doi.org/10.1109/tmm.2014.2359335openalex-snapshot
Low-Complexity Packet Scheduling Algorithms for Streaming Scalable Media Based on Time Utility Function
inferred← citeshttps://doi.org/10.1109/tpds.2004.1264796openalex-snapshot
Time-utility function-driven switched ethernet: packet scheduling algorithm, implementation, and feasibility analysis
inferred← citeshttps://doi.org/10.1109/tpds.2010.50openalex-snapshot
Utility Accrual Dynamic Routing in Real-Time Parallel Systems
inferred← citeshttps://doi.org/10.1109/tpds.2015.2474360openalex-snapshot
A 2-Approximation Algorithm for Scheduling Parallel and Time-Sensitive Applications to Maximize Total Accrued Utility Value
inferred← citeshttps://doi.org/10.1109/tpds.2020.2967373openalex-snapshot
A Value-Oriented Job Scheduling Approach for Power-Constrained and Oversubscribed HPC Systems
inferred← citeshttps://doi.org/10.1109/tse.2004.45openalex-snapshot
A formally verified application-level framework for real-time scheduling on POSIX real-time operating systems
inferred← citeshttps://doi.org/10.1109/tsusc.2018.2797890openalex-snapshot
Resilience-Aware Resource Management for Exascale Computing Systems
inferred← citeshttps://doi.org/10.1109/twc.2013.081413.121651openalex-snapshot
Dynamic eICIC — A Proactive Strategy for Improving Spectral Efficiencies of Heterogeneous LTE Cellular Networks by Leveraging User Mobility and Traffic Dynamics
inferred← citeshttps://doi.org/10.1109/vtc2020-fall49728.2020.9348504openalex-snapshot
Maximize Potential Reserved Task Scheduling for URLLC Transmission and Edge Computing
inferred← citeshttps://doi.org/10.1109/waina.2008.262openalex-snapshot
LRTG: Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems
inferred← citeshttps://doi.org/10.1109/wstfes.2003.1201354openalex-snapshot
A power-aware, best-effort real-time task scheduling algorithm
inferred← citeshttps://doi.org/10.1142/9789812709677_0238openalex-snapshot
ENERGY-EFFICIENT SCHEDULING USING PINWHEEL AND IMPRECISE COMPUTATION MODEL FOR UNI-PROCESSOR AND MULTI-PROCESSOR REAL-TIME SYSTEMS
inferred← citeshttps://doi.org/10.1145/1017753.1017768openalex-snapshot
Energy-efficient, utility accrual scheduling under resource constraints for mobile embedded systems
inferred← citeshttps://doi.org/10.1145/1066677.1066873openalex-snapshot
MSA
inferred← citeshttps://doi.org/10.1145/1165780.1165781openalex-snapshot
Energy-efficient, utility accrual scheduling under resource constraints for mobile embedded systems
inferred← citeshttps://doi.org/10.1145/1654059.1654098openalex-snapshot
Evaluating the impact of inaccurate information in utility-based scheduling
inferred← citeshttps://doi.org/10.1145/1774088.1774159openalex-snapshot
Profit and penalty aware (PP-aware) scheduling for tasks with variable task execution time
inferred← citeshttps://doi.org/10.1145/3057267openalex-snapshot
A Survey and Comparative Study of Hard and Soft Real-Time Dynamic Resource Allocation Strategies for Multi-/Many-Core Systems
inferred← citeshttps://doi.org/10.1145/3306309.3306339openalex-snapshot
Revenue-Driven Scheduling in Drone Delivery Networks with Time-sensitive Service Level Agreements
inferred← citeshttps://doi.org/10.1145/3745756.3809203openalex-snapshot
TimelyLLM: Time-sensitive LLM Serving System for Physical-I/O Limited Agents
inferred← citeshttps://doi.org/10.1201/9781003337997openalex-snapshot
Dynamic Resource Allocation in Embedded, High-Performance and Cloud Computing
inferred← citeshttps://doi.org/10.13052/rp-9788793519077openalex-snapshot
Dynamic Resource Allocation in Embedded, High-Performance and Cloud Computing
inferred← citeshttps://doi.org/10.4230/lites-v004-i001-a002openalex-snapshot
Utility-Based Scheduling of (m,k)-firm Real-Time Tasks - New Empirical Results
inferred← citeshttps://doi.org/10.48550/arxiv.1601.07047openalex-snapshot
Bidding policies for market-based HPC workflow scheduling
inferred← citeshttps://doi.org/10.5555/2492708.2492852openalex-snapshot
On-line scheduling of target sensitive periodic tasks with the gravitational task model
inferred← citeshttps://doi.org/10.5555/968879.969132openalex-snapshot
Quasi-static scheduling for real-time systems with hard and soft tasks
inferred← citeshttps://doi.org/10.7936/k757198wopenalex-snapshot
Optimal Time Utility Based Scheduling Policy Design for Cyber-Physical Systems
inferred← citeshttps://doi.org/10.7936/k79s1p2hopenalex-snapshot
Utility-Aware Scheduling of Stochastic Real-Time Systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.