Pages that link to "Item:Q668562"
From MaRDI portal
The following pages link to Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562):
Displayed 8 items.
- A note on competing-agent Pareto-scheduling (Q1996756) (← links)
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← links)
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work (Q6076476) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
- Algorithms for a two‐machine flowshop problem with jobs of two classes (Q6090515) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)