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

Authors:
T. C. E. Cheng;C. T. Ng;J. J. Yuan
Affiliations:
Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan, People's Republic of China
Venue:
Theoretical Computer Science
Year:
2006

Citing 4
Cited 27

On games corresponding to sequencing situations with ready times

Mathematical Programming: Series A and B
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Multiple-Criterion Model for Machine Scheduling

Journal of Scheduling
Scheduling Problems with Two Competing Agents

Operations Research

Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A Lagrangian approach to single-machine scheduling problems with two competing agents

Journal of Scheduling
Competitive Two-Agent Scheduling and Its Applications

Operations Research
Two robust meta-heuristics for scheduling multiple job classes on a single machine with multiple criteria

Expert Systems with Applications: An International Journal
Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem

Expert Systems with Applications: An International Journal
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
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations

Computers and Industrial Engineering
A multi-agent system for decentralised fractional shared resource constraint scheduling

Web Intelligence and Agent Systems
Minimizing the number of late jobs on a single machine under due date uncertainty

Journal of Scheduling
Scheduling two agents on uniform parallel machines with makespan and cost functions

Journal of Scheduling
Two-agent scheduling with learning consideration

Computers and Industrial Engineering
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
Single-machine multi-agent scheduling problems with a global objective function

Journal of Scheduling
Two-Agent scheduling on an unbounded serial batching machine

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Genetic algorithms for a two-agent single-machine problem with release time

Applied Soft Computing
Two-agent singe-machine scheduling with release times to minimize the total weighted completion time

Computers and Operations Research
Unbounded parallel-batching scheduling with two competitive agents

Journal of Scheduling
Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations

Journal of Intelligent Manufacturing
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 study of the single-machine two-agent scheduling problem with release times

Applied Soft Computing
A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents

Applied Soft Computing
Bounded parallel-batching scheduling with two competing agents

Journal of Scheduling
A tabu method for a two-agent single-machine scheduling with deterioration jobs

Computers and Operations Research
Single machine scheduling with interfering job sets

Computers and Operations Research

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider the feasibility model of multi-agent scheduling on a single machine, where each agent's objective function is to minimize the total weighted number of tardy jobs. We show that the problem is strongly NP-complete in general. When the number of agents is fixed, we first show that the problem can be solved in pseudo-polynomial time for integral weights, and can be solved in polynomial time for unit weights; then we present a fully polynomial-time approximation scheme for the problem.