A note on competing-agent Pareto-scheduling
From MaRDI portal
Publication:1996756
DOI10.1007/s11590-020-01576-1zbMath1460.90087OpenAlexW3014924016MaRDI QIDQ1996756
Publication date: 26 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01576-1
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Pareto-scheduling of two competing agents with their own equal processing times ⋮ Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
Cites Work
- Single machine scheduling with two competing agents and equal job processing times
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
- Pareto minimizing total completion time and maximum cost with positional due indices
- Complexity results for scheduling chains on a single machine
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Single-machine scheduling with positional due indices and positional deadlines
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines
- A note on a two-agent scheduling problem related to the total weighted late work
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Multicriteria scheduling
- Scheduling Problems with Two Competing Agents
- Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- Multiagent Scheduling
- Unnamed Item
- Unnamed Item
- Unnamed Item
