Pages that link to "Item:Q2884502"

The following pages link to Non-approximability results for scheduling problems with minsum criteria (Q2884502):

Displaying 20 items.

• Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
• Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
• Inapproximability results for no-wait job shop scheduling. (Q703234) (← links)
• Maximizing business value by optimal assignment of jobs to resources in grid computing (Q958577) (← links)
• Scheduling problems with non-regular penalty functions - a review (Q1106097) (← links)
• Non-approximability of precedence-constrained sequencing to minimize setups. (Q1421479) (← links)
• An improved lower bound for rank four scheduling (Q1785250) (← links)
• Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← 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)
• A note on scheduling to meet two min-sum objectives (Q2643821) (← 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)
• (Q5874275) (← links)
• Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)
• Minimizing total completion time with machine-dependent priority lists (Q6586213) (← links)
• Approximating weighted completion time via stronger negative correlation (Q6620463) (← links)