Pages that link to "Item:Q2311120"

The following pages link to An approximation algorithm for multi-agent scheduling on two uniform parallel machines (Q2311120):

Displaying 10 items.

• A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
• Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634) (← links)
• Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks (Q1753463) (← links)
• Approximation schemes for two-agent scheduling on parallel machines (Q1935796) (← links)
• An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines (Q2317128) (← links)
• Two Heterarchical Multiagent Approaches for FMS Dynamic Scheduling (Q4466844) (← links)
• Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621) (← links)
• (Q6097273) (← links)
• Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines (Q6593671) (← links)
• Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization (Q6657877) (← links)