Pages that link to "Item:Q1996756"
From MaRDI portal
The following pages link to A note on competing-agent Pareto-scheduling (Q1996756):
Displaying 7 items.
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← links)
- Two-agent single-machine scheduling with release dates to minimize the makespan (Q6081603) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
- Two-agent scheduling in a two-machine open shop (Q6491675) (← links)
