A note on competing-agent Pareto-scheduling
type: Item
instance of: scholarly article
title: A note on competing-agent Pareto-scheduling
zbMATH Open document ID: 1460.90087
author: Yanyan Li
published in: Optimization Letters
publication date: 2021-02-26T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 7315900
zbMATH Keywords: competing agents
zbMATH Keywords: Pareto-scheduling
zbMATH Keywords: positional due indices
zbMATH Keywords: deadline
zbMATH Keywords: precedence constraint
MaRDI profile type: Publication
full work available at URL: s11590-020-01576-1
OpenAlex ID: W3014924016
cites work: Multiagent Scheduling
cites work: Scheduling Problems with Two Competing Agents
cites work: Single-machine scheduling with positional due indices and positional deadlines
cites work: Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
cites work: Pareto minimizing total completion time and maximum cost with positional due indices
cites work: Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
cites work: Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
cites work: Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
cites work: Multicriteria scheduling
cites work: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
cites work: Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
cites work: Q3048571
cites work: Q4124332
cites work: Complexity results for scheduling chains on a single machine
cites work: Single machine scheduling with two competing agents and equal job processing times
cites work: Q3378953
cites work: Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
cites work: Unary NP-hardness of minimizing the number of tardy jobs with deadlines
cites work: A note on a two-agent scheduling problem related to the total weighted late work
cites work: Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs
DOI: 10.1007/S11590-020-01576-1
description: scientific article; zbMATH DE number 7315900