Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
type: Item
instance of: scholarly article
title: Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
zbMATH Open document ID: 1487.90332
author: Long Wan
author: Jiajie Mei
author: Jiangze Du
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7354576
zbMATH Keywords: two-agent scheduling
zbMATH Keywords: completion time
zbMATH Keywords: tardy job
zbMATH Keywords: NP-completeness
zbMATH Keywords: FPTAS
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.07.064
OpenAlex ID: W3047691004
cites work: Multiagent Scheduling
cites work: Scheduling Problems with Two Competing Agents
cites work: A multiple-criterion model for machine scheduling
cites work: The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: Scheduling two agents on uniform parallel machines with~makespan and cost functions
cites work: Two-agent scheduling on uniform parallel machines with min-max criteria
cites work: Bounded parallel-batching scheduling with two competing agents
cites work: A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
cites work: Q4198056
cites work: Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria
cites work: Two-agent scheduling of time-dependent jobs
cites work: Complexity of two dual criteria scheduling problems
cites work: Capacitated two-parallel machines scheduling to minimize sum of job completion times
cites work: Competitive Two-Agent Scheduling and Its Applications
cites work: Two‐agent scheduling on a single sequential and compatible batching machine
cites work: Single machine scheduling with two competing agents and equal job processing times
cites work: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
cites work: Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
cites work: Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
cites work: Q3378953
cites work: A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
cites work: Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
cites work: Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
cites work: A note on the scheduling with two families of jobs
DOI: 10.1016/J.EJOR.2020.07.064
description: scientific article; zbMATH DE number 7354576