Pages that link to "Item:Q280185"

The following pages link to Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions (Q280185):

Displaying 9 items.

• Editorial ``Project management and scheduling'' (Q280155) (← links)
• Single-processor scheduling with time restrictions (Q490336) (← links)
• Better permutations for the single-processor scheduling with time restrictions (Q523167) (← links)
• On the NP-hardness of scheduling with time restrictions (Q1662160) (← links)
• The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
• A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling (Q3983500) (← links)
• (Q4368203) (← links)
• On the minimum number of resources for a perfect schedule (Q6100682) (← links)
• EPTAS for parallel identical machine scheduling with time restrictions (Q6123390) (← links)