Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
From MaRDI portal
Publication:2025084
DOI10.1007/s10878-021-00697-2zbMath1468.90049OpenAlexW3121280145MaRDI QIDQ2025084
Publication date: 11 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00697-2
Related Items
Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single machine scheduling with two competing agents and equal job processing times
- Minimizing mean weighted execution time loss on identical and uniform processors
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
- A note on the scheduling with two families of jobs
- Approximation algorithms for scheduling a single machine to minimize total late work
- Complexities of four problems on two-agent scheduling
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- A note on competing-agent Pareto-scheduling
- Complexities of some problems on multi-agent scheduling on a single machine
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Two-agent scheduling on a single machine with release dates
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
- A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A note on a two-agent scheduling problem related to the total weighted late work
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Single Machine Scheduling to Minimize Total Late Work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Single‐machine scheduling with deadlines to minimize the total weighted late work
- Multiagent Scheduling
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
