A Competitive Two-Agent Scheduling Problem on Parallel Machines with Release Dates and Preemption
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 schedul...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2013/124083 |