Pages that link to "Item:Q2884502"

The following pages link to Non-Approximability Results for Scheduling Problems with Minsum Criteria (Q2884502):

Displaying 10 items.

• Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
• Maximizing business value by optimal assignment of jobs to resources in grid computing (Q958577) (← links)
• In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
• Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
• Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates (Q2294224) (← links)
• Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
• Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
• An improved approximation algorithm for scheduling under arborescence precedence constraints (Q5089259) (← links)
• Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
• Bounding the Running Time of Algorithms for Scheduling and Packing Problems (Q5890508) (← links)