Approximation schemes for two-machine flow shop scheduling with two agents

Authors:
Wenchang Luo;Lin Chen;Guochuan Zhang
Affiliations:
Department of Mathematics, Zhejiang University, Hangzhou, China 310027;College of Computer Science, Zhejiang University, Hangzhou, China 310027;College of Computer Science, Zhejiang University, Hangzhou, China 310027
Venue:
Journal of Combinatorial Optimization
Year:
2012

Citing 8
Cited 1

A Multiple-Criterion Model for Machine Scheduling

Journal of Scheduling
Scheduling Problems with Two Competing Agents

Operations Research
A competitive scheduling problem and its relevance to UMTS channel assignment

Networks
A note on the scheduling with two families of jobs

Journal of Scheduling
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs

Theoretical Computer Science
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time

Information Processing Letters
A Lagrangian approach to single-machine scheduling problems with two competing agents

Journal of Scheduling
Competitive Two-Agent Scheduling and Its Applications

Operations Research

Approximation schemes for two-agent scheduling on parallel machines

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider two-machine flow shop scheduling with two agents. Two models are investigated. One is the weighted-sum optimization model and the other is the constrained optimization model. For the former, we show that it is weakly NP-hard and propose a fully polynomial time approximation scheme. For the latter, we also show the problem is weakly NP-hard. With violating the constraint a factor of 驴 a fully polynomial time approximation scheme is provided.