A Competitive Two-Agent Scheduling Problem on Parallel Machines with Release Dates and Preemption
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-11-17
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Abstract EN
We consider a competitive two-agent scheduling problem on multiple identical machines with release dates and preemption.
In the scheduling model, there are two agents a and b each having their own job sets ?a={J1a,…,Jnaa} and ?b={J1b,…,Jnbb}, respectively.
Each job Jj∈?a∪?b has a release date ri and the n=na+nb jobs need to be preemptively scheduled on m identical machines.
For m=2, we show that the trade-off curve of all the Pareto optimal points can be characterized in polynomial time.
When m is input, we show that P|rj,pmtn|Lmaxa:Lmaxb≤Q can be solved in strongly polynomial time.
American Psychological Association (APA)
Qi, Yawei& Wan, Long. 2013. A Competitive Two-Agent Scheduling Problem on Parallel Machines with Release Dates and Preemption. Mathematical Problems in Engineering،Vol. 2013, no. 2013, pp.1-5.
https://search.emarefa.net/detail/BIM-1008478
Modern Language Association (MLA)
Qi, Yawei& Wan, Long. A Competitive Two-Agent Scheduling Problem on Parallel Machines with Release Dates and Preemption. Mathematical Problems in Engineering No. 2013 (2013), pp.1-5.
https://search.emarefa.net/detail/BIM-1008478
American Medical Association (AMA)
Qi, Yawei& Wan, Long. A Competitive Two-Agent Scheduling Problem on Parallel Machines with Release Dates and Preemption. Mathematical Problems in Engineering. 2013. Vol. 2013, no. 2013, pp.1-5.
https://search.emarefa.net/detail/BIM-1008478
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1008478