Pages that link to "Item:Q1306357"

The following pages link to An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357):

Displaying 25 items.

• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Improving the preemptive bound for the single machine dynamic maximum lateness problem (Q614050) (← links)
• Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
• Online production planning to maximize the number of on-time orders (Q829183) (← 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)
• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552) (← links)
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q922286) (← links)
• Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs (Q1043248) (← links)
• Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
• Throughput maximization for speed scaling with agreeable deadlines (Q1702723) (← links)
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance (Q1761146) (← links)
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← 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)
• Scheduling to tradeoff between the number and the length of accepted jobs (Q2235744) (← links)
• Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
• A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine (Q2294390) (← links)
• Speed scaling problems with memory/cache consideration (Q2317139) (← links)
• Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm (Q2377225) (← links)
• Optimality proof of the Kise-Ibaraki-Mine algorithm (Q2434284) (← links)
• Online scheduling of bounded length jobs to maximize throughput (Q2434304) (← links)
• Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization (Q5130573) (← links)
• On-line scheduling on a single machine: Maximizing the number of early jobs (Q5929136) (← links)
• Time-of-use scheduling problem with equal-length jobs (Q6111939) (← links)