Pages that link to "Item:Q920838"

The following pages link to On the exact upper bound for the Multifit processor scheduling algorithm (Q920838):

Displaying 17 items.

• Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690) (← links)
• Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
• Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
• Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
• Performance ratios of the Karmarkar-Karp differencing method (Q867023) (← links)
• Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528) (← links)
• Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792) (← links)
• A tighter bound for FFd algorithm (Q1594856) (← links)
• Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
• Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
• The effect of machine availability on the worst-case performance of LPT (Q1775060) (← links)
• Parallel machine scheduling under a grade of service provision (Q1879792) (← links)
• Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) (Q2326400) (← links)
• Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations (Q2398648) (← links)
• Exact performance of MULTIFIT for nonsimultaneous machines (Q2440111) (← links)
• An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
• A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately (Q5436247) (← links)