Pages that link to "Item:Q1751210"
From MaRDI portal
The following pages link to Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs (Q1751210):
Displayed 4 items.
- 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)
- Bicriteria scheduling of equal length jobs on uniform parallel machines (Q2307491) (← links)
- Scheduling with release dates and preemption to minimize multiple max-form objective functions (Q2327626) (← links)