Pages that link to "Item:Q6116025"

The following pages link to Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025):

Displaying 10 items.

• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
• Preemptive scheduling with two minimax criteria (Q1599352) (← links)
• A note on competing-agent Pareto-scheduling (Q1996756) (← links)
• A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← links)
• Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← links)
• A just-in-time scheduling problem with two competing agents (Q2228372) (← links)
• Scheduling with release dates and preemption to minimize multiple max-form objective functions (Q2327626) (← links)
• Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness (Q2341390) (← links)
• Competitive Two-Agent Scheduling and Its Applications (Q3100480) (← links)
• Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines (Q6593671) (← links)