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 9 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)
• 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)