Pages that link to "Item:Q1653276"
From MaRDI portal
The following pages link to Complexities of four problems on two-agent scheduling (Q1653276):
Displaying 10 items.
- Complexities of some problems on multi-agent scheduling on a single machine (Q2014052) (← links)
- 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)
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs (Q2286435) (← links)
- Scheduling with release dates and preemption to minimize multiple max-form objective functions (Q2327626) (← links)
- A note on the complexity of the problem of two-agent scheduling on a single machine (Q2385467) (← links)
- Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation (Q5059285) (← 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)
