Pages that link to "Item:Q922286"

The following pages link to A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q922286):

Displaying 34 items.

• Throughput maximization in multiprocessor speed-scaling (Q278716) (← links)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
• Minimizing the number of late jobs in a stochastic setting using a chance constraint (Q835575) (← links)
• Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
• Approximation algorithms for scheduling real-time jobs with multiple feasible intervals (Q853634) (← links)
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204) (← links)
• A note on the single machine scheduling to minimize the number of tardy jobs with deadlines (Q1038367) (← links)
• Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs (Q1043248) (← links)
• An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357) (← links)
• Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property (Q1341403) (← links)
• Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs (Q1342333) (← links)
• Online real-time preemptive scheduling of jobs with deadlines on multiple machines (Q1348736) (← links)
• Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
• Nonpreemptive flowshop scheduling with machine dominance (Q1604067) (← links)
• A truthful mechanism for value-based scheduling in cloud computing (Q1678764) (← links)
• Throughput maximization for speed scaling with agreeable deadlines (Q1702723) (← links)
• Online C-benevolent job scheduling on multiple machines (Q1744621) (← links)
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance (Q1761146) (← links)
• Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007) (← links)
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
• A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation (Q1887965) (← links)
• A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs (Q1891237) (← links)
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (Q1964481) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
• A practical dynamic programming based methodology for aircraft maintenance check scheduling optimization (Q2332998) (← links)
• Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm (Q2377225) (← links)
• Approximation schemes for a class of subset selection problems (Q2381527) (← links)
• Optimality proof of the Kise-Ibaraki-Mine algorithm (Q2434284) (← links)
• Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals (Q2765599) (← links)
• Throughput Maximization in Multiprocessor Speed-Scaling (Q2942633) (← links)
• Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times (Q6042072) (← links)
• Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)