Pages that link to "Item:Q857360"

The following pages link to Approximability of single machine scheduling with fixed jobs to minimize total completion time (Q857360):

Displaying 7 items.

• Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
• A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) (← links)
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints (Q1887763) (← links)
• Approximability of scheduling with fixed jobs (Q1964484) (← links)
• Optimal algorithms for scheduling under time-of-use tariffs (Q2241552) (← links)
• A short note on the approximation of the single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints (Q3402964) (← links)
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)