Complexities of some problems on multi-agent scheduling on a single machine
type: Item
instance of: scholarly article
title: Complexities of some problems on multi-agent scheduling on a single machine
zbMATH Open document ID: 1368.90080
author: Jinjiang Yuan
published in: Journal of the Operations Research Society of China
publication date: 2017-08-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6759235
zbMATH Keywords: multi-agent scheduling
zbMATH Keywords: competing agents
zbMATH Keywords: non-disjoint agents
zbMATH Keywords: unary NP-hard
MaRDI profile type: Publication
full work available at URL: s40305-016-0124-4
OpenAlex ID: W2300977462
cites work: Scheduling Problems with Two Competing Agents
cites work: A multiple-criterion model for machine scheduling
cites work: Multiagent Scheduling
cites work: Q4124332
cites work: Q4198056
DOI: 10.1007/S40305-016-0124-4
description: scientific article; zbMATH DE number 6759235