Scheduling: Agreement graph vs resource constraints

We investigate two scheduling problems. The first is scheduling with agreements (SWA) that consists in scheduling a set of jobs non-preemptively on identical machines in a minimum time, subject to constraints that only some specific jobs can be scheduled concurrently. These constraints are represented by an agreement graph. We extend the NP-hardness of SWA with three distinct values of processing times to only two values and this definitely closes the complexity status of SWA on two machines with two fixed processing times. The second problem is the so-called resource-constrained scheduling. We prove that SWA is polynomially equivalent to a special case of the resource-constrained scheduling and deduce new complexity results of the latter.

[1]  Wieslaw Kubiak,et al.  Scheduling tasks on two processors with deadlines and additional resources , 1986 .

[2]  Henryk Krawczyk,et al.  An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems , 1985, IEEE Transactions on Computers.

[3]  Zhihui Xue,et al.  Review of Scheduling computer and manufacturing processes by Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Guenter Schmidt, Jan Weglarz Springer-Verlag 2001 , 2003 .

[4]  Lucio Bianco,et al.  Nonpreemptive scheduling of independent tasks with prespecified processor allocations , 1994 .

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

[6]  Mourad Boudhar,et al.  Scheduling jobs on identical machines with agreement graph , 2012, Comput. Oper. Res..

[7]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[8]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks on Three Dedicated Processors , 1992, Inf. Process. Lett..

[9]  Frédéric Gardi.  Mutual exclusion scheduling with interval graphs or related classes, Part I , 2009, Discret. Appl. Math..

[10]  Guy Kortsarz,et al.  Multicoloring trees , 2003, Inf. Comput..

[11]  Marek Kubale,et al.  The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors , 1987, Information Processing Letters.

[12]  Edward G. Coffman,et al.  Mutual Exclusion Scheduling , 1996, Theor. Comput. Sci..

[13]  Edward G. Coffman,et al.  Scheduling File Transfers , 1985, SIAM J. Comput..

[14]  Dana Ron,et al.  Scheduling with conflicts: online and offline algorithms , 2009, J. Sched..

[15]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[16]  Han Hoogeveen,et al.  Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations , 1994, Discret. Appl. Math..

[17]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[18]  Klaus Jansen,et al.  Restrictions of Graph Partition Problems. Part I , 1995, Theor. Comput. Sci..

[19]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..

[20]  J. Baewicz,et al.  A linear time algorithm for restricted bin packing and scheduling problems , 1983 .