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 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.

[1]  T. C. Edwin Cheng,et al.  Multi-agent scheduling on a single machine with max-form criteria , 2008, Eur. J. Oper. Res..

[2]  E. L. Lawler,et al.  Computing Maximal "Polymatroidal" Network Flows , 1982, Math. Oper. Res..

[3]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[4]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[5]  Sartaj Sahni,et al.  Scheduling Independent Tasks with Due Times on a Uniform Processor System , 1980, JACM.

[6]  Long Wan,et al.  A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints , 2015, J. Sched..

[7]  Charles U. Martel,et al.  Preemptive Scheduling with Release Times, Deadlines, and Due Times , 1982, JACM.

[8]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[9]  Gur Mosheiov,et al.  Scheduling problems with two competing agents to minimize minmax and minsum earliness measures , 2010, Eur. J. Oper. Res..

[10]  Weiping Shang,et al.  A note on the scheduling with two families of jobs , 2005, J. Sched..

[11]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[12]  Joseph Y.-T. Leung,et al.  Competitive Two-Agent Scheduling and Its Applications , 2010, Oper. Res..

[13]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

[14]  T. C. Edwin Cheng,et al.  A note on the complexity of the problem of two-agent scheduling on a single machine , 2006, J. Comb. Optim..

[15]  Alessandro Agnetis,et al.  Scheduling Problems with Two Competing Agents , 2004, Oper. Res..

[16]  T. C. Edwin Cheng,et al.  Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs , 2006, Theor. Comput. Sci..

[17]  Sartaj Sahni,et al.  Preemptive Scheduling with Due Dates , 1979, Oper. Res..

[18]  Eugene L. Lawler,et al.  Preemptive scheduling of uniform machines subject to release dates : (preprint) , 1979 .

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Jonathan Cole Smith,et al.  A Multiple-Criterion Model for Machine Scheduling , 2003, J. Sched..

[21]  Alessandro Agnetis,et al.  Multi-agent single machine scheduling , 2007, Ann. Oper. Res..

[22]  A. V. Karzanov,et al.  Determining the maximal flow in a network by the method of preflows , 1974 .

[23]  R. Tarjan.  A simple version of Karzanov's blocking flow algorithm , 1984 .