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

Authors:
Kangbok Lee;Byung-Cheon Choi;Joseph Y. -T. Leung;Michael L. Pinedo
Affiliations:
Department of Information, Operations & Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY 10012-1126, USA;Department of Information, Operations & Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY 10012-1126, USA;Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA;Department of Information, Operations & Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY 10012-1126, USA
Venue:
Information Processing Letters
Year:
2009

Citing 8
Cited 11

Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Problems with Two Competing Agents

Operations Research
Rescheduling for New Orders

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

Networks
Competitive Two-Agent Scheduling and Its Applications

Operations Research
A note on scheduling to meet two min-sum objectives

Operations Research Letters

A two-machine flowshop problem with two agents

Computers and Operations Research
Single-machine scheduling problems with two agents competing for makespan

LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part I
Solving a two-agent single-machine scheduling problem considering learning effect

Computers and Operations Research
Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties

Information Sciences: an International Journal
Genetic algorithms for a two-agent single-machine problem with release time

Applied Soft Computing
Scheduling problems with two competing agents to minimized weighted earliness-tardiness

Computers and Operations Research
Two-agent singe-machine scheduling with release times to minimize the total weighted completion time

Computers and Operations Research
Approximation schemes for two-machine flow shop scheduling with two agents

Journal of Combinatorial Optimization
Approximation schemes for two-agent scheduling on parallel machines

Theoretical Computer Science
A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents

Applied Soft Computing
Self-Optimization module for Scheduling using Case-based Reasoning

Applied Soft Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider a multi-agent scheduling problem on a single machine in which each agent is responsible for his own set of jobs and wishes to minimize the total weighted completion time of his own set of jobs. It is known that the unweighted problem with two agents is NP-hard in the ordinary sense. For this case, we can reduce our problem to a Multi-Objective Shortest-Path (MOSP) problem and this reduction leads to several results including Fully Polynomial Time Approximation Schemes (FPTAS). We also provide an efficient approximation algorithm with a reasonably good worst-case ratio.