Two competitive agents to minimize the weighted total late work and the total completion time
From MaRDI portal
Publication:2243272
DOI10.1016/j.amc.2021.126286OpenAlexW3158623846MaRDI QIDQ2243272
Publication date: 11 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2021.126286
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, Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
Cites Work
- Unnamed Item
- Unnamed Item
- Single machine scheduling with two competing agents and equal job processing times
- Two-agent scheduling in a flowshop
- Two-agent scheduling to minimize the total cost
- Scheduling two agents with controllable processing times
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- Price of fairness in two-agent single-machine scheduling problems
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Two-agent scheduling problems on a single-machine to minimize 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 single machine scheduling
- 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
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- Multiagent Scheduling
