Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
type: Item
instance of: scholarly article
title: Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
zbMATH Open document ID: 1498.90083
author: Cheng He
author: Hao Lin
author: Xinxin Han
published in: Discrete Applied Mathematics
publication date: 2022-10-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7600622
zbMATH Keywords: series-batch
zbMATH Keywords: bounded
zbMATH Keywords: two-agent scheduling
zbMATH Keywords: makespan
zbMATH Keywords: maximum cost
Wikidata QID: Q114191393
MaRDI profile type: Publication
full work available at URL: j.dam.2022.08.001
OpenAlex ID: W4292702007
cites work: Multiagent Scheduling
cites work: Scheduling Problems with Two Competing Agents
cites work: Multi-agent single machine scheduling
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: Sequencing games
cites work: Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: On games corresponding to sequencing situations with ready times
cites work: Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
cites work: Improved algorithms for two-agent scheduling on an unbounded serial-batching machine
cites work: Bounded serial-batching scheduling for minimizing maximum lateness and makespan
cites work: Serial-batching scheduling with two agents to minimize makespan and maximum cost
cites work: Multicriteria scheduling
cites work: Two-agent scheduling with agent specific batches on an unbounded serial batching machine
cites work: Competitive Two-Agent Scheduling and Its Applications
cites work: Complexities of some problems on multi-agent scheduling on a single machine
DOI: 10.1016/J.DAM.2022.08.001
Recommended article: Q5142948
Recommended article: Q5197262
Recommended article: Serial-batching scheduling with two agents to minimize makespan and maximum cost
Recommended article: Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
Recommended article: Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
Recommended article: Two-Agent Scheduling on an Unbounded Serial Batching Machine
Recommended article: Two‐agent scheduling on a single sequential and compatible batching machine
Recommended article: Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
Recommended article: A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
Recommended article: Two-agent scheduling with agent specific batches on an unbounded serial batching machine
description: scientific article; zbMATH DE number 7600622