Two-agent scheduling to minimize the total cost

► We consider a two-agent single-machine scheduling problem to minimize the total costs of the agents. ► The cost of the first agent is the maximum weighted completion time of his jobs and the cost of the second agent is the total weighted completion time of his jobs. ► We provide a 2-approximation...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 215; no. 1; pp. 39 - 44
Main Authors: Nong, Q.Q., Cheng, T.C.E., Ng, C.T.
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 16.11.2011
Elsevier
Elsevier Sequoia S.A
Series:European Journal of Operational Research
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Approximation
Approximation algorithm
Artificial intelligence
Completion time
Computer science; control theory; systems
Cost engineering
Exact sciences and technology
Inventory control, production control. Distribution
Mathematical analysis
Multi-agent
Operational research
Operational research and scientific management
Operational research. Management science
Operations research
Polynomial time approximation scheme
Production scheduling
Resource scheduling
Scheduling
Scheduling algorithms
Scheduling Multi-agent Approximation algorithm Polynomial time approximation scheme
Scheduling, sequencing
Studies
Theoretical computing
Multi-agent
Polynomial time approximation scheme
Scheduling
Approximation algorithm
Costs
Polynomial approximation
Makespan
Polynomial time
Multiagent system
NP hard problem
Artificial intelligence
Completion time
Execution time
ISSN:0377-2217, 1872-6860
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:► We consider a two-agent single-machine scheduling problem to minimize the total costs of the agents. ► The cost of the first agent is the maximum weighted completion time of his jobs and the cost of the second agent is the total weighted completion time of his jobs. ► We provide a 2-approximation algorithm for the problem. ► We show that the case where the number of jobs of the first agent is fixed is NP-hard. ► We devise a polynomial time approximation scheme for this case. Two agents, each having his own set of jobs, compete to perform their own jobs on a common processing resource. Each job of the agents has a weight that specifies its importance. The cost of the first agent is the maximum weighted completion time of his jobs while the cost of the second agent is the total weighted completion time of his jobs. We consider the scheduling problem of determining the sequence of the jobs such that the total cost of the two agents is minimized. We provide a 2-approximation algorithm for the problem, show that the case where the number of jobs of the first agent is fixed is NP-hard, and devise a polynomial time approximation scheme for this case.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2011.05.041