Approximation schemes for two-machine flow shop scheduling with two agents
type: Item
instance of: scholarly article
title: Approximation schemes for two-machine flow shop scheduling with two agents
zbMATH Open document ID: 1261.90019
author: Lin Chen
author: Wenchang Luo
author: Guochuan Zhang
published in: Journal of Combinatorial Optimization
publication date: 2013-01-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6121562
zbMATH Keywords: scheduling with two agents
zbMATH Keywords: flow shop
zbMATH Keywords: approximation scheme
MaRDI profile type: Publication
full work available at URL: s10878-011-9378-2
OpenAlex ID: W2043831821
cites work: Scheduling Problems with Two Competing Agents
cites work: Multi-agent single machine scheduling
cites work: A Lagrangian approach to single-machine scheduling problems with two competing agents
cites work: A competitive scheduling problem and its relevance to UMTS channel assignment
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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
cites work: Competitive Two-Agent Scheduling and Its Applications
cites work: Planning Machine Maintenance in Two-Machine Shop Scheduling
cites work: A note on the complexity of the problem of two-agent scheduling on a single machine
cites work: A note on the scheduling with two families of jobs
DOI: 10.1007/S10878-011-9378-2
description: scientific article; zbMATH DE number 6121562