Pages that link to "Item:Q2424661"
From MaRDI portal
The following pages link to A note on a two-agent scheduling problem related to the total weighted late work (Q2424661):
Displaying 14 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)
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works (Q2083387) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
- Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work (Q2673557) (← links)
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← 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)
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion (Q6093999) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
- A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)
