Pages that link to "Item:Q5450810"
From MaRDI portal
The following pages link to List Scheduling in Order of α-Points on a Single Machine (Q5450810):
Displaying 9 items.
- A note on the generalized min-sum set cover problem (Q408432) (← links)
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
- LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
- Resource cost aware scheduling (Q1750475) (← links)
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
- A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints (Q2450684) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
