Coupled-Tasks in Presence of Bipartite Compatibilities Graphs

We tackle the makespan minimization coupled-tasks problem in presence of incompatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in the framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain, \(\ldots \)). In such context, we design efficient polynomial-time approximation algorithms according to different parameters of the scheduling problem.

[1]  Jean-Claude König,et al.  Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs , 2014 .

[2]  Hans Kellerer,et al.  The Multiple Subset Sum Problem , 2000, SIAM J. Optim..

[3]  Hans Kellerer,et al.  An efficient fully polynomial approximation scheme for the Subset-Sum Problem , 2003, J. Comput. Syst. Sci..

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

[5]  Hans Kellerer,et al.  A PTAS for the Multiple Subset Sum Problem with different knapsack capacities , 2000, Inf. Process. Lett..

[6]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[7]  Gilles Simonin,et al.  Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks , 2013 .

[8]  Benjamin Lev,et al.  The role of internal storage capacity in fixed cycle production systems , 1980 .

[9]  Jean-Claude König,et al.  Complexity and Approximation for Scheduling Problem for Coupled-Tasks in Presence of Compatibility Tasks , 2010 .

[10]  Milind Dawande,et al.  Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions , 2000, J. Comb. Optim..

[11]  Jean-Claude König,et al.  Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor , 2009, J. Sched..

[12]  Hans Kellerer,et al.  A 3/4-Approximation Algorithm for Multiple Subset Sum , 2003, J. Heuristics.

[13]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[14]  Jean-Claude König,et al.  Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks , 2010, Electron. Notes Discret. Math..

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

[16]  Michal Tanas,et al.  Scheduling of coupled tasks , 2004 .