On the public citation graph
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
0 signed · 125 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/s0167-5060(08)70356-xopenalex-snapshot
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
inferredcites →https://doi.org/10.1051/ro/197610v300271openalex-snapshot
Application de la théorie des graphes au choix des investissements à court terme dans un réseau électrique sujet à avaries
inferredcites →https://doi.org/10.1287/mnsc.15.1.102openalex-snapshot
An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
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/opre.26.1.121openalex-snapshot
A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
inferredcites →https://doi.org/10.1287/opre.31.2.381openalex-snapshot
Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4705983openalex-extracted
Scheduling Equal-Processing-Time Jobs Under Time-of-Use Tariffs
inferred← citeshttps://doi.org/10.1002/(sici)1099-1425(199911/12)2:6<245::aid-jos28>3.0.co;2-5openalex-snapshot
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0786openalex-snapshot
Single Machine Scheduling
inferred← citeshttps://doi.org/10.1002/jos.85openalex-snapshot
Online real-time preemptive scheduling of jobs with deadlines on multiple machines
inferred← citeshttps://doi.org/10.1006/jagm.2000.1128openalex-snapshot
Eliminating Migration in Multi-processor Scheduling
inferred← citeshttps://doi.org/10.1007/3-540-44436-x_11openalex-snapshot
Online Real-Time Preemptive Scheduling of Jobs with Deadlines
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_29openalex-snapshot
Approximating the Advertisement Placement Problem
inferred← citeshttps://doi.org/10.1007/3-540-49481-2_8openalex-snapshot
Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_25openalex-snapshot
A Review of Machine Scheduling: Complexity, Algorithms and Approximability
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_23openalex-snapshot
Weighted Throughput Maximization with Calibrations
inferred← citeshttps://doi.org/10.1007/978-3-030-29908-8_49openalex-snapshot
Maximum Satisfiability Formulation for Optimal Scheduling in Overloaded Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-20350-3_3openalex-snapshot
Time-of-Use Scheduling Problem with Equal-Length Jobs
inferred← citeshttps://doi.org/10.1007/978-3-319-08840-2_11openalex-snapshot
Job Shop Scheduling with FPGA-Based F4SA
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_20openalex-snapshot
Throughput Maximization in Multiprocessor Speed-Scaling
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_24openalex-snapshot
Approximation Schemes for a Class of Subset Selection Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_38openalex-snapshot
Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_18openalex-snapshot
Universal Sequencing on a Single Machine
inferred← citeshttps://doi.org/10.1007/978-3-642-24829-0_17openalex-snapshot
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_2openalex-snapshot
Throughput Maximization for Speed-Scaling with Agreeable Deadlines
inferred← citeshttps://doi.org/10.1007/978-3-642-41880-8_1openalex-snapshot
Multiagent Scheduling Fundamentals
inferred← citeshttps://doi.org/10.1007/978-3-642-41880-8_2openalex-snapshot
Problems, Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-41880-8_4openalex-snapshot
Batching Scheduling Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-41880-8_5openalex-snapshot
Parallel Machine Scheduling Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-41880-8_6openalex-snapshot
Scheduling Problems with Variable Job Processing Times
inferred← citeshttps://doi.org/10.1007/978-3-642-58300-1_58openalex-snapshot
Scheduling with Deadlines and Nested Processing Intervals for a Single Machine
inferred← citeshttps://doi.org/10.1007/s00224-013-9449-0openalex-snapshot
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing
inferred← citeshttps://doi.org/10.1007/s10479-019-03298-9openalex-snapshot
Modeling single machine preemptive scheduling problems for computational efficiency
inferred← citeshttps://doi.org/10.1007/s10951-010-0210-0openalex-snapshot
Optimality proof of the Kise–Ibaraki–Mine algorithm
inferred← citeshttps://doi.org/10.1007/s10951-012-0307-8openalex-snapshot
A study of single-machine scheduling problem to maximize throughput
inferred← citeshttps://doi.org/10.1007/s10951-015-0452-yopenalex-snapshot
Throughput maximization for speed scaling with agreeable deadlines
inferred← citeshttps://doi.org/10.1007/s10951-023-00779-5openalex-snapshot
Competitive two-agent scheduling with release dates and preemption on a single machine
inferred← citeshttps://doi.org/10.1007/s10951-023-00786-6openalex-snapshot
The preemptive resource allocation problem
inferred← citeshttps://doi.org/10.1007/s11241-006-8198-4openalex-snapshot
Approximation algorithms for scheduling real-time jobs with multiple feasible intervals
inferred← citeshttps://doi.org/10.1007/s11590-012-0480-xopenalex-snapshot
Tower-of-sets analysis for the Kise–Ibaraki–Mine algorithm
inferred← citeshttps://doi.org/10.1007/s11590-017-1191-0openalex-snapshot
Online C-benevolent job scheduling on multiple machines
inferred← citeshttps://doi.org/10.1007/s11786-009-0003-zopenalex-snapshot
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
inferred← citeshttps://doi.org/10.1007/s40305-023-00495-zopenalex-snapshot
The Single-Machine Preemptive or Resumable Scheduling with Maintenance Intervals
inferred← citeshttps://doi.org/10.1007/s43069-024-00300-4openalex-snapshot
Algorithms for Scheduling Deadline-Sensitive Malleable Tasks
inferred← citeshttps://doi.org/10.1016/0895-7177(94)90209-7openalex-snapshot
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘tower of sets’ property
inferred← citeshttps://doi.org/10.1016/j.cie.2007.02.005openalex-snapshot
A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times
inferred← citeshttps://doi.org/10.1016/j.cie.2022.107969openalex-snapshot
Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs
inferred← citeshttps://doi.org/10.1016/j.cor.2011.11.002openalex-snapshot
Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107047openalex-snapshot
A local search enhanced logic-based Benders decomposition approach for order acceptance and scheduling problem with preemption
inferred← citeshttps://doi.org/10.1016/j.cor.2026.107553openalex-snapshot
Integrated production and transportation scheduling under no on-site storage, sequence-dependent setups, and multi-mode transportation
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.08.013openalex-snapshot
Minimizing the weighted number of tardy jobs on a single machine with release dates
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.09.042openalex-snapshot
Order acceptance and scheduling: A taxonomy and review
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.08.025openalex-snapshot
A practical dynamic programming based methodology for aircraft maintenance check scheduling optimization
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.03.043openalex-snapshot
A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.11.018openalex-snapshot
Single machine adversarial bilevel scheduling problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.09.005openalex-snapshot
Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.116180openalex-snapshot
Dynamic Programming algorithms and their applications in machine scheduling: A review
inferred← citeshttps://doi.org/10.1016/j.infsof.2019.06.001openalex-snapshot
Test case selection-prioritization approach based on memoization dynamic programming algorithm
inferred← citeshttps://doi.org/10.1016/j.omega.2024.103106openalex-snapshot
Maximizing the number of satisfied charging demands of electric vehicles on identical chargers
inferred← citeshttps://doi.org/10.1016/j.orl.2003.09.004openalex-snapshot
Preemptive scheduling of equal-length jobs to maximize weighted throughput
inferred← citeshttps://doi.org/10.1016/j.orl.2009.09.003openalex-snapshot
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.03.006openalex-snapshot
Approximation schemes for a class of subset selection problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.03.020openalex-snapshot
Throughput maximization in multiprocessor speed-scaling
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115258openalex-snapshot
Approximation algorithms for maximum weighted throughput on unrelated machines
inferred← citeshttps://doi.org/10.1016/s0167-6377(00)00061-4openalex-snapshot
On-line scheduling on a single machine: maximizing the number of early jobs
inferred← citeshttps://doi.org/10.1016/s0167-6377(98)00045-5openalex-snapshot
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00353-8openalex-snapshot
A branch and bound to minimize the number of late jobs on a single machine with release time constraints
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00356-3openalex-snapshot
Nonpreemptive flowshop scheduling with machine dominance
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00438-1openalex-snapshot
Using short-term memory to minimize the weighted number of late jobs on a single machine
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00434-xopenalex-snapshot
A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation
inferred← citeshttps://doi.org/10.1023/a:1009822211065openalex-snapshot
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
inferred← citeshttps://doi.org/10.1023/b:josh.0000036860.90818.5fopenalex-snapshot
Approximating the Advertisement Placement Problem
inferred← citeshttps://doi.org/10.1051/ro/2013025openalex-snapshot
Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
inferred← citeshttps://doi.org/10.1051/ro:2001103openalex-snapshot
Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals
inferred← citeshttps://doi.org/10.1109/allerton.2011.6120300openalex-snapshot
Scheduling for data center interactive services
inferred← citeshttps://doi.org/10.1109/allerton.2015.7447050openalex-snapshot
Algorithms for scheduling deadline-sensitive malleable tasks
inferred← citeshttps://doi.org/10.1109/ccdc65474.2025.11090325openalex-snapshot
A Study of Recombination and Local Search Operators for the Single Machine Scheduling Problem with Release Dates
inferred← citeshttps://doi.org/10.1109/glocom.2011.6133933openalex-snapshot
Resource Allocation for On-Demand Data Delivery to High-Speed Trains via Trackside Infostations
inferred← citeshttps://doi.org/10.1109/icccn.2012.6289253openalex-snapshot
Handovers with Forward Admission Control for Adaptive TCP Streaming in LTE-Advanced with Small Cells
inferred← citeshttps://doi.org/10.1109/icdcs.2011.91openalex-snapshot
Tians Scheduling: Using Partial Processing in Best-Effort Applications
inferred← citeshttps://doi.org/10.1109/icsssm.2006.320674openalex-snapshot
Minimizing the number of late jobs in single machine scheduling with nested execution intervals
inferred← citeshttps://doi.org/10.1109/icsssm.2018.8465050openalex-snapshot
New Results on Multitasking via Alternate Period Processing
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5160912openalex-snapshot
Resource-aware allocation strategies for divisible loads on large-scale systems
inferred← citeshttps://doi.org/10.1109/ipdps.2013.26openalex-snapshot
Energy-Efficient Scheduling for Best-Effort Interactive Services to Achieve High Response Quality
inferred← citeshttps://doi.org/10.1109/isetc.2018.8583984openalex-snapshot
Dynamic programming optimization algorithm applied in test case selection
inferred← citeshttps://doi.org/10.1109/isie.2002.1026069openalex-snapshot
Scheduling with due dates and deadlines
inferred← citeshttps://doi.org/10.1109/ispan.2002.1004262openalex-snapshot
Online real-time job scheduling with rate of progress guarantees
inferred← citeshttps://doi.org/10.1109/iwqos.2014.6914317openalex-snapshot
Jointly optimal selection and scheduling for lossy transmission of dependent frames with delay constraint
inferred← citeshttps://doi.org/10.1109/jsac.2012.120512openalex-snapshot
Efficient On-Demand Data Service Delivery to High-Speed Trains in Cellular/Infostation Integrated Networks
inferred← citeshttps://doi.org/10.1109/pdp.2007.73openalex-snapshot
Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1109/rtcsa.2005.28openalex-snapshot
Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs
inferred← citeshttps://doi.org/10.1109/sahcn.2013.6645019openalex-snapshot
Minimizing capacity requirements of cellular networks via delayed scheduling
inferred← citeshttps://doi.org/10.1109/tcomm.2026.3692016openalex-snapshot
Optimality and Approximation Ratios of Demodulator Allocation Strategies in LoRa Multi-Gateway Networks
inferred← citeshttps://doi.org/10.1109/tmc.2018.2877681openalex-snapshot
Distributed Dynamic Packet Scheduling Framework for Handling Disturbances in Real-Time Wireless Networks
inferred← citeshttps://doi.org/10.1109/tvt.2014.2361120openalex-snapshot
Efficient Scheduling for Video Transmissions in Maritime Wireless Communication Networks
inferred← citeshttps://doi.org/10.1109/tvt.2017.2696078openalex-snapshot
User Behavior-Aware Scheduling Based on Time–Frequency Resource Conversion
inferred← citeshttps://doi.org/10.1137/1.9781611973075.109openalex-snapshot
Algorithms and Complexity for Periodic Real-Time Scheduling
inferred← citeshttps://doi.org/10.1137/1.9781611974317.11openalex-snapshot
Real-Time k-bounded Preemptive Scheduling
inferred← citeshttps://doi.org/10.1137/110844210openalex-snapshot
Universal Sequencing on an Unreliable Machine
inferred← citeshttps://doi.org/10.1137/s0097539799354138openalex-snapshot
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
inferred← citeshttps://doi.org/10.1145/2312005.2312051openalex-snapshot
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters
inferred← citeshttps://doi.org/10.1145/2390176.2390182openalex-snapshot
Algorithms and complexity for periodic real-time scheduling
inferred← citeshttps://doi.org/10.1145/2742343openalex-snapshot
Near-Optimal Scheduling Mechanisms for Deadline-Sensitive Jobs in Large Computing Clusters
inferred← citeshttps://doi.org/10.1145/301250.301420openalex-snapshot
Approximating the throughput of multiple machines under real-time scheduling
inferred← citeshttps://doi.org/10.1145/3210377.3210407openalex-snapshot
The Price of Bounded Preemption
inferred← citeshttps://doi.org/10.1145/335305.335401openalex-snapshot
Improvements in throughout maximization for real-time scheduling
inferred← citeshttps://doi.org/10.1145/3569582openalex-snapshot
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
inferred← citeshttps://doi.org/10.1145/3798129.3800912openalex-snapshot
Improved Approximation Algorithms for Non-preemptive Throughput Maximization
inferred← citeshttps://doi.org/10.1155/2021/9615463openalex-snapshot
Modeling and Solving Scheduling in Overloaded Situations with Weighted Partial MaxSAT
inferred← citeshttps://doi.org/10.1186/s13638-017-0986-0openalex-snapshot
Scheduling multi-task jobs with extra utility in data centers
inferred← citeshttps://doi.org/10.1287/ijoc.1080.0273openalex-snapshot
Single-Machine Scheduling Problems with Generalized Preemption
inferred← citeshttps://doi.org/10.1287/opre.1090.0744openalex-snapshot
Competitive Two-Agent Scheduling and Its Applications
inferred← citeshttps://doi.org/10.15439/2016f441openalex-snapshot
Minimizing the Number of Late Multi-Task Jobs on Identical Machines in Parallel
inferred← citeshttps://doi.org/10.24963/ijcai.2019/773openalex-snapshot
Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging
inferred← citeshttps://doi.org/10.32657/10220/46906openalex-snapshot
Combinatorial algorithms for scheduling jobs to minimize server usage time
inferred← citeshttps://doi.org/10.3390/a19010038openalex-snapshot
Single Machine Scheduling Problems: Standard Settings and Properties, Polynomially Solvable Cases, Complexity and Approximability
inferred← citeshttps://doi.org/10.3934/jimo.2014.10.219openalex-snapshot
A survey of single machine scheduling to minimize weighted number of tardy jobs
inferred← citeshttps://doi.org/10.48550/arxiv.1402.3782openalex-snapshot
Throughput Maximization in Multiprocessor Speed-Scaling
inferred← citeshttps://doi.org/10.48550/arxiv.1904.06150openalex-snapshot
Maximizing Online Utilization with Commitment
inferred← citeshttps://doi.org/10.5267/j.ijiec.2011.04.003openalex-snapshot
A mathematical model for weighted tardy jobs scheduling problem with a batched delivery system
inferred← citeshttps://doi.org/10.7166/19-2-100openalex-snapshot
HEURISTICS FOR MINIMIZING THE NUMBER OF TARDY JOBS ON A SINGLE MACHINE WITH RELEASE TIME
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.