Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
type: Item
instance of: scholarly article
title: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
zbMATH Open document ID: 1188.90103
author: Baruch Mor
author: Gur Mosheiov
published in: European Journal of Operational Research
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5720422
zbMATH Keywords: multi-agent scheduling
zbMATH Keywords: single machine
zbMATH Keywords: earliness
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.03.003
OpenAlex ID: W2020768508
cites work: Scheduling Problems with Two Competing Agents
cites work: A Lagrangian approach to single-machine scheduling problems with two competing agents
cites work: A multiple-criterion model for machine scheduling
cites work: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
cites work: Multi-agent scheduling on a single machine with max-form criteria
cites work: Scheduling with Opting Out: Improving upon Random Priority
cites work: Sequencing games
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
cites work: Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
cites work: A note on the complexity of the problem of two-agent scheduling on a single machine
DOI: 10.1016/J.EJOR.2010.03.003
description: scientific article; zbMATH DE number 5720422