Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
From MaRDI portal
Publication:2029301
DOI10.1016/j.ejor.2020.07.064zbMath1487.90332OpenAlexW3047691004MaRDI QIDQ2029301
Jiangze Du, Long Wan, Jiajie Mei
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.07.064
Related Items (8)
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 ⋮ Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Online single-machine scheduling to minimize the linear combination of makespans of two agents
Cites Work
- Unnamed Item
- Unnamed Item
- Single machine scheduling with two competing agents and equal job processing times
- Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
- Two-agent scheduling on uniform parallel machines with min-max criteria
- A note on the scheduling with two families of jobs
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
- 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
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
- A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
- Two-agent scheduling of time-dependent jobs
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- Bounded parallel-batching scheduling with two competing agents
- A multiple-criterion model for machine scheduling
- Complexity of two dual criteria scheduling problems
- Competitive Two-Agent Scheduling and Its Applications
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling Problems with Two Competing Agents
- Two‐agent scheduling on a single sequential and compatible batching machine
- Multiagent Scheduling
This page was built for publication: Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
