Pages that link to "Item:Q5117378"

The following pages link to Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378):

Displaying 10 items.

• NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time (Q859949) (← links)
• Pareto minimizing total completion time and maximum cost with positional due indices (Q888315) (← links)
• Quality of move-optimal schedules for minimizing total weighted completion time (Q2480059) (← links)
• (Q3569627) (← links)
• Scheduling start time dependent jobs to minimize the total weighted completion time (Q4656674) (← links)
• Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
• (Q5697786) (← links)
• Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines (Q6126818) (← links)
• A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs (Q6565429) (← links)
• Approximating weighted completion time via stronger negative correlation (Q6620463) (← links)