The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs

DOI10.1007/s10951-018-0598-5zbMath1432.90052OpenAlexW2904284844WikidataQ128780486 ScholiaQ128780486MaRDI QIDQ2286435

Rubing Chen, Jinjiang Yuan, Yuan Gao

Publication date: 22 January 2020

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-018-0598-5

zbMATH Keywords

total completion timetwo-agent schedulingtotal number of tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (13)

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 ⋮ Multitasking scheduling problems with two competitive agents ⋮ 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 ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ Online single-machine scheduling to minimize the linear combination of makespans of two agents ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs

Cites Work

• Unnamed Item
• A note on the complexity of the problem of two-agent scheduling on a single machine
• A multiple-criterion model for machine scheduling
• Competitive Two-Agent Scheduling and Its Applications
• Scheduling Problems with Two Competing Agents
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Parallel machine scheduling with high multiplicity

This page was built for publication: The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs