Pages that link to "Item:Q1961232"

The following pages link to Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232):

Displaying 22 items.

• Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
• Scheduling with bully selfish jobs (Q692928) (← links)
• A 2-OPT procedure to reduce total inspection time in a serial inspection process (Q877228) (← links)
• Partially ordered knapsack and applications to scheduling (Q881568) (← links)
• Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602) (← links)
• Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
• On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
• A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (Q1414243) (← links)
• A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine (Q1970412) (← links)
• Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• Minimum equivalent precedence relation systems (Q2410264) (← links)
• Asymptotically optimal schedules for single-server flow shop problems with setup costs and times (Q2488240) (← links)
• A 2-approximation algorithm for the network substitution problem (Q2583715) (← links)
• Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
• Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
• Approximating Weighted Completion Time for Order Scheduling with Setup Times (Q3297757) (← links)
• A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
• On Submodular Search and Machine Scheduling (Q5108249) (← links)
• Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
• Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
• Decision diagrams for solving a job scheduling problem under precedence constraints (Q5140712) (← links)