A Competitive Two-Agent Scheduling Problem on Parallel Machines with Release Dates and Preemption

Yawei Qi and Long Wan

Mathematical Problems in Engineering, 2013, vol. 2013, 1-5

Abstract:

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 and each having their own job sets and , respectively. Each job has a release date and the jobs need to be preemptively scheduled on identical machines. For , we show that the trade-off curve of all the Pareto optimal points can be characterized in polynomial time. When is input, we show that can be solved in strongly polynomial time.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2013/124083.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2013/124083.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:124083

DOI: 10.1155/2013/124083

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().